scientific article; zbMATH DE number 3127542
permutationsdistributioncombinatoricsgenerating functionslinear recurrencesStirling numbersBell polynomialscombinationsordered partitionsgraph enumerationmoment generating functionsoccupancy problemsenumeration of permutationsderivatives of composite functionselementary theory of partitionsenumeration theory of Pólyamethod of inclusion and exclusionpermutations with restricted positions
Permutations, words, matrices (05A05) Trees (05C05) Exact enumeration problems, generating functions (05A15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Combinatorial aspects of partitions of integers (05A17) Graph theory (05C99) Enumerative combinatorics (05Axx)
- Pascal triangles, Catalan numbers and renewal arrays
- Derivations, derivatives and chain rules
- Sums of products of Cauchy numbers
- Minimax trees and André polynomials
- Structure of the \(n\)th roots of a matrix
- Analytic Combinatorics
- Invariants of finite groups and their applications to combinatorics
- On the Stirling numbers of the first kind arising from probabilistic and statistical problems
- On some problems of a statistical group-theory. I
- Stable multivariate Eulerian polynomials and generalized Stirling permutations
- Rook numbers and the normal ordering problem
- Theory and Application of Plane Partitions. Part 2
- Enumeration of difference graphs
- Some canonical sequences of integers
- On the distribution of the number of occurrences of an order-preserving pattern of length three in a random permutation
- Exact expressions for the moments of ladder heights
- Connection coefficients between orthogonal polynomials and the canonical sequence: An approach based on symbolic computation
- Combinatorial aspects of continued fractions
- An introduction to operational techniques and special polynomials
- Some topological properties of star graphs: The surface area and volume
- On immanants of Jacobi-Trudi matrices and permutations with restricted position
- Numerical computation of first-passage times of increasing Lévy processes
- Bivariate generating functions for a class of linear recurrences: general structure
- An interpretation for Garsia and Remmel's \(q\)-hit numbers
- Population processes sampled at random times
- Asymptotic normality and combinatorial aspects of the prefix exchange distance distribution
- Major Index and Inversion Number of Permutations
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- Fast algorithms for genegrating integer partitions
- On sums of powers of zeros of polynomials
- The Number of Solutions to Linear Diophantine Equations and Multivariate Splines
- The probability of Condorcet cycles and super majority rules
- Asymptotic estimates of integral functions defined by canonical products
- Supersolvable lattices
- Context-free grammars, differential operators and formal power series
- Success run statistics defined on an urn model
- Moments and Fourier transforms of B-splines
- Matching behaviour is asymptotically normal
- Expansions of generalized Euler's constants into the series of polynomials in \(\pi^{- 2}\) and into the formal enveloping series with rational coefficients only
- Some identities involving Appell polynomials
- Random sets which invariably generate the symmetric group
- From a zoo to a zoology: Towards a general theory of graph polynomials
- On some counting polynomials in chemistry
- Riordan matrices in the reciprocation of quadratic polynomials
- Appell polynomial sequences with respect to some differential operators
- A discrete view of Faà di Bruno
- On the classification and enumeration of self-dual codes
- Spectra of unicyclic graphs
- A decomposition of the group algebra of a finite Coxeter group
- Stirling polynomials
- Recursive matrices and umbral calculus
- Permutations with prescribed pattern
- Counting rooted maps by genus. I
- Ruin probabilities in the compound binomial model
- Distribution of nodes of a tree by degree
- Strict circular consecutivekout ofnsystems
- Eulerian polynomials: from Euler's time to the present
- Random sampling of sparse trigonometric polynomials
- A series expansion involving the harmonic numbers
- A note on concavity properties of triangular arrays of numbers
- Lifetime distribution and estimation problems of consecutive \(k\)-out-of-\(n\):F systems
- On the theory of the matching polynomial
- Cyclic \(q\)-MZSV sum
- scientific article; zbMATH DE number 5823945 (Why is no real title available?)
- A strong uniform time for random transpositions
- The Lindsay transform of natural exponential families
- Bisection width of transposition graphs
- On the resolution of ideals of fat points
- An identity involving Stirling numbers
- New permutation coding and equidistribution of set-valued statistics
- Cyclic compositions and cycles of the hypercube
- On the number of Latin rectangles and chromatic polynomial of L(K//(r,s))
- On the measurement of complexity in activity networks
- The Coefficients in an Asymptotic Expansion
- The characteristic polynomial and the matchings polynomial of a weighted oriented graph
- Graph lattice: random walk and combinatorial identities
- Generalized Eulerian numbers and the topology of the Hessenberg variety of a matrix
- Counting Latin rectangles
- Derangements on the \(n\)-cube
- Whitney numbers of the second kind for the star poset
- On computing the number of Latin rectangles
- Two series expansions for the logarithm of the gamma function involving Stirling numbers and containing only rational coefficients for certain arguments related to \(\pi^{-1}\)
- Complement reducible graphs
- Closed expressions for averages of set partition statistics
- On some problems of a statistical group-theory. IV
- The \(r\)-Stirling numbers
- An inversion relation of multinomial type
- A unified approach to polynomial sequences with only real zeros
- Estimating true-score distrubutions in psychological testing (an empirical Bayes estimation problem)
- Generalized Stirling permutations and forests: higher-order Eulerian and Ward numbers
- A COM-Poisson-type generalization of the negative binomial distribution
- Chapter 3 of Ramanujan's second notebook
- Combinatorics of Boolean automata circuits dynamics
- Almost all graphs with 1.44n edges are 3-colorable
- Symbolic solutions of some linear recurrences
- Unseparated pairs and fixed points in random permutations
- 2-adic properties for the numbers of involutions in the alternating groups
- A vector space analog of permutations with restricted position
- An extension of the Bell polynomials
- Asymptotic properties of eulerian numbers
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3243274)