Results 201 to 210 of about 86,054 (247)
Enumerative and bijective combinatorics of different families of Dyck paths with air pockets
Rémi Maréchal
openalex +1 more source
Results on pattern avoidance in parking functions
Enumerative Combinatorics and ApplicationsJun Yan
doaj +1 more source
Pattern-restricted one-cycle permutations with a pattern-restricted cycle form
Enumerative Combinatorics and ApplicationsKassie Archer +4 more
doaj +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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 +2 more sources
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 +2 more sources
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 +2 more sources
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 +2 more sources
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 +2 more sources
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 +2 more sources
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 +2 more sources
Enumerative combinatorics and algebraic languages
2006We give a survey of recent works relating algebraic languages with the combinatorics of "planar pictures" (i.e. planar maps, animals, polyominoes, secondary structures,…). Such objects are encoded with words. Applications are in enumeration theory, in connection with statistical Physics, molecular Biology, algorithmic complexity and computer graphics ...
openaire +2 more sources