# Counting Permutations that Avoid Many Patterns

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

arXiv: 1703.02415 · 2017-03-08

## TL;DR

This paper explores the enumeration of permutations that avoid multiple patterns, providing experimental data to understand their combinatorial properties in complex avoidance scenarios.

## Contribution

It offers new experimental insights into permutation pattern avoidance when multiple patterns are involved, an area with limited prior data.

## Key findings

- Identified patterns in permutation avoidance counts
- Provided data on permutations avoiding many patterns
- Suggested directions for theoretical analysis

## Abstract

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

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1703.02415/full.md

## References

7 references — full list in the complete paper: https://tomesphere.com/paper/1703.02415/full.md

---
Source: https://tomesphere.com/paper/1703.02415