arXiv (All)
open access
Residual structure and growing inversion-monotonicity regions for 1324-avoiding permutations
Let $a(n,k)$ be the number of $1324$-avoiding permutations of length $n$ with $k$ inversions. Linusson and Verkama proved $a(n,k)\le a(n+1,k)$ for $k\le2n-7$. We study the obstruction beyond that line: the residuals $\mathcal R_{δ,n}$, namely the indecomposable, non-almost-decomposable avoiders at d
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#1109623
- Pattern Popularity in 132-Avoiding Permutations#461144
- Real-rooted Eulerian polynomials from permutations, words, and paths#975372
- Pin Classes I: Growth Rates#1141394
- Improved Johnson-type Bounds for Insertion-Deletion Codes#615029
Record · ID 987874
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