arXiv (All)
open access
An Erdős-Szekeres-Type Result on Permutation Patterns
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.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Protected tails and polynomial-time enumeration of permutations avoiding a direct sum of an increasing pattern and 231#1156455
- An experimental study of forbidden patterns in geometric permutations by combinatorial lifting#311963
- Permutations with a fixed number of occurrences of a monotone pattern#1354080
- Unranking $S$-avoiding permutations with two forbidden offsets#1388524
- On the composition of permutons#1297297
Record · ID 1412276
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive