نتایج جستجو برای: enumerative in graph theory

تعداد نتایج: 17122970  

1990
FRANCESCO BRENTI Thomas H. Brylawski

We present a general result that, using the theory of symmetric functions, produces several new classes of symmetric unimodal polynomials. The result has applications to enumerative combinatorics including the proof of a conjecture by R. Stanley.

2006
S. Prasad

1 OKTEM, L., and ASTOLA, J.: 'Hierarchical enumerative coding of locally stationary binary data', Electron. Lett., 1999, 35, (17), pp. 1428-1429 2 COVER, T.M.: 'Enumerative source encoding', IEEE Trans. Inf. Theory, 1973, IT-19, (1), pp. 73-77 3 WELCH, T.A.: 'A technique for high-performance data compression', IEEE Comput., 1984, 17, (6), pp. 8-19 4 MOFFAT, A., NEAL, R., and wiTTEN, I.H.: 'Arit...

2015
Federico Ardila

The Tutte polynomial is a fundamental invariant associated to a graph, matroid, vector arrangement, or hyperplane arrangement, which answers a wide variety of questions about its underlying object. This short survey focuses on some of the most important results on Tutte polynomials of hyperplane arrangements. We show that many enumerative, algebraic, geometric, and topological invariants of a h...

Journal: :Discrete Mathematics 1994
Reid Davis Carl G. Wagner

The. theory of reduced incidence algebras of binomial posets furnishes a unified treatment of several types of generating functions that arise in enumerative combinatorics. Using this theory as a tool, we study ‘reduced covering algebras’ of binomial lattices and show that they are isomorphic to various algebras of q-binomial generating functions for certain modular binomial lattices.

2004
MARK WEBER

Two notions, generic morphisms and parametric representations, useful for the analysis of endofunctors arising in enumerative combinatorics, higher dimensional category theory, and logic, are defined and examined. Applications to the Batanin approach to higher category theory, Joyal species and operads are provided.

2003
A. ZVONKIN Claude Itzykson

Physicists working in two-dimensional quantum gravity invented a new method of map enumeration based on computation of Gaussian integrals over the space of Hermitian matrices. This paper explains the basic facts of the method and provides an accessible introduction to the subject. Keywords-Maps, Imbedded graphs, Enumerative combinatorics, Matrix integrals, Quantum field theory, String theory.

Journal: :Advances in Mathematics 1976

Journal: :Bulletin of the American Mathematical Society 2005

Journal: :Oberwolfach Reports 2019

In mathematical chemistry, a particular attention is given to degree-based graph invariant. The Zagrebpolynomial is one of the degree based polynomials considered in chemical graph theory. A dendrimer isan artificially manufactured or synthesized molecule built up from branched units called monomers. Inthis note, the first, second and third Zagreb poly...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید