Results 171 to 180 of about 35,860 (197)
Some of the next articles are maybe not open access.
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
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
Enumerative Combinatorics and Computer Science
1990This short paper is a summary of a survey talk given on the interplay between enumerative Combinatorics and Computer Science.
openaire +1 more source
Handbook of Enumerative Combinatorics
Presenting the state of the art, the Handbook of Enumerative Combinatorics brings together the work of today s most prominent researchers. The contributors survey the methods of combinatorial enumeration along with the most frequent applications of these
exaly +1 more source
ENUMERATIVE COMBINATORICS AND CODING THEORY
1994The author develops a new method of investigation of combinatorial problems, introducing the value enumerator \(V_ f(T)= \sum_ p T^{f(p)}\in \mathbb{N}[T,T^{-1}]\) \((p\in \{1,-1\}^ n)\) for a certain polynomial \(f\) in \(n\) variables with non-negative integral coefficients. The coefficient of \(T^ v\) is the number of binary points \(p\) such that \(
openaire +3 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 +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