Enumerating permutations avoiding more than three Babson-Steingrímsson patterns.

Bernini, Antonio; Pergola, Elisa

The search session has expired. Please query the service again.

Displaying similar documents to “Enumerating permutations avoiding more than three Babson-Steingrímsson patterns.”

Counting 1324, 4231-avoiding permutations.

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

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A combinatorial interpretation of the eigensequence for composition.

Callan, David (2006)

Journal of Integer Sequences [electronic only]

Similarity:

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

Kitaev, Sergey, Remmel, Jeffrey (2010)

Integers

Similarity:

Three-letter-pattern avoiding permutations and functional equations.

Firro, Ghassan, Mansour, Toufik (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Some equinumerous pattern-avoiding classes of permutations.

Atkinson, M.D. (2005)

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

Similarity:

Longest alternating subsequences in pattern-restricted permutations.

Firro, Ghassan, Mansour, Toufik, Wilson, Mark C. (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Counting 1324-avoiding permutations.

Marinov, Darko, Radoičić, Radoš (2003)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Using homological duality in consecutive pattern avoidance.

Khoroshkin, Anton, Shapiro, Boris (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Packing patterns into words.

Burstein, Alexander, Hästö, Peter, Mansour, Toufik (2003)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

An answer to a question by Wilf on packing distinct patterns in a permutation.

Coleman, Micah (2004)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A combinatorial proof of a result for permutation pairs

Toufik Mansour, Mark Shattuck (2012)

Open Mathematics

Similarity:

In this paper, a direct combinatorial proof is given of a result on permutation pairs originally due to Carlitz, Scoville, and Vaughan and later extended. It concerns showing that the series expansion of the reciprocal of a certain multiply exponential generating function has positive integer coefficients. The arguments may then be applied to related problems, one of which concerns the reciprocal of the exponential series for Fibonacci numbers.

The skew and relative derangements of type B.

Chen, William Y.C., Zhang, Jessica C.Y. (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A generalization of Simion-Schmidt's bijection for restricted permutations.

Reifegerste, Astrid (2003)

The Electronic Journal of Combinatorics [electronic only]

Similarity: