Characteristic points of recursive systems.
Clique-width and the speed of hereditary properties.
Coefficients of functional compositions often grow smoothly.
Combinatoire du billard dans un polyèdre
Ces notes ont pour but de rassembler les différents résultats de combinatoire des mots relatifs au billard polygonal et polyédral. On commence par rappeler quelques notions de combinatoire, puis on définit le billard, les notions utiles en dynamique et le codage de l’application. On énonce alors les résultats connus en dimension deux puis trois.
Combinatorial problems related to geometrically distributed random variables.
Compositions of n as alternating sequences of weakly increasing and strictly decreasing partitions
Compositions and partitions of positive integers are often studied in separate frameworks where partitions are given by q-series generating functions and compositions exhibiting specific patterns are designated by generating functions for these patterns. Here, we view compositions as alternating sequences of weakly increasing and strictly decreasing partitions (i.e. alternating blocks). We obtain generating functions for the number of such partitions in terms of the size of the composition, the...
Compositions of random functions on a finite set.
Compositions with distinct parts.
Computing tournament sequence numbers efficiently with matrix techniques.
Counting abelian squares.
Counting -polytopes with vertices.
Counting defective parking functions.
Counting graphs with different numbers of spanning trees through the counting of prime partitions
Let be the set of all integers such that there exists a connected graph on vertices with precisely spanning trees. It was shown by Sedláček that...
Counting rooted trees: the universal law .
Counting set systems by weight.