On permutations avoiding 1243, 2134, and another 4-letter pattern

Callan, David; Mansour, Toufik

doi:10.1515/puma-2015-0019

.blurhash-client-img { display: none !important; }

On permutations avoiding 1243, 2134, and another 4-letter pattern

Pure Mathematics and Applications

Volume 26 (2017): Issue 1 (June 2017)

By: David Callan and Toufik Mansour

Open Access

|Jul 2017

Abstract

We enumerate permutations avoiding 1243, 2134, and a third 4-letter pattern τ, a step toward the goal of enumerating avoiders for all triples of 4-letter patterns. The enumeration is already known for all but three patterns τ, which are treated in this paper.

References

[1] D. Callan and T. Mansour, Five subsets of permutations enumerated as weak sorting permutations, Southeast Asian Bull. Math., to appear.
Search in Google Scholar Back to article
[2] D. Callan and T. Mansour, On permutations avoiding 1324, 2143, and another 4-letter pattern, Pure Math. Appl. (PU.M.A.), this issue.
Search in Google Scholar Back to article
[3] D. Callan and Mansour, A Wilf class composed of 7 symmetry classes of triples of 4-letter patterns, J. Analysis and Number Theory, 5 (2017) 19-26.10.18576/jant/050104
Search in Google Scholar Back to article
[4] D. Callan, T. Mansour and M. Shattuck, Twelve subsets of permutations enumerated as maximally clustered permutations, Ann. Math. Inform., to appear.
Search in Google Scholar Back to article
[5] D. Callan, T. Mansour and M. Shattuck, Wilf classification of triples of 4-letter patterns II, Discrete Math. Theor. Comput. Sci., 19 (2017) #6, 44pp.10.18576/jant/050104
Search in Google Scholar Back to article
[6] D. Callan, T. Mansour and M. Shattuck, Wilf classification of triples of 4-letter patterns I, Discrete Math. Theor. Comput. Sci., 19 (2017) #5, 35pp.10.18576/jant/050104
Search in Google Scholar Back to article
[7] T. Mansour and M. Schork, Wilf classification of subsets of four letter patterns, J. Combinatorics and Number Theory, 8 (2016) 1-129.
Search in Google Scholar Back to article
[8] T. Mansour and M. Schork, Wilf classification of subsets of eight and nine four-letter patterns, J. Combinatorics and Number Theory, 8 (2016) 257-283.
Search in Google Scholar Back to article
[9] V. Vatter, Finding regular insertion encodings for permutation classes, J. Symbolic Comput., 47 (2012) 259-265.10.1016/j.jsc.2011.11.002
Search in Google Scholar Back to article

DOI: https://doi.org/10.1515/puma-2015-0019 | Journal eISSN: 1788-800X

Journal RSS Feed

Language: English

Page range: 11 - 21

Submitted on: Sep 14, 2016

Published on: Jul 14, 2017

Published by: Corvinus University of Budapest

In partnership with: Paradigm Publishing Services

Publication frequency: 4 issues per year

Keywords:

pattern avoidance

Related subjects:

Computer sciences,

Theoretical computer sciences,

Mathematics,

Analysis,

Differential equations and dynamical systems,

Business and economics,

Mathematics and statistics for economists,

Mathematics

© 2017 David Callan, Toufik Mansour, published by Corvinus University of Budapest
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Previous article Volume 26 (2017): Issue 1 (June 2017)Next article