Results 161 to 170 of about 45,358 (192)
Complexity Problems in Enumerative Combinatorics [PDF]
We give a broad survey of recent results in Enumerative Combinatorics and their complexity aspects.
Igor Pak
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
exaly +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 ...
Richard P Stanley
exaly +2 more sources
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
exaly +2 more sources
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
exaly +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.
Sergey Fomin, Richard P Stanley
exaly +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.
Sergey Fomin, Richard P Stanley
exaly +2 more sources
Notes on Counting: An Introduction to Enumerative Combinatorics
Enumerative combinatorics, in its algebraic and analytic forms, is vital to many areas of mathematics, from model theory to statistical mechanics. This book, which stems from many years' experience of teaching, invites students into the subject and ...
Peter Cameron
exaly +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.
Richard P Stanley
exaly +1 more source
Enumerative Combinatorics and Computer Science
Lecture Notes in Computer Science, 1990This short paper is a summary of a survey talk given on the interplay between enumerative Combinatorics and Computer Science.
exaly +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 ...
exaly +2 more sources

