arXiv (All)
open access
Completing the enumeration of inversion sequences avoiding triples of relations
An inversion sequence of length $n$ is an integer sequence $(a_1, \ldots, a_n)$ such that $0 \le a_i < i$ for all $i$. The study of pattern-avoiding inversion sequences was initiated in 2015 by Mansour and Shattuck and in 2016 by Corteel, Martinez, Savage and Weselcouch. Martinez and Savage later de
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
- Iterating the Lehmer code on inversion sequences: Catalan fixed points and finite stabilization#998351
- An $n^{8/5+o(1)}$-Time $Ω(λ^3)$-Approximation for Longest Common Subsequence#1105337
- Boyer-Moore Variants for Indeterminate String Matching and Experimental Evaluation#1063381
- Arrow-Wilf equivalences and enumerative results for short arrow patterns#1077321
- Efficient Algorithms to Compute Closed Substrings#972927
Record · ID 1141239
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