Forbidden sparse intersections
Abstract Let n be a positive integer, let $0<p\leqslant p'\leqslant \frac 12$ , and let $\ell \leqslant pn$ be a nonnegative integer. We prove that if $\mathcal {F},\mathcal {G}\subseteq \{0,1\}^n$ are two families whose cross intersections forbid $\ell $ —that is, they satisfy $|A\cap B|\neq \ell $ for every $A\in \mathcal {F}$ and every $B\in \mathcal {G}$ – then, setting $t:= \min \{\ell ,pn-\ell \}$ , we have the subgaussian bound $$\begin{align*}\mu_p(\mathcal{F})\, \mu_{p'}(\mathcal{G}) \leqslant 2\exp\Big( - \frac{t^2}{58^2\,pn}\Big), \end{align*}$$ where $\mu _p$ and $\mu _{p'}$ denote the p -biased and $p'$ -biased measures on $\{0,1\}^n$ , respectively.
Authors
- Miltiadis Karamanlis (ORCID: https://orcid.org/0000-0003-2453-3509)
- Pandelis Dodos (ORCID: https://orcid.org/0000-0002-7231-5074)
Institutions
- National and Kapodistrian University of Athens (GR)
Publication Details
- Journal
- Forum of Mathematics Sigma
- Published
- 2025-01-01
- DOI
- https://doi.org/10.1017/fms.2025.10067
- Primary Topic
- Limits and Structures in Graph Theory
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Hellenic Foundation for Research and Innovation