Counting Permutations that Avoid Many Patterns

Yonah Biers-Ariel; Haripriya Chakraborty; John Chiarelli; Bryan Ek; Andrew Lohr; Jinyoung Park; Justin Semonsen; Richard Voepel; Mingjia Yang; Anthony Zaleski; Doron Zeilberger

Counting Permutations that Avoid Many Patterns

Combinatorics 2017-03-08 v1

Authors: Yonah Biers-Ariel , Haripriya Chakraborty , John Chiarelli , Bryan Ek , Andrew Lohr , Jinyoung Park , Justin Semonsen , Richard Voepel , Mingjia Yang , Anthony Zaleski , Doron Zeilberger

View on arXiv ↗ PDF ↗

Abstract

This paper presents a collection of experimental results regarding permutation pattern avoidance, focusing on cases where there are "many" patterns to be avoided.

Keywords

pattern avoidance in permutations permutations

Cite

@article{arxiv.1703.02415,
  title  = {Counting Permutations that Avoid Many Patterns},
  author = {Yonah Biers-Ariel and Haripriya Chakraborty and John Chiarelli and Bryan Ek and Andrew Lohr and Jinyoung Park and Justin Semonsen and Richard Voepel and Mingjia Yang and Anthony Zaleski and Doron Zeilberger},
  journal= {arXiv preprint arXiv:1703.02415},
  year   = {2017}
}

Comments

9 pages. Accompanied by several Maple programs, and input and output files that may be obtained from http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/pamp.html

Counting Permutations that Avoid Many Patterns

Abstract

Keywords

Cite

Comments

Related papers