arXiv (All)
open access
The maximum $t$-diversity of $t$-intersecting families of permutations
The study of $t$-intersecting families in symmetric groups received lots of attention in the last two decades. In this paper, we study two different kinds of stability results for $t$-intersecting families in symmetric groups. Let $Σ_n$ denote the symmetric group on $\{1,2,\ldots,n\}$. The $t$-diver
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
- Pin Classes I: Growth Rates#1141394
- S-meandric Permutations and Tangency Polynomials#1078139
- Poisson Exchange Beyond Submodularity: Effective Approximation Algorithms for Offline and Online Subset Selection over Matroids#1061057
- Poisson Exchange Beyond Submodularity: Effective Approximation Algorithms for Offline and Online Subset Selection over Matroids#1028713
- Eulerian calculus arising from permutation statistics#226750
Record · ID 1000344
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