Search arXivSearch

arXiv · 2608.17219

An Erdős--Ko--Rado theorem for cross-intersecting families in the Euclidean inner product

Abstract

Let $\binom{[n]}{k}$ be the set of all $k$-element subsets of the set $\{1,\ldots,n\}$ and let $\mathcal A,\mathcal B \subseteq \binom{[n]}{k}$ be two cross-intersecting families, that is, $A\cap B\neq \emptyset$ for any $A\in \mathcal A$ and $B\in \mathcal B$. The classical cross-intersecting version of the Erdős--Ko--Rado theorem, due to Pyber and Matsumoto--Tokushige, states that if $n\geq 2k$, then $|\mathcal A||\mathcal B|\leq \binom{n-1}{k-1}^2,$ where the equality holds for $n>2k$ if and only if $\mathcal A=\mathcal B$ is a star. In the present paper, we first give a stability result of this theorem by using Filmus's FKN theorem on the slice and linear algebra method as follows: There exists a constant $C>1$ such that if $n\geq 2.07k$ and $|\mathcal A||\mathcal B|\geq (1-ε)\binom{n-1}{k-1}^2$, where $ε\leq \frac{k^2}{C^2 n ^2 }$, then there is a star $\mathcal{S}$ such that $|\mathcal{S} Δ\mathcal A|\leq C ε\binom{n}{k}$ and $|\mathcal{S} Δ\mathcal B|\leq C ε\binom{n}{k}.$ Moreover, based on this stability result and the eigenvalues of the matrices of the Johnson scheme, we present an Erdős--Ko--Rado theorem for cross-intersecting families in the Euclidean inner product showing that if $n\geq 2k$ and $k\geq d \geq 0$, then $$\big\langle\mathbf{v}_d(\mathcal A),\mathbf{v}_d(\mathcal B)\big\rangle \leq \frac{\binom{k}{d}\binom{k-1}{d}}{\binom{n-1}{d}}\binom{n-1}{k-1}^2 +\binom{k-1}{d-1} \binom{n-d-1}{k-d}\binom{n-1}{k-1},$$ together with uniqueness and a corresponding stability result, where $\mathbf{v}_d(\mathcal A) \in \mathbb R^{\binom{[n]}{d}}$ is the $d$-degree vector of $\mathcal A$ whose $U$-entry is the number of members in $\mathcal A$ containing $U$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiang-Chao Wan, Yi Wang. 2026-08-18. An Erdős--Ko--Rado theorem for cross-intersecting families in the Euclidean inner product. https://arxiv.org/abs/2608.17219

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