Combinatorial decompositions and homogeneous geometrical processes

1987 ◽  
Vol 9 (1-2) ◽  
pp. 71-81 ◽  
Author(s):  
V. K. Oganian
Keyword(s):  
Combinatorial Decompositions

Integration of combinatorial decompositions in the presence of collinearities

2008 ◽  
Vol 43 (1) ◽  
pp. 3-20
Author(s):  
R. V. Ambartzumian
Keyword(s):  
Combinatorial Decompositions

scholarly journals Tree-representation of set families and applications to combinatorial decompositions

2012 ◽  
Vol 33 (5) ◽  
pp. 688-711 ◽  
Author(s):  
Binh-Minh Bui-Xuan ◽  
Michel Habib ◽  
Michaël Rao
Keyword(s):  
Tree Representation ◽  
Combinatorial Decompositions

scholarly journals Airy Phenomena and Analytic Combinatorics of Connected Graphs

10.37236/1787 ◽  
2004 ◽  
Vol 11 (1) ◽  
Author(s):  
Philippe Flajolet ◽  
Bruno Salvy ◽  
Gilles Schaeffer
Keyword(s):  
Saddle Point ◽  
Saddle Points ◽  
Formal Series ◽  
Probabilistic Methods ◽  
Saddle Point Method ◽  
Airy Functions ◽  
Connected Graphs ◽  
Analytic Combinatorics ◽  
Point Analysis ◽  
Combinatorial Decompositions

Until now, the enumeration of connected graphs has been dealt with by probabilistic methods, by special combinatorial decompositions or by somewhat indirect formal series manipulations. We show here that it is possible to make analytic sense of the divergent series that expresses the generating function of connected graphs. As a consequence, it becomes possible to derive analytically known enumeration results using only first principles of combinatorial analysis and straight asymptotic analysis—specifically, the saddle-point method. In this perspective, the enumeration of connected graphs by excess (of number of edges over number of vertices) derives from a simple saddle-point analysis. Furthermore, a refined analysis based on coalescent saddle points yields complete asymptotic expansions for the number of graphs of fixed excess, through an explicit connection with Airy functions.

Combinatorial decompositions for monomial ideals

2021 ◽  
Vol 104 ◽  
pp. 630-652
Author(s):  
Michela Ceria
Keyword(s):  
Monomial Ideals ◽  
Combinatorial Decompositions

scholarly journals On discrete Morse functions and combinatorial decompositions

2000 ◽  
Vol 217 (1-3) ◽  
pp. 101-113 ◽  
Author(s):  
Manoj K. Chari
Keyword(s):  
Morse Functions ◽  
Combinatorial Decompositions

scholarly journals Combinatorial decompositions of a class of rings

1981 ◽  
Vol 39 (2) ◽  
pp. 155-184 ◽  
Author(s):  
Kenneth Baclawski ◽  
Adriano M Garsia
Keyword(s):  
Combinatorial Decompositions

scholarly journals Combinatorial Decompositions, Kirillov–Reshetikhin Invariants, and the Volume Conjecture for Hyperbolic Polyhedra

2016 ◽  
Vol 27 (2) ◽  
pp. 193-207
Author(s):  
Alexander Kolpakov ◽  
Jun Murakami
Keyword(s):  
Volume Conjecture ◽  
Hyperbolic Polyhedra ◽  
Combinatorial Decompositions

Computing combinatorial decompositions of rings

COMBINATORICA ◽  
1991 ◽  
Vol 11 (3) ◽  
pp. 275-293 ◽  
Author(s):  
Bernd Sturmfels ◽  
Neil White
Keyword(s):  
Combinatorial Decompositions

scholarly journals Combinatorial decompositions of rings and almost Cohen-Macaulay complexes

1983 ◽  
Vol 83 (1) ◽  
pp. 6-19
Author(s):  
Kenneth Baclawski
Keyword(s):  
Combinatorial Decompositions
Sign in / Sign up

Export Citation Format

Share Document