Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums.
Asymptotic enumeration of labelled graphs by genus.
Asymptotics for incidence matrix classes.
Asymptotics for Lacunary sums of binomial coefficients and a card problem with ranks.
Asymptotics for random walks in alcoves of affine Weyl groups.
Asymptotics for the probability of connectedness and the distribution of number of components.
Asymptotics of coefficients of multivariate generating functions: Improvements for smooth points.
Asymptotics of counts of small components in random structures and models of coagulation-fragmentation
We establish necessary and sufficient conditions for the convergence (in the sense of finite dimensional distributions) of multiplicative measures on the set of partitions. The multiplicative measures depict distributions of component spectra of random structures and also the equilibria of classic models of statistical mechanics and stochastic processes of coagulation-fragmentation. We show that the convergence of multiplicative measures is equivalent to the asymptotic independence of counts of...
Asymptotics of generating the symmetric and alternating groups.
Asymptotics of permutations with nearly periodic patterns of rises and falls.
Asymptotics of some convolutional recurrences.
Asymptotics of the average height of 2-watermelons with a wall.
Asymptotics of the number of -words with an -descent.
Automatic enumeration of regular objects.
Billiard complexity in the hypercube
We consider the billiard map in the hypercube of . We obtain a language by coding the billiard map by the faces of the hypercube. We investigate the complexity function of this language. We prove that is the order of magnitude of the complexity.
Binary strings without zigzags.
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.