Results 191 to 200 of about 11,854 (238)
Enumerative and bijective combinatorics of different families of Dyck paths with air pockets
Rémi Maréchal
openalex +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
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
What Is Enumerative Combinatorics?
1986The basic problem of enumerative combinatorics is that of counting the number of elements of a finite set. Usually are given an infinite class of finite sets S i where i ranges over some index set I (such as the nonnegative integers ℕ), and we wish to count the number ƒ(i) of elements of each S i “simultaneously.” Immediate philosophical difficulties ...
openaire +1 more source
Enumerative combinatorics on words
2015Combinatorics on words is a field which has both historical roots and a substantial growth. Its roots are to be found in the early results of Axel Thue on square free words and the development of combinatorial group theory. The present interest in the field is pushed by its links with several connexions with other topics external to pure mathematics ...
Perrin, Dominique, Restivo, Antonio
openaire +1 more source