Delannoy and tetrahedral numbers
We establish an identity between Delannoy numbers and tetrahedral numbers of arbitrary dimension.
Dénombrements de chemins dans soumis à contraintes
Derangement polynomials and excedances of type .
Derangements and Euler's difference table for .
Derivative polynomials, Euler polynomials, and associated integer sequences.
Descendants and ascendants in binary trees.
Descendants in heap ordered trees or a triumph of computer algebra.
Descents in noncrossing trees.
Determinant formulae for some tiling problems and application to fully packed loops
We present a number of determinant formulae for the number of tilings of various domains in relation with Alternating Sign Matrix and Fully Packed Loop enumeration.
Determinant identities and a generalization of the number of totally symmetric self-complementary plane partitions.
Determinantal generating functions of colored spanning forests.
Deux propriétés combinatoires des nombres de Schröder
Deux propriétés combinatoires du langage de Lukasiewicz
Diagonal sums of boxed plane partitions.
Diagonalization and rationalization of algebraic Laurent series
We prove a quantitative version of a result of Furstenberg [20] and Deligne [14] stating that the diagonal of a multivariate algebraic power series with coefficients in a field of positive characteristic is algebraic. As a consequence, we obtain that for every prime the reduction modulo of the diagonal of a multivariate algebraic power series with integer coefficients is an algebraic power series of degree at most and height at most , where is an effective constant that only depends on...
Die Anzahl der primitiven Polytope im ... mit 2 d - 2 Facetten.
Die Kombinationen gegebenen Profils. III
Differential equations associated with generalized Bell polynomials and their zeros
In this paper, we study differential equations arising from the generating functions of the generalized Bell polynomials.We give explicit identities for the generalized Bell polynomials. Finally, we investigate the zeros of the generalized Bell polynomials by using numerical simulations.
Direct and elementary approach to enumerate topologies on a finite set.
Discovering hook length formulas by an expansion technique.