HAL (France)
open access
Pattern avoidance in inversion sequences
This thesis is devoted to the study of pattern avoidance in inversion sequences, with a primary focus on their enumeration. Inversion sequences arise naturally as encodings of permutations via the Lehmer code, but they also form a rich combinatorial structure in their own right. While permutation pa
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
- Completing the enumeration of inversion sequences avoiding triples of relations#1141239
- Global patterns in signed permutations#1110087
- Universal Shift Congruences for Weighted Permutation Sequences#1327099
- Coding for Multiple Reverse-Complement and Palindromic Duplications#820790
Record · ID 1251072
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