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)

• The \(q\)-tangent and \(q\)-secant numbers via basic Eulerian polynomials
• Sofic dimension for discrete measured groupoids.
• \(p,q\)-Stirling numbers and set partition statistics
• Polya, Inverse Polya, and Circular Polya Distributions of Orderkforl-Overlapping Success Runs
• A technique for computing the PDFs and CDFs of nonnegative infinitely divisible random variables
• The largest connected component in a random mapping
• Restricted permutations
• Generic properties of combinatory maps: Neutral networks of RNA secondary structures
• On the Frobenius problem
• The problem of coincidences
• Combinatorial properties of binary semigroups
• \(q\)-analogs of the inclusion-exclusion principle and permutations with restricted position
• Eigenvalue distributions of random permutation matrices.
• Riordan arrays associated with Laurent series and generalized Sheffer-type groups
• Theory and Application of Plane Partitions: Part 1
• Algorithmic uses of the Feferman-Vaught theorem
• An algorithm for generating necklaces of beads in two colors
• On Appell sequences of polynomials of Bernoulli and Euler type
• Ehrhart series of lecture hall polytopes and Eulerian polynomials for inversion sequences
• On the differences of the generalized factorials at an arbitrary point and their combinatorial applications
• Eigenfunctions of Laguerre-type operators and generalized evolution problems
• Probabilistic proofs of asymptotic formulas for some classical polynomials
• Extended set partitions with successions
• Block-connected set partitions
• The relative contributions of private information sharing and public information releases to information aggregation
• Degenerate weighted Stirling numbers
• Binomial posets, Möbius inversion, and permutation enumeration
• Permutation statistics and partitions
• Hermite polynomials and a duality relation for matchings polynomials
• Some more properties of Catalan numbers
• Generating functions and generalized alternating subsets
• Lexicographic compositions and de Bruijn sequences
• A note about the Catalan triangle
• Integral Representation and Algorithms for Closed Form Summation
• Generalized binomial coefficients and the subset-subspace problem
• Eulerian polynomials and B-splines
• Invariant differential operators associated with a conformal metric
• Une généralisation trivariee symétrique des nombres euleriens
• The blossoming of Schröder's fourth problem
• Variations sur le thème \({E+\overline {E} = XY}\) (Variations on the theme \({E+\overline {E} = XY})\)
• Exceedingly deranging!
• Some applications of the \(q\)-exponential formula
• Periodically varying compensation of time-invariant systems
• Two chain rules for divided differences and Faà di Bruno’s formula
• A POLYNOMIAL ANALOGUE TO THE STERN SEQUENCE
• Occupancy with two types of balls
• Proof of the Monotone Column Permanent Conjecture
• Enumeration of pairs of permutations
• Non-central Stirling numbers and some applications
• Q-counting rook configurations and a formula of Frobenius
• Combinatorial aspects of continued fractions. (Reprint)
• The Vertical Recursive Relation of Riordan Arrays and Their Matrix Representation
• Essential obstacles to Helly circular-arc graphs
• A SURVEY OF FACTORIZATION COUNTING FUNCTIONS
• How many ways can a permutation be factored into two n-cycles?
• An asymptotic evaluation of the cycle index of a symmetric group
• The affine group. I: Bruhat decomposition
• Practical formulae for the calculus of multivariable Adomian polynomials
• Decomposition and group theoretic characterization of pairs of inverse relations of the Riordan type
• A weapon-target assignment approach to media allocation
• Simplified analytical expressions for numerical differentiation via cycle index
• The cycle-path indicator polynomial of a digraph
• Universal Formulae for SU$(n)$ Casson Invariants of Knots
• Bell polynomials and degenerate Stirling numbers
• Bell polynomials and generalized Laplace transforms
• Restricted growth functions, rank row matchings of partition lattices, and q-Stirling numbers
• Rook theory. III: Rook polynomials and the chromatic structure of graphs
• Farrell polynomials on graphs of bounded tree width
• On an identity from classical invariant theroy
• Necklaces, symmetries and self-reciprocal polynomials
• Antibandwidth of three-dimensional meshes
• Combinatorial reciprocity theorems
• The signed Eulerian numbers
• On the complexity of calculation of differentials and gradients
• Weak runs in sequences of binary trials
• Ordered Cycle Lengths in a Random Permutation
• Principle of inclusion-exclusion on semilattices
• Exponential polynomials, Stirling numbers, and evaluation of some gamma integrals
• Trees with structures
• On the exact distributions of Eulerian and Simon Newcomb numbers associated with random permutations
• On the combinatorics of partition functions in $\mathrm{AdS}_3 / \mathrm{LCFT}_{2} $
• Probability measures, Appell polynomials and polynomial approximation
• Bell polynomials and differential equations of Freud-type polynomials
• Eulerian numbers, Newcomb's problem and representations of symmetric groups
• Maximum permanents of matrices of zeros and ones
• Série de Hausdorff d'une algèbre de Lie et projections canoniques dans l'algèbre enveloppante. (Hausdorff series of a Lie algebra and canonical projections in the enveloping algebra)
• Une approche combinatoire des fonctions elliptiques de Jacobi
• Asymptotics of the number of repetition-free Boolean functions in the elementary basis
• Sparsity in time-frequency representations
• Restricted growth functions and incidence relations of the lattice of partitions of an n-set
• Approximate probabilities for runs and patterns in i.i.d. and Markov-dependent multistate trials
• Une interpretation combinatoire des coefficients des développements en série entière des fonctions elliptiques de Jacobi
• The Holens-Đoković conjecture on permanents fails!
• Generalized Bessel numbers and some combinatorial settings
• 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

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)