Results 151 to 160 of about 11,862 (202)
Chip firing on directed k-ary trees
Ryota Inagaki +2 more
doaj +1 more source
Generating functions for the cd-indices of simplices and cube
Richard Ehrenborg
doaj +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Oberwolfach Reports, 2023
Enumerative Combinatorics focuses on the exact and asymptotic counting of combinatorial objects. It has fruitful connections to several disciplines, including statistical physics, algebraic combinatorics, probability theory, graph theory and computer science.
Mireille Bousquet-Mélou +3 more
openaire +1 more source
Enumerative Combinatorics focuses on the exact and asymptotic counting of combinatorial objects. It has fruitful connections to several disciplines, including statistical physics, algebraic combinatorics, probability theory, graph theory and computer science.
Mireille Bousquet-Mélou +3 more
openaire +1 more source
2018
Enumerative Combinatorics focusses on the exact and asymptotic counting of combinatorial objects. It is strongly connected to the probabilistic analysis of large combinatorial structures and has fruitful connections to several disciplines, including statistical physics, algebraic combinatorics, graph theory and computer science.
openaire +2 more sources
Enumerative Combinatorics focusses on the exact and asymptotic counting of combinatorial objects. It is strongly connected to the probabilistic analysis of large combinatorial structures and has fruitful connections to several disciplines, including statistical physics, algebraic combinatorics, graph theory and computer science.
openaire +2 more sources
Lessons in Enumerative Combinatorics
20211. Basic Combinatorial Structures.- 2. Partitions and Generating Functions.- 3. Planar Trees and the Lagrange Inversion Formula.- 4. Cayley Trees.- 5. The Cayley-Hamilton Theorem.- 6. Exponential Structures and Polynomial Operators.- 7. The Inclusion-Exclusion Principle.- 8. Graphs, Chromatic Polynomials and Acyclic Orientations.- 9.
Ömer Eğecioğlu, Adriano M. Garsia
openaire +1 more source
1997
This book is the first of a two-volume basic introduction to enumerative combinatorics at a level suitable for graduate students and research mathematicians. It concentrates on the theory and application of generating functions, a fundamental tool in enumerative combinatorics.
Richard P. Stanley, Gian-Carlo Rota
openaire +1 more source
This book is the first of a two-volume basic introduction to enumerative combinatorics at a level suitable for graduate students and research mathematicians. It concentrates on the theory and application of generating functions, a fundamental tool in enumerative combinatorics.
Richard P. Stanley, Gian-Carlo Rota
openaire +1 more source
1999
This second volume of a two-volume basic introduction to enumerative combinatorics covers the composition of generating functions, trees, algebraic generating functions, D-finite generating functions, noncommutative generating functions, and symmetric functions.
Richard P. Stanley, Sergey Fomin
openaire +1 more source
This second volume of a two-volume basic introduction to enumerative combinatorics covers the composition of generating functions, trees, algebraic generating functions, D-finite generating functions, noncommutative generating functions, and symmetric functions.
Richard P. Stanley, Sergey Fomin
openaire +1 more source
1986
Richard Stanley's two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike. This thoroughly revised second edition of volume two covers the composition of generating functions, in particular the exponential formula and the Lagrange inversion formula, labelled and unlabelled ...
openaire +1 more source
Richard Stanley's two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike. This thoroughly revised second edition of volume two covers the composition of generating functions, in particular the exponential formula and the Lagrange inversion formula, labelled and unlabelled ...
openaire +1 more source
Enumerative Combinatorics of XX0 Heisenberg Chain
Journal of Mathematical Sciences, 2021In the present paper, the enumeration of a certain class of directed lattice paths is based on the analysis of dynamical correlation functions of the exactly solvable XX0 model. This model is the zero anisotropy limit of one of the basic models of the theory of integrable systems, the XXZ Heisenberg magnet.
openaire +1 more source
Handbook of Enumerative Combinatorics
2015METHODS Algebraic and Geometric Methods in Enumerative Combinatorics Introduction What is a Good Answer? Generating Functions Linear Algebra Methods Posets Polytopes Hyperplane Arrangements Matroids Acknowledgments Analytic Methods Helmut Prodinger Introduction Combinatorial Constructions and Associated Ordinary Generating Functions Combinatorial ...
openaire +1 more source

