Table of Contents
Fetching ...

Intersection patterns in spaces with a forbidden homological minor

Xavier Goaoc, Andreas F. Holmsen, Zuzana Patáková

TL;DR

This work extends Helly-type intersection results to triangulable spaces with a forbidden homological minor by introducing $(K,b)$-free covers and proving that the fractional Helly number is at most $\mu(K)+1$, which implies a $(p,q)$-theorem for all $p\ge q>\mu(K)$ independent of $b$. The authors develop a robust framework based on grid complexes, stair-convex chains, and constrained chain maps to transfer intersection patterns from fixed-size subfamilies to larger ones, and to handle colorful (multipartite) configurations via a density-propagation mechanism. This leads to a unified topological approach that recovers classical results for appropriate $K$ (e.g., good covers) and provides a path toward a broader conjectural program on polynomial homological shatter functions and Leray-type nerves. The results have implications for topological combinatorics and potential algorithmic applications in property testing and constraint satisfaction by linking intersection patterns to global topological structure, with independence from the ambient dimension encoded in $\mu(K)$.

Abstract

In this paper we study generalizations of classical results on intersection patterns of set systems in $\mathbb{R}^d$, such as the fractional Helly theorem or the $(p,q)$-theorem, in the setting of arbitrary triangulable spaces with a forbidden homological minor. Given a simplicial complex $K$ and an integer $b$, we say that a family $\mathcal{F}$ of subcomplexes of some simplicial complex $\mathcal{U}$ is a \emph{$(K,b)$-free cover} if (i) $K$ is a forbidden homological minor of $\mathcal{U}$, and (ii) the $j$th reduced Betti number $\tildeβ_j(\bigcap_{S\in {\mathcal{G}}}S,\mathbb{Z}_2)$ is strictly less than $b$ for all $0\leq j < \dim K$ and all nonempty subfamilies $\mathcal{G}\subseteq \mathcal{F}$. We show that for every $K$ and $b$, the fractional Helly number of a $(K,b)$-free cover is at most $μ(K)+1$, where $μ(K)$ is the maximum sum of the dimensions of two disjoint faces in~$K$. This implies that the assertion of the $(p,q)$-theorem holds for every $p \ge q > μ(K)$ and every $(K,b)$-free cover $\mathcal{F}$. For $b=1$ and a suitable $K$ this recovers the original $(p,q)$-theorem and its generalization to good covers. Interestingly, our results show that that the range of parameters $(p,q)$ for which the $(p,q)$-theorem holds is independent of $b$. Our proofs use Ramsey-type arguments combined with the notion of stair convexity of Bukh et al. to construct (forbidden) homological minors in cubical complexes.

Intersection patterns in spaces with a forbidden homological minor

TL;DR

This work extends Helly-type intersection results to triangulable spaces with a forbidden homological minor by introducing -free covers and proving that the fractional Helly number is at most , which implies a -theorem for all independent of . The authors develop a robust framework based on grid complexes, stair-convex chains, and constrained chain maps to transfer intersection patterns from fixed-size subfamilies to larger ones, and to handle colorful (multipartite) configurations via a density-propagation mechanism. This leads to a unified topological approach that recovers classical results for appropriate (e.g., good covers) and provides a path toward a broader conjectural program on polynomial homological shatter functions and Leray-type nerves. The results have implications for topological combinatorics and potential algorithmic applications in property testing and constraint satisfaction by linking intersection patterns to global topological structure, with independence from the ambient dimension encoded in .

Abstract

In this paper we study generalizations of classical results on intersection patterns of set systems in , such as the fractional Helly theorem or the -theorem, in the setting of arbitrary triangulable spaces with a forbidden homological minor. Given a simplicial complex and an integer , we say that a family of subcomplexes of some simplicial complex is a \emph{-free cover} if (i) is a forbidden homological minor of , and (ii) the th reduced Betti number is strictly less than for all and all nonempty subfamilies . We show that for every and , the fractional Helly number of a -free cover is at most , where is the maximum sum of the dimensions of two disjoint faces in~. This implies that the assertion of the -theorem holds for every and every -free cover . For and a suitable this recovers the original -theorem and its generalization to good covers. Interestingly, our results show that that the range of parameters for which the -theorem holds is independent of . Our proofs use Ramsey-type arguments combined with the notion of stair convexity of Bukh et al. to construct (forbidden) homological minors in cubical complexes.

Paper Structure

This paper contains 46 sections, 21 theorems, 68 equations, 6 figures.

Key Result

Theorem 1.1

The assertion of the $(p,q)$-theorem holds for $(K,b)$-free covers for every finite simplicial complex $K$ and integers $p\geq q > \mu(K)$ and $b\geq 1$.

Figures (6)

  • Figure 1: On the left: An illustration of the 2-chain $\mathop{\mathrm{sc}}\nolimits^2_2(a,b,c)$ with highlighted boundary. On the right: An illustration of the boundary of $\mathop{\mathrm{sc}}\nolimits^2_2(a,b,c)$ decomposed into the sum of $\mathop{\mathrm{sc}}\nolimits^2_1(a,b), \mathop{\mathrm{sc}}\nolimits^2_1(b,c)$ and $\mathop{\mathrm{sc}}\nolimits^2_1(a,c)$, respectively. Note that both $\{a\}\times [a,b]$ and $[b,c]\times \{c\}$ cancel out since we work with $\mathbb Z_2$ coefficients.
  • Figure 2: The graph $K_5$ (considered as a 1-dimensional simplicial complex) realized as a subcomplex of the grid complex $G[5]^3$ via the generic chain map given in Lemma \ref{['l:K_generic_grid_minor']}
  • Figure 3: A homomorphism $h: C_1(G[8]^2) \to \mathbb{Z}_2$. The blue subgrid of size $3$ of $G[8]^2$ lies in the kernel of $h$.
  • Figure 4: The 3-chain $\mathop{\mathrm{box}}\nolimits_3( (1,1,2), (3,3,3) )$ .
  • Figure 5: The 2-chains $\mathop{\mathrm{chn}}\nolimits_{\{1,2\}}( (3,4,4) )$ (in blue) and $\mathop{\mathrm{chn}}\nolimits_{\{1,3\}}( (3,4,4) )$ (in red).
  • ...and 1 more figures

Theorems & Definitions (43)

  • Theorem 1.1
  • Theorem 1.2
  • Corollary 1.3
  • Corollary 1.4
  • Corollary 1.5
  • Conjecture 1.6
  • Conjecture 1.7
  • Conjecture 1.8
  • Conjecture 1.9: Following kalai_conjectures
  • Conjecture 1.10
  • ...and 33 more