Infinite antichains of permutations have long been used to construct interesting permutation classes and counterexamples. We prove the existence and detail the construction of infinite antichains with arbitrarily large growth rates. As a consequence, we show that every proper permutation class is contained in a class with a rational generating function. While this result implies the conclusion of the Marcus-Tardos theorem, that theorem is used in our proof
Of the three Wilf classes of permutations avoiding a single pattern of length 4, the exact enumerati...
AbstractWe use the cluster method to enumerate permutations avoiding consecutive patterns. We reprov...
All three authors were partially supported by EPSRC via the grant EP/J006440/1.Geometric grid classe...
We prove that the set of growth rates of permutation classes includes an infinite sequence of interv...
© Springer International Publishing AG, part of Springer Nature 2018. We prove that the set of permu...
AbstractA simple permutation is one that does not map any non-trivial interval onto an interval. It ...
A collection of permutation classes is exhibited whose growth rates form a perfect set, thereby refu...
In this paper we consider infinite antichains and the semilattices that they generate, mainly in the...
and Vincent Vatter The separable permutations are those that can be obtained from the trivial permut...
AbstractWe show that the Stanley–Wilf limit for the class of 4231-avoiding permutations is at least ...
Involvement is a partial order on all finite permutations, of infinite dimension and having subsets ...
We show that the Stanley–Wilf limit for the class of 4231-avoiding permutations is at least by 9.47....
AbstractMachines whose main purpose is to permute and sort data are studied. The sets of permutation...
We construct an uncountable family of well-quasi-ordered permutation classes, each with a distinct e...
We show that the Stanley-Wilf limit for the class of 4231-avoiding permutations is at least by 9.47....
Of the three Wilf classes of permutations avoiding a single pattern of length 4, the exact enumerati...
AbstractWe use the cluster method to enumerate permutations avoiding consecutive patterns. We reprov...
All three authors were partially supported by EPSRC via the grant EP/J006440/1.Geometric grid classe...
We prove that the set of growth rates of permutation classes includes an infinite sequence of interv...
© Springer International Publishing AG, part of Springer Nature 2018. We prove that the set of permu...
AbstractA simple permutation is one that does not map any non-trivial interval onto an interval. It ...
A collection of permutation classes is exhibited whose growth rates form a perfect set, thereby refu...
In this paper we consider infinite antichains and the semilattices that they generate, mainly in the...
and Vincent Vatter The separable permutations are those that can be obtained from the trivial permut...
AbstractWe show that the Stanley–Wilf limit for the class of 4231-avoiding permutations is at least ...
Involvement is a partial order on all finite permutations, of infinite dimension and having subsets ...
We show that the Stanley–Wilf limit for the class of 4231-avoiding permutations is at least by 9.47....
AbstractMachines whose main purpose is to permute and sort data are studied. The sets of permutation...
We construct an uncountable family of well-quasi-ordered permutation classes, each with a distinct e...
We show that the Stanley-Wilf limit for the class of 4231-avoiding permutations is at least by 9.47....
Of the three Wilf classes of permutations avoiding a single pattern of length 4, the exact enumerati...
AbstractWe use the cluster method to enumerate permutations avoiding consecutive patterns. We reprov...
All three authors were partially supported by EPSRC via the grant EP/J006440/1.Geometric grid classe...