scientific article; zbMATH DE number 3127542

zbMATH Open0078.00805MaRDI QIDQ3243274FDOQ3243274

Authors: John Riordan 

Publication date: 1958

Title of this publication is not available (Why is that?)

zbMATH Keywords

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

Mathematics Subject Classification ID

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)

Cited In (only showing first 100 items - show all)

• On the anti-exceedance distribution on the symmetric group and its subgroups
• Alternating subsets modulo \(m\)
• Rook Theory-IV. Orthogonal Sequences of Rook Polynomials
• Combinatorial proofs of some limit formulas involving orthogonal polynomials
• Sparse dual transportation polyhedra: Extreme points and signatures
• A note on the Hermite interpolation
• On Calculations Involving the Maximum Cell Frequency
• Une \(C^\infty\)-application non-immersive qui possède la propriété universelle des immersions
• Permutations by Number of Rises and Successions
• Combinatorial proofs of symmetry formulas for the generalized hypergeometric series
• Categorical aspects of generating functions. I: Exponential formulas and Krull-Schmidt categories
• Modèles combinatoires pour les polynômes de Meixner
• Глобализация анализа моделей размещения частиц по ячейкам
• More on the generalized Macaulay theorem
• Perfect matchings of a graph associated with a binary de Bruijn digraph
• Multibasic Eulerian Polynomials
• Signed words and permutations. IV: Fixed and pixed points
• Title not available (Why is that?)
• Permutations by number of fixed points and anti-excedances
• Enumerating some stable partitions involving Stirling and \(r\)-Stirling numbers of the second kind
• Minimum variance unbiased estimation for the zero class truncated bivariate Poisson and logarithmic series distributions
• Eulerian polynomials and polynomial congruences
• A new bijection relating \(q\)-Eulerian polynomials
• On probability distributions of single-linkage dendrograms
• Idempotents and product representations with applications to the semigroup of binary relations
• Coding and counting spanning trees in Kleitman-Golden graphs
• Balanced minimum covers of a finite set
• The number of plane trees
• Log-concavity of Stirling numbers and unimodality of Stirling distributions
• On a restricted occupancy model and its applications
• Rook placements and cellular decomposition of partition varieties
• Rook placements and generalized partition varieties
• Permutations and sequences
• Distribution of polynomial coefficients, congruent modulo \(p^ N\)
• Bit strings without q-separation
• Binomial functions and combinatorial mathematics
• Zero-one matrices without consecutive ones
• Enumeration of Compositions by Rises, Falls and Levels
• Complementary matching vectors and the uniform matching extension property
• Some asymptotic bijections
• Enumeration of constant-weight run-length limited binary sequences
• Tree counting polynomials for labelled graphs. I: Properties
• A note on permutations with fixed pattern
• The number of functional digraphs
• Note on Finite Topological Spaces
• Title not available (Why is that?)
• Transportation problems which can be solved by the use of hirsch-paths for the dual problems
• Loss of selectively neutral alleles in small populations and regular mating systems
• Rhyming schemes: crossings and coverings
• A set of polynomials associated with the higher derivatives of \(y=x^ x\)
• On a class of bivariate compounded Poisson distributions
• Moments of discrete orthogonal polynomial ensembles
• An asymptotic equivalent for the number of total preorders on a finite set
• Rook theory, compositions, and zeta functions
• Asymptotic estimates for the higher moments of the expected behavior of straight insertion sort
• The algebra of set functions. II: An enumerative analogue of Hall's theorem for bipartite graphs
• Eulerian numbers with fractional order parameters
• Asymptotic of the coefficients of factorized Eulerian polynomials
• Periodic Pólya urns, the density method and asymptotics of Young tableaux
• Level premium rates as a function of initial capital
• Poisson randomization in occupancy problems
• Equitable solvent controls in a multi-period game model of risk
• A behavioral summary for completely random nets
• On the number of combinations without unit separation
• Bell polynomials and modified Bessel functions of half-integral order
• Formulas for sums of powers of integers by functional equations
• The quasi-multiplication on rings and algebras
• Title not available (Why is that?)
• Chromatic polynomials for regular graphs and modified wheels
• On Rota's problem concerning partitions
• Derivations, derivatives and chain rules
• The Number of Solutions to Linear Diophantine Equations and Multivariate Splines
• Distribution of nodes of a tree by degree
• Major Index and Inversion Number of Permutations
• A decomposition of the group algebra of a finite Coxeter group
• Combinatorics of Boolean automata circuits dynamics
• On the foundations of combinatorial theory I. Theory of M�bius Functions
• Success run statistics defined on an urn model
• The Coefficients in an Asymptotic Expansion
• Bivariate generating functions for a class of linear recurrences: general structure
• Cyclic \(q\)-MZSV sum
• On the resolution of ideals of fat points
• Asymptotic normality and combinatorial aspects of the prefix exchange distance distribution
• Strict circular consecutivekout ofnsystems
• On the measurement of complexity in activity networks
• Complement reducible graphs
• Estimating true-score distrubutions in psychological testing (an empirical Bayes estimation problem)
• Population processes sampled at random times
• Stirling polynomials
• Closed expressions for averages of set partition statistics
• Analytic Combinatorics
• Stable multivariate Eulerian polynomials and generalized Stirling permutations
• The probability of Condorcet cycles and super majority rules
• A strong uniform time for random transpositions
• Generalized Eulerian numbers and the topology of the Hessenberg variety of a matrix
• 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}\)
• The \(r\)-Stirling numbers
• Minimax trees and André polynomials
• Random sets which invariably generate the symmetric group

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)