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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Forbidden sparse intersections

Miltiadis Karamanlis, Pandelis Dodos
Forum of Mathematics Sigma
Limits and Structures in Graph Theory
article

Forbidden sparse intersections

Miltiadis Karamanlis, Pandelis Dodos
article en

Abstract

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.

Forum of Mathematics SigmaVol. 13
National and Kapodistrian University of Athens (GR)
Hellenic Foundation for Research and Innovation
Openalex Percentile: Top 79%
Limits and Structures in Graph Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.