PreprintarXiv licencearXiv
An Erdős-Szekeres-Type Result on Permutation Patterns
Abstract
We construct an infinite set of patterns (p,q) where p is an almost increasing permutation and q is an almost decreasing permutation, such that the exponential growth rate of permutations avoiding (p,q) is 2. This extends a classical result of Erdős and Szekeres.
Related
- Structural rigidity in the Erdős-Graham two-set permutation problem
- A Liouville type rigidity result for entire solutions of the k-Hessian equation
- A Criterion for Andrásfai–Erdős–Sόs Type Theorems and Applications
- An existence result of a functional integral equation via Darbo type theorem and an iterative algorithm to solve it
- A Gordon--Green-type result for Gorenstein-projective modules
BibTeX
@misc{nimwegen2026erdősszekerestype,
title = {{An Erdős-Szekeres-Type Result on Permutation Patterns}},
author = {Nicholas Van Nimwegen},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.28305},
eprint = {2610.28305},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.28305},
}
RIS
TY - UNPB
TI - An Erdős-Szekeres-Type Result on Permutation Patterns
AU - Nicholas Van Nimwegen
PY - 2026
DA - 2026/10/20
PB - arXiv
DO - 10.48550/arxiv.2610.28305
UR - https://arxiv.org/abs/2610.28305
AB - We construct an infinite set of patterns (p,q) where p is an almost increasing permutation and q is an almost decreasing permutation, such that the exponential growth rate of permutations avoiding (p,q) is 2. This extends a classical result of Erdős and Szekeres.
ER -