Derangements and Euler's difference table for .
Derivative polynomials, Euler polynomials, and associated integer sequences.
Derivatives of Catalan related sums.
Derivatives of hypergraphs
Derived graphs of some graphs
Des algorithmes linéaires pour les problèmes de partition, de recouvrement et de couplage dans les hypergraphes d'intervalles
Des permutations
Descendants and ascendants in binary trees.
Descendants in heap ordered trees or a triumph of computer algebra.
Descendants in increasing trees.
Descents in noncrossing trees.
Descents of derangements and circular words. (Descentes des dérangements et mots circulaires.)
Description combinatoire des ultramétriques
Descriptions of state spaces of orthomodular lattices (the hypergraph approach)
Using the general hypergraph technique developed in [7], we first give a much simpler proof of Shultz's theorem [10]: Each compact convex set is affinely homeomorphic to the state space of an orthomodular lattice. We also present partial solutions to open questions formulated in [10] - we show that not every compact convex set has to be a state space of a unital orthomodular lattice and that for unital orthomodular lattices the state space characterization can be obtained in the context of unital...
Designs, groups and lattices
The notion of designs in Grassmannian spaces was introduced by the author and R. Coulangeon, G. Nebe, in [3]. After having recalled some basic properties of these objects and the connections with the theory of lattices, we prove that the sequence of Barnes-Wall lattices hold -Grassmannian designs. We also discuss the connections between the notion of Grassmannian design and the notion of design associated with the symmetric space of the totally isotropic subspaces in a binary quadratic space, which...
Dessins d'enfants: bipartite maps and Galois groups.
Destroying symmetry by orienting edges: complete graphs and complete bigraphs
Our purpose is to introduce the concept of determining the smallest number of edges of a graph which can be oriented so that the resulting mixed graph has the trivial automorphism group. We find that this number for complete graphs is related to the number of identity oriented trees. For complete bipartite graphs , s ≤ t, this number does not always exist. We determine for s ≤ 4 the values of t for which this number does exist.
Determinant expressions for -harmonic congruences and degenerate Bernoulli numbers.
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.