SearcharxivSearch

arXiv · 2609.12391

The maximum $t$-diversity of $t$-intersecting families of permutations

Abstract

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$-diversity $γ_t(\mathcal{F})$ of $\mathcal{F}\subseteqΣ_n$ is defined as the minimum number of members of $\mathcal{F}$ whose deletion results in a family with transversal number $t$. The star $t$-diversity $γ_t^{\star}(\mathcal{F})$ is defined as the minimum number of members of $\mathcal{F}$ whose deletion results in a $t$-star. For $n$ relatively large with respect to $t$, we determine the best possible bounds for both $γ_t(\mathcal{F})$ and $γ_t^{\star}(\mathcal{F})$ over all $t$-intersecting families $\mathcal{F}\subseteqΣ_n$. The equality holding conditions are characterized. For $γ_t(\mathcal{F})$, the extremal case is generated by all $2t$-subsets of a $3t$-partial permutation or, when $t=2$, the family complements of the lines of the Fano plane. For $γ_t^{\star}(\mathcal{F})$, the extremal family is generated by all $(t+1)$-subsets of a $(t+2)$-partial permutation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yuhang Cao, Gennian Ge, Jian Wang, Jialuo Wang, Xiaochen Zhao. 2026-09-11. The maximum $t$-diversity of $t$-intersecting families of permutations. https://arxiv.org/abs/2609.12391

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Orthogonal Pairs in Maps from the Sphere to the Circle

We prove that, for any $f:S^2\to S^1$ and any $\varepsilon>0$, there exist orthogonal vectors $x,y\in S^2$ such that the length of the shortest arc between $f(x)$ and $f(y)$ is at most $π/2 +\varepsilon$. This proves a conjecture of Ghebleh from 2007 that the circular chromatic number of the real orthogonality graph is equal to four.

math.CO

Exact Area-Range Minima in the Quantitative Monsky Problem for Five and Seven Triangles

For a dissection $D$ of the unit square into $n$ nondegenerate triangles, let $R(D)=\max_i a_i-\min_i a_i, Δ(n)=\inf_D R(D).$ We prove that this infimum is attained for every $n\ge2$, and determine the exact minima for $n=5$ and $n=7$, allowing T-junctions. For five triangles, $Δ(5)=\frac{5\sqrt5-11}{8};$ equality holds precisely when three areas equal $(3-\sqrt5)/4$ and two equal $(3\sqrt5-5)/8$. For seven triangles, $Δ(7)=r_7$, where $r_7$ is the unique root in $(0,1/4900)$ of $864r^4+2160r^3-6060r^2+4972r-1.$ Every minimizer has four areas $(1+3r_7)/7$ and three areas $(1-4r_7)/7$, although its geometry need not be unique. The proofs combine finite combinatorial classification with exact symbolic and integer-interval certificates. For nine triangles, a tilted-strip construction gives the explicit algebraic upper bound $Δ(9)\le 0.0001273496861283553341\ldots,$ which is the exact minimum within that topology. Conversely, every dissection in the complete single-cap two-rail zig-zag family, with arbitrary continuous areas, has range greater than $1/3500$; hence a global minimizer must lie outside that family. The exact value of $Δ(9)$ remains open.

math.CO

Chromatic symmetric functions for annular webs

We introduce a combinatorial definition of chromatic symmetric functions for annular webs. We prove their symmetry by constructing a web analogue of the Shareshian--Wachs involution and show that they coincide with the symmetric functions associated to annular webs via Turaev's isomorphism. We then derive explicit formulas for their hook Schur coefficients. We also introduce web LLT functions, whose hook Schur coefficients admit positive Laurent-polynomial formulas. These formulas yield a combinatorial expression for the coefficients of the HOMFLY--PT polynomial of an annular web.

math.CO