arXiv (OAI Expanded)
open access
Canon Permutation Posets
A permutation of the multiset $\{1^m,2^m,\dots,n^m\}$ is a canon permutation if the subsequence formed by the $j$th copy of each element of $[n]:=\{1,2,\dots,n\}$ is identical for all $j\in[m]$. Canon permutations were introduced by Elizalde and are motivated by pattern-avoiding concepts such as (qu
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
- Geometric view of interval poset permutations#799836
- Remarks on DAG exchangeability and generalized wreath products#1119140
- A Proof of Rubey's Lattice Conjecture#1155049
- A Generalized Monoid of Words with Applications to Divergent Arithmetic Products#793832
- The maximum $t$-diversity of $t$-intersecting families of permutations#1000344
Record · ID 1083978
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