Results 191 to 200 of about 159,390 (237)
k-Non-crossing trees and edge statistics modulo k
Enumerative Combinatorics and ApplicationsHelmut Prodinger
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.
Ö. Eğecioğlu, A. Garsia
semanticscholar +3 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 ...
Richard P. Stanley
semanticscholar +3 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 ...
Richard P. Stanley
semanticscholar +3 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 ...
M. Bóna
semanticscholar +3 more sources
ACM SIGACT News, 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.
C. Charalambides
semanticscholar +3 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.
C. Charalambides
semanticscholar +3 more sources
Enumerative Combinatorics: Index
, 1999This 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.
R. Stanley, S. Fomin
semanticscholar +3 more sources
The Building Game: From Enumerative Combinatorics to Conformational Diffusion
Journal of Nonlinear Science, 2016We study a discrete attachment model for the self-assembly of polyhedra called the building game. We investigate two distinct aspects of the model: (i) enumerative combinatorics of the intermediate states and (ii) a notion of Brownian motion for the polyhedral linkage defined by each intermediate that we term conformational diffusion. The combinatorial
Daniel Johnson-Chyzhykov, Govind Menon
semanticscholar +4 more sources