On the asymptotic enumeration of Cayley graphs

In this paper, we are interested in the asymptotic enumeration of Cayley graphs. It has previously been shown that almost every Cayley digraph has the smallest possible automorphism group: that is, it is a digraphical regular representation (DRR). In this paper, we approach the corresponding question for undirected Cayley graphs. The situation is complicated by the fact that there are two infinite families of groups that do not admit any graphical regular representation (GRR). The strategy for digraphs involved analysing separately the cases where the regular group R has a nontrivial proper normal subgroup N with the property that the automorphism group of the digraph fixes each N-coset setwise, and the cases where it does not. In this paper, we deal with undirected graphs in the case where the regular group has such a nontrivial proper normal subgroup.

Bounded affine permutations I. Pattern avoidance and enumeration

We introduce a new boundedness condition for affine permutations, motivated by the fruitful concept of periodic boundary conditions in statistical physics. We study pattern avoidance in bounded affine permutations. In particular, we show that if $\tau$ is one of the finite increasing oscillations, then every $\tau$-avoiding affine permutation satisfies the boundedness condition. We also explore the enumeration of pattern-avoiding affine permutations that can be decomposed into blocks, using analytic methods to relate their exact and asymptotic enumeration to that of the underlying ordinary permutations. Finally, we perform exact and asymptotic enumeration of the set of all bounded affine permutations of size $n$. A companion paper will focus on avoidance of monotone decreasing patterns in bounded affine permutations. Comment: 35 pages

Some Families of Trees Arising in Permutation Analysis

We extend classical results on simple varieties of trees (asymptotic enumeration, average behavior of tree parameters) to trees counted by their number of leaves. Motivated by genome comparison of related species, we then apply these results to strong interval trees with a restriction on the arity of prime nodes. Doing so, we describe a filtration of the set of permutations based on their strong interval trees. This filtration is also studied from a purely analytical point of view, thus illustrating the convergence of analytic series towards a non-analytic limit at the level of the asymptotic behavior of their coefficients.

A bijection for nonorientable general maps

International audience We give a different presentation of a recent bijection due to Chapuy and Dołe ̨ga for nonorientable bipartite quadrangulations and we extend it to the case of nonorientable general maps. This can be seen as a Bouttier–Di Francesco–Guitter-like generalization of the Cori–Vauquelin–Schaeffer bijection in the context of general nonori- entable surfaces. In the particular case of triangulations, the encoding objects take a particularly simple form and we recover a famous asymptotic enumeration formula found by Gao.