Permutations avoiding a pattern from Sk and at least two patterns from S3
T. Mansour
Abstract
In this paper, we find explicit formulas or generating functions for the cardinalities of the sets Sn(T,τ) of all permutations in Sn that avoid a pattern τ∈ Sk and a set T, |T|≥ 2, of patterns from S3. The main body of the paper is divided into three sections corresponding to the cases |T|=2,3 and |T|≥ 4. As an example, in the fifth section, we obtain the complete classification of all cardinalities of the sets Sn(T,τ) for k=4.
Create a lesson
Related papers
Counting with Hiccup Sequences
Benoit Cloitre
Degree similar and net-degree similar signed graphs
Matteo Cavaleri, Alfredo Donno
Clique and chromatic numbers of graph powers: spectral bounds and anticodes
Aida Abiad, Gabriel Coutinho, Hitesh Kumar et al.
Counting cographs in locally dense graphs
Hyunwoo Lee
Two-orbit right-angled Polytopes and Hypertopes
Claudio Alexandre Piedade, Philippe Tranchida
On the failure of additivity of inversion numbers for dijoins
Natalie Behague, Jack Cromwell