arXiv (All)
open access
Iterating the Lehmer code on inversion sequences: Catalan fixed points and finite stabilization
We study an operator $Θ$ on finite integer sequences, where $Θ(σ)_i$ counts the entries to the left of $σ_i$ that are strictly smaller than $σ_i$. This operator is a variant of the so-called Lehmer code. For every sequence $σ$, the image $Θ(σ)$ is an inversion sequence, and the restriction of $Θ$ to
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
- Completing the enumeration of inversion sequences avoiding triples of relations#1141239
- On the Hamming distance properties of group codes#490073
- Balanced Gray Codes for Permutations and Rainbow Cycles for Associahedra#1014533
- Preimages under the bubblesort operator#983965
- Restricted inversion polynomials#997452
Record · ID 998351
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