Search arXivSearch

arXiv · 2606.26521

The Suda-Tanaka-Tokushige conjecture for $\mathbf{p}$-biased intersecting families

Abstract

In 2017, Suda, Tanaka and Tokushige conjectured that if $1>p_1\ge\cdots\ge p_n>0$ with $p_3\le \frac{1}{2}$, then every intersecting family $\mathcal A\subseteq 2^{[n]}$ satisfies $μ_{\mathbf{p}}(\mathcal A)\le p_1$, where $μ_{\mathbf{p}}$ is the non-uniform product measure defined by $μ_{\mathbf{p}}(\mathcal{A})=\sum_{A\in\mathcal{A}} \prod_{i\in A} p_i \prod_{j\in [n]\setminus A}(1-p_j)$. In addition, if $p_1 > p_3$ or $p_1 < \frac{1}{2}$, then equality holds if and only if $\mathcal{A}$ is a star centered at some $i \in [n]$ with $p_i = p_1$. In this paper, we prove this conjecture in the following stronger $t$-intersecting form: for any $t\ge 1$, if $p_{t+2}\le \frac{1}{t+1}$, then every $t$-intersecting family $\mathcal{A} \subseteq 2^{[n]}$ satisfies $μ_{\mathbf{p}}(\mathcal A)\le \prod_{i=1}^t p_i$. Moreover, when $p_{t+2}<\frac{1}{t+1}$, equality holds if and only if $\mathcal{A}=\{A\subseteq [n]: T\subseteq A\}$ for some $T\in \binom{[n]}{t}$ with $\prod_{i\in T} p_i=\prod_{i=1}^t p_i$. Our result unifies and generalizes the classical theorems of Fishburn-Frankl-Freed-Lagarias-Odlyzko and Friedgut.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yongjiang Wu, Lihua Feng. 2026-06-25. The Suda-Tanaka-Tokushige conjecture for $\mathbf{p}$-biased intersecting families. https://arxiv.org/abs/2606.26521

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO