Related papers: Enumeration of small Wilf classes avoiding 1324 an…

We complete the proof of the fact that all principal permutation classes generated by a pattern longer than two have a nonrational generating function.

We study the generating function for the number of permutations on n letters containing exactly $r\gs0$ occurences of 132. It is shown that finding this function for a given r amounts to a routine check of all permutations in $S_{2r}$.

We use the generating function of the characters of $C_2$ to obtain a generating function for the multiplicities of the weights entering in the irreducible representations of that simple Lie algebra. From this generating function we derive…

In this paper, we compute and demonstrate the equivalence of the joint distribution of the first letter and descent statistics on six avoidance classes of permutations corresponding to two patterns of length four. This distribution is in…

We construct a sequence of finite automata that accept subclasses of the class of 4231-avoiding permutations. We thereby show that the Wilf-Stanley limit for the class of 4231-avoiding permutations is bounded below by 9.35. This bound shows…

Let $c_n$ denote the number of nodes at a distance $n$ from the root of a rooted tree. A criterion for proving the rationality and computing the rational generating function of the sequence $\{c_n\}$ is described. This criterion is applied…

We define a map between the set of permutations that avoid either the four patterns $3214,3241,4213,4231$ or $3124,3142,4123,4132$, and the set of Dyck prefixes. This map, when restricted to either of the two classes, turns out to be a…

A permutation is (1-23-4)-avoiding if it contains no four entries, increasing left to right, with the middle two adjacent in the permutation. Here we give a 2-variable recurrence for the number of such permutations, improving on the…

We study the enumeration of spinal tree-child phylogenetic networks, a rigid family of tree-child networks in which all internal vertices lie on a single root--to--leaf path. We provide two complementary combinatorial frameworks. First, we…

Let $N_{g,n}$ denote the closed non-orientable surface of genus $g$ with $n$ punctures and let ${\mathcal N}_{g,n}$ denote the mapping class group of $N_{g,n}$. Szepietowski showed that ${\mathcal N}_{g,n}$ is generated by finitely many…

The enumeration of planar maps equipped with an Eulerian orientation has attracted attention in both combinatorics and theoretical physics since at least 2000. The case of 4-valent maps is particularly interesting: these orientations are in…

We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2+2)-free posets and a certain class of involutions (or chord diagrams), already appeared in the literature, but were apparently not…

The research on pattern-avoidance has yielded so far limited knowledge on Wilf-ordering of permutations. The Stanley-Wilf limits sqrt[n](|S_n(tau)|) and further works suggest asymptotic ordering of layered versus monotone patterns. Yet,…

We present a generating function and a closed counting formula in two variables that enumerate a family of classes of permutations that avoid or contain an increasing pattern of length three and have a prescribed number of occurrences of…

We study the generating function for the number of even (or odd) permutations on n letters containing exactly $r\gs0$ occurrences of 132. It is shown that finding this function for a given r amounts to a routine check of all permutations in…

This paper contains a complete description of minimal non-gatherable triangle triples in the lambda-sequences for the affine classical root systems and some claims for arbitrary (reduced) affine root systems. It continues our previous paper…

For a prime $p$ and nonnegative integers $j$ and $n$ let $\vartheta_p(j,n)$ be the number of entries in the $n$-th row of Pascal's triangle that are exactly divisible by $p^j$. Moreover, for a finite sequence $w=(w_{r-1}\cdots w_0)\neq…

For a variety of pattern-avoiding classes, we describe the limiting distribution for the number of fixed points for involutions chosen uniformly at random from that class. In particular we consider monotone patterns of arbitrary length as…

We study permutations $p$ such that both $p$ and $p^2$ avoid a given pattern $q$. We obtain a generating function for the case of $q=312$ (equivalently, $q=231$), we prove that if $q$ is monotone increasing, then above a certain length,…

We complete the enumeration of cyclic permutations avoiding two patterns of length three each by providing explicit formulas for all but one of the pairs for which no such formulas were known. The pair $(123,231)$ proves to be the most…