scientific article

zbMath0422.05003MaRDI QIDQ3855186

Richard P. Stanley

Publication date: 1978

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

permutationsgenerating functionsStirling numbersBell numbersCatalan numbers

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (30)

New properties of a composition of ordinary generating functions for primes ⋮ A calculus for the random generation of labelled combinatorial structures ⋮ On the language of primitive words ⋮ Decomposable functors and the exponential principle ⋮ The growth rate and balance of homogeneous tilings in the hyperbolic plane ⋮ Equations in finite semigroups: Explicit enumeration and asymptotics of solution numbers ⋮ On the algebraicity of Puiseux series ⋮ Some applications of the \(q\)-exponential formula ⋮ Geometria combinatoria e geometrie finite ⋮ Chain enumeration and non-crossing partitions ⋮ Differentiably finite power series ⋮ Symmetric functions and P-recursiveness ⋮ A \(q\)-analog of the exponential formula ⋮ Une théorie combinatoire des séries formelles ⋮ Enumeration of skew Ferrers diagrams ⋮ Automatic average-case analysis of algorithms ⋮ Total positivity of Hadamard products ⋮ Enumeration of skew Ferrers diagrams and basic Bessel functions ⋮ Legendre-Stirling permutations ⋮ A \(q\)-analog of the exponential formula. (Reprint) ⋮ Bayesian analysis for reversible Markov chains ⋮ Appendix to Orloff. Critical values of certain tensor product L- functions ⋮ Gaussian limiting distributions for the number of components in combinatorial structures ⋮ Analytic analysis of algorithms ⋮ On dimer coverings of rectangles of fixed width ⋮ Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems. ⋮ Categorical convolutional formulas ⋮ Analytic combinatorics of non-crossing configurations ⋮ On binary tree encodements ⋮ Enumerating representations in finite wreath products. II: Explicit formulae

This page was built for publication: