scientific article; zbMATH DE number 3127542
graph enumerationStirling numberspermutations with restricted positionspermutationsordered partitionsoccupancy problemsmoment generating functionsmethod of inclusion and exclusionlinear recurrencesBell polynomialsgenerating functionsenumeration theory of Pólyaenumeration of permutationselementary theory of partitionsdistributionderivatives of composite functionscombinatoricscombinations
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Enumerative combinatorics (05Axx) Trees (05C05) Graph theory (05C99)
- Some topological properties of star graphs: The surface area and volume
- Riordan matrices in the reciprocation of quadratic polynomials
- From a zoo to a zoology: Towards a general theory of graph polynomials
- Partitions of Z_n into arithmetic progressions
- On arithmetic partitions of \(\mathbb Z_n\)
- An explicit formula for generalized potential polynomials and its applications
- Exponential polynomials, Stirling numbers, and evaluation of some gamma integrals
- Simple upper bounds for partition functions
- Sums of products of Cauchy numbers
- Enumeration of compositions with prescribed parts
- Poisson randomization in occupancy problems
- On the Stirling numbers of the first kind arising from probabilistic and statistical problems
- On Touchard polynomials
- Distributions, continued fractions, and the Ehrenfest urn model
- The number of subsets without a fixed circular distance
- Combinatorial sums \(\sum _{j}\binom{n}{mj+q}\) associated with Chebyshev polynomials
- Q-counting rook configurations and a formula of Frobenius
- Vers une notion de dérivation fonctionnelle causale. (Towards a notion of causal functional derivatives)
- An algorithm for generating necklaces of beads in two colors
- Degenerate weighted Stirling numbers
- The number of trees with a 1-factor
- Analysis of space allocation in a generally fragmented linear store
- Enumeration of labelled threshold graphs and a theorem of Frobenius involving Eulerian polynomials
- Spectra of unicyclic graphs
- On some counting polynomials in chemistry
- On the problème des ménages
- The conjugacy character of \(S_ n\) tends to be regular
- Maximum permanents of matrices of zeros and ones
- Automorphism groups of the algebra of finite-valued functions preserving a partition of the set \(E_ k\)
- Generalized Eulerian numbers and the topology of the Hessenberg variety of a matrix
- Asymptotic of the coefficients of factorized Eulerian polynomials
- Counting special permutations
- Occupancy with two types of balls
- Combinatorial proofs of symmetry formulas for the generalized hypergeometric series
- Log-concavity of Stirling numbers and unimodality of Stirling distributions
- On sums of powers of zeros of polynomials
- Bell polynomials and degenerate Stirling numbers
- Integration over a simplex, truncated cubes, and Eulerian numbers
- Stirling pairs
- A process of runs and its convergence to the Brownian motion
- How many ways can a permutation be factored into two n-cycles?
- Permutation statistics and partitions
- The problem of coincidences
- Loss of selectively neutral alleles in small populations and regular mating systems
- The combinatorial interpretation of the Jacobi identity from Lie algebras
- The level polynomials of the free distributive lattices
- Une interpretation combinatoire des coefficients des développements en série entière des fonctions elliptiques de Jacobi
- On the measurement of complexity in activity networks
- Eulerian numbers, Newcomb's problem and representations of symmetric groups
- An asymptotic equivalent for the number of total preorders on a finite set
- Combinatorial aspects of continued fractions
- A vector space analog of permutations with restricted position
- Abstract Cauchy problems that involve a product of two Euler-Poisson- Darboux operators
- Une généralisation trivariee symétrique des nombres euleriens
- Bipartitional polynomials and their applications in combinatorics and statistics
- Rhyming schemes: crossings and coverings
- Moments and Fourier transforms of B-splines
- Polynomial sequences of integral type
- Chromatic polynomials for regular graphs and modified wheels
- Sulla complessita di alcuni problemi di conteggio
- On the number of Latin rectangles and chromatic polynomial of L(K//(r,s))
- Complement reducible graphs
- Counting permutations by successions and other figures
- Consecutive retrieval with redundancy: An optimal linear and an optimal cyclic arrangement and their storage space requirements
- Complementary matching vectors and the uniform matching extension property
- On the permanents of complements of the direct sum of identity matrices
- On the number of combinations without unit separation
- On permutations with limited repetition
- Quotient polytopes of cyclic polytopes. I: Structure and characterization
- On bivariate generalized binomial and negative binomial distributions
- Finite rings in which the multiplication of any two zero-divisors is zero
- The number of increasing subsequences of the random permutation
- Tree counting polynomials for labelled graphs. I: Properties
- On the problème des ménages
- A theorem relating potential and Bell polynomials
- A behavioral summary for completely random nets
- Restricted growth functions, rank row matchings of partition lattices, and q-Stirling numbers
- Une approche combinatoire des fonctions elliptiques de Jacobi
- Calculation of complex Fourier coefficients using natural splines
- Periodically varying compensation of time-invariant systems
- Hermite polynomials and a duality relation for matchings polynomials
- On numbers related to partitions of unlike objects and occupancy problems
- Commutative Moufang loops and Bessel functions
- The partition polynomial of a finite set system
- Spectral properties of the biconfluent Heun differential equation
- The signed Eulerian numbers
- Some more properties of Catalan numbers
- \(q\)-analogs of the inclusion-exclusion principle and permutations with restricted position
- Stirling networks: A versatile combinatorial topology for multiprocessor systems
- Random sets which invariably generate the symmetric group
- On the Eulerian numbers \(\displaystyle{ M_ n = \max{}_{1{\leq{}}k{\leq{}}n}A(n,k)}\)
- Classification of two-person ordinal bimatrix games
- Moment relationships for queues with Poisson input
- Probability measures, Appell polynomials and polynomial approximation
- Some remarks on Stolt's theorems for Pellian equations
- The enumeration of homeomorphically irreducible labelled graphs
- A simple solution of Simon Newcomb's problem
- Enumeration of sequences by levels and rises
- Generating functions and generalized alternating subsets
- On enumerating paths of K arcs in unoriented complete graphs
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)