Improved bound on symmetric differences of intersecting families

Abstract: For a family $\mathcal{F}$, it is called intersecting if $F\cap F'\neq \emptyset$ for all $F,F'\in\mathcal{F}$. We use $\mathcal{SD}(\mathcal{F}) = {F \triangle G : F, G \in \mathcal{F}}$ to denote the family of symmetric differences of $\mathcal{F}$. In 2023, Frankl, Kiselev and Kupavskii conjectured that for any intersecting family $\mathcal{F} \subseteq \binom{[n]}{k}$ with $n > 10k$, the inequality $|\mathcal{SD}(\mathcal{F})| \le \sum_{\ell=0}^{k-1} \binom{n-1}{2\ell}$ holds. They further observed that a proof for the range $n>3k^2$ could likely be obtained via arguments similar to those in their earlier work, though no detailed derivation was given. In this paper, we establish the conjecture under the conditions $n\ge 60k^{3/2}$ and $k\ge 50$. We also determine the extremal families, which are precisely a certain class of stars. A concentration inequality plays a central role in the proof.

• The paper establishes the conjectured upper bound on symmetric differences in k-uniform intersecting families for n ≥ 60k^(3/2), confirming stars as the unique extremal configuration.
• The paper employs advanced concentration inequalities and diversity measures within shadow and shade frameworks to rigorously bound set operations in intersecting families.
• The paper’s findings impact extremal combinatorics and applications in coding and design theory by refining optimal structures in intersecting systems.

Improved Bound on Symmetric Differences of Intersecting Families

Introduction

The study of set systems with intersecting properties is foundational in extremal combinatorics, particularly due to the Erdős–Ko–Rado theorem, which characterizes the maximal size and structure of intersecting families of $k$-element subsets of $[n]$. A recent segment of this research focuses on bounds associated with various set operations, notably symmetric difference ($\triangle$) and set difference ($\setminus$), within intersecting families. The symmetric difference operation induces a family $\mathcal{SD}(\mathcal{F})$ comprised of all pairwise symmetric differences of members in $\mathcal{F}$.

Frankl, Kiselev, and Kupavskii [F23] conjectured an upper bound for the cardinality of $\mathcal{SD}(\mathcal{F})$ when $\mathcal{F}$ is a $k$-uniform intersecting family and $n > 10k$. The conjectured bound:

$[n]$0

remains tight for full stars, a canonical intersecting structure. The paper "Improved bound on symmetric differences of intersecting families" (2606.20043) advances this line of inquiry, providing a proof of the conjecture for $[n]$1 and $[n]$2, and characterizing the extremal families.

Main Results and Methods

The principal theorem presented in the paper asserts:

Theorem: If $[n]$3 is intersecting, with $[n]$4 and $[n]$5, then

$[n]$6

with equality only for full stars or their subfamilies.

The proof strategy adapts, but does not merely replicate, the set difference arguments from [F23], incorporating techniques tailored for the symmetric difference context. The adaptation fundamentally relies on diversity analysis and advanced concentration inequalities.

Structural Reductions

A crucial facet is the diversity $[n]$7—the minimum, over $[n]$8, of the count of members in $[n]$9 excluding $\triangle$0. For stars, $\triangle$1, while positive diversity signals deviation from this extremal configuration.

Instead of directly bounding $\triangle$2, the analysis considers the $\triangle$3-th level shade $\triangle$4. The symmetry properties of $\triangle$5 necessitate this higher-order combinatorial consideration.

Key Lemmas

Lemma 1 relates a violation of the conjectured upper bound to low diversity in $\triangle$6, i.e., $\triangle$7. Lemma 2 establishes that if $\triangle$8, the conjectured bound must hold strictly.

The structural interplay between these lemmas ensures that only families with zero shade diversity—i.e., stars—can saturate the bound.

Technical Framework

Shadows, Shades, and Kruskal–Katona

The proof exploits level shadows and shades:

• The $\triangle$9-th shadow $\setminus$0: sets of size $\setminus$1 contained in some $\setminus$2.
• The $\setminus$3-th shade $\setminus$4: sets of size $\setminus$5 containing some $\setminus$6.

The Kruskal–Katona–Lovász theorem provides lower bounds on shadow sizes, which are critical for estimating the combinatorial growth of $\setminus$7 and its derived set operations.

Concentration Inequality

A modern concentration inequality for set systems [F23] is employed to argue about the probability deficiencies in certain shade-induced configurations. It is pivotal in connecting the combinatorial structure to probabilistic estimates, particularly in bounding the sizes of cross-intersecting families and controlling the growth of symmetric difference families away from the star case.

Extremal Configuration Characterization

Stars are shown to be the unique maximizers. The proof decomposes $\setminus$8's structure according to the presence or absence of a distinguished element, tracking sizes via shadows and partitioning diagrams. Advanced cross-intersecting arguments, extensions of Katona's theorem, and bipartite graph techniques are synthesized to demonstrate that any deviation from the star structure results in strict submaximality.

Numerical and Structural Implications

The provided bounds are sharp for large $\setminus$9 and $\mathcal{SD}(\mathcal{F})$0. The threshold $\mathcal{SD}(\mathcal{F})$1 raises nontrivial questions about the minimal $\mathcal{SD}(\mathcal{F})$2 required for the conjecture's validity and further suggests a possible refinement of the threshold. The identification of exact extremal families constrains potential counterexamples and sharpens the landscape of intersecting systems with maximal symmetric differences.

Contrasting the symmetric difference results with prior set difference and intersection bounds reveals deeper structural symmetries and distinctions in extremal combinatorics. The concentration inequality's utility also hints at broader applicability to analogous combinatorial optimization problems.

Implications and Future Directions

From a practical standpoint, improved bounds on symmetric differences have ramifications in coding theory, design theory, and random set selection, where intersecting family structures encode resilience and redundancy. Theoretically, the fusion of diversity measures, shades/shadows, and concentration inequalities lays a robust foundation for future extremal research.

Possible avenues include:

• Lowering the $\mathcal{SD}(\mathcal{F})$3 threshold for the established bound.
• Extending the sharp bound to cross-intersecting and multi-level intersecting families.
• Applying the combinatorial-probabilistic approach to other set operations (e.g., union, intersection, exclusive or).
• Investigating connections with algebraic and probabilistic methods in finite set systems and matroid theory.

Conclusion

The paper rigorously establishes the conjectured upper bound for symmetric differences in large uniform intersecting families, precisely characterizing extremal families as stars. The technical advancements—particularly the deployment of diversity, shades, and concentration inequalities—refine the combinatorial toolkit for higher-order extremal set theory. These results mark a substantial step in understanding the entropy and structure of intersecting systems under symmetric difference operations, providing a framework for further exploration of extremal combinatorial phenomena (2606.20043).