arXiv (All)
open access
On a conjecture concerning two-stack sortable permutations
The two-stack sortable permutations of length $n$ are known to be equinumerous with permutations of length $n$ avoiding the dashed patterns $3\text{-}1\text{-}4\text{-}2$ and $2\text{-}41\text{-}3$. In this paper, we confirm an intriguing conjecture posed by Claesson, Kitaev, and Steingrímsson, whic
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
- Real-rooted Eulerian polynomials from permutations, words, and paths#975372
- Determining the Rearrangement Number#974500
- Distribution of the inversion statistic on run-sorted permutations#1076330
- Descent generating polynomials for ($n-3$)- and ($n-4$)-stack-sortable (pattern-avoiding) permutations#1082938
- Computing distances in braid-move graphs, higher Bruhat orders, and oriented-matroid mutation graphs is NP-hard#1199082
Record · ID 1413356
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