Wilf classes of pairs of permutations of length 4.

Le, Ian

Displaying similar documents to “Wilf classes of pairs of permutations of length 4.”

The enumeration of simple permutations.

Albert, M.H., Atkinson, M.D., Klazar, M. (2003)

Journal of Integer Sequences [electronic only]

Similarity:

A combinatorial interpretation of the eigensequence for composition.

Callan, David (2006)

Journal of Integer Sequences [electronic only]

Similarity:

Growth rates for subclasses of Av(321).

Albert, M.H., Atkinson, M.D., Brignall, R., Ruškuc, N., Smith, Rebecca, West, J. (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Pattern avoidance classes and subpermutations.

Atkinson, M.D., Murphy, M.M., Ruškuc, N. (2005)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Counting 1324, 4231-avoiding permutations.

Albert, Michael H., Atkinson, M.D., Vatter, Vincent (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Escher's combinatorial patterns.

Schattscheider, Doris (1997)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Place-difference-value patterns: a generalization of generalized permutation and word patterns.

Kitaev, Sergey, Remmel, Jeffrey (2010)

Integers

Similarity:

Parity-alternating permutations and successions

Augustine Munagi (2014)

Open Mathematics

Similarity:

The study of parity-alternating permutations of {1, 2, … n} is extended to permutations containing a prescribed number of parity successions - adjacent pairs of elements of the same parity. Several enumeration formulae are computed for permutations containing a given number of parity successions, in conjunction with further parity and length restrictions. The objects are classified using direct construction and elementary combinatorial techniques. Analogous results are derived for circular...