arXiv (All)
open access
123-Avoiding permutations with an adjacency constraint
We study permutations $π\in S_n$ that avoid $123$ while satisfying the adjacency constraint $\lvert π_{i+1}-π_i\rvert \le m$ for some $m\in\mathbb{Z}^{+}$. We first show that every admissible permutation is localized within vertical distance $m$ of the reverse diagonal, revealing a strong global res
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
- Retained-Set Descent for Diagonal Ramsey Numbers#1084471
- On permutation-invariant construction of glued lattices#1034926
- A Robust Perceptron Cycling Theorem and Applications#1012530
- Global patterns in signed permutations#1110087
- Maximal Lehmer Codes for Permutations with Classical and Consecutive 321-Avoidance#1117849
Record · ID 1186840
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