Skip to content
Preprint

Asymptotically sharp bounds for affine subspace statistics in $\mathbb F_2^n$

Jul 2026 · 0 citations · 8 references
Mathematics

Abstract

Given a subset $A \subseteq \mathbb F_2^n$, we can consider the distribution of the intersection size of $A$ with a uniformly random $d$-flat $F$. Motivated by the edge statistics problem and the hypercube statistics problem, the affine subspace statistics problem concerns the maximum of $\mathbb{P}[|F\cap A|=s]$ among $A \subseteq \mathbb F_2^n$ for any fixed $s\in\{1,\dots,2^d\}$ over a uniformly random $d$-flat $F$. We use $\lambda^*(d,s)$ to denote the limit of the maximum when $n$ goes to infinity. In this note, we prove tight bounds for $\lambda^*(d,s)$ in two different regimes. For $s=j2^k$ where $j$ is a positive odd integer, the best known lower bound construction achieving $\lambda^*(d,s)\ge 1-2^{-k}$ is due to taking $A$ as the union of $j$ parallel $(n-d+k)$-flats in $\mathbb F_2^n$. Our main result is a matching upper bound with an additive error term of $O(2^{-3k/2})$. We also study the case $s=1$, where we determine $\lambda^*(d,1)$ exactly. We show that the random construction where each point is included with probability $2^{-d}$ is optimal.

View source

Similar papers

Preprint Sep 2026

Dimension-free estimates for the full discrete Euclidean ball maximal function

Let $M_t$ denote the normalized average over the lattice points in the Euclidean ball of radius $t$ in $\mathbb{Z}^d$. We prove that the full maximal operator $f\mapsto\sup_{t\geq0}\lvert M_t f\rvert$ is bounded on $\ell^p(\mathbb{Z}^d)$, for every $1<p\leq\infty$, with a constant independent of the dimension. In parti...

Sheng-Chen Mao · 0 citations
Preprint Sep 2026

Quasipolynomial density bounds for $K$-point configurations in $\mathbb{Z}^d$

Let $d,K,N\in \mathbb{N}$ with $K\geq 3$ and $d\geq 4K+4$. Let $\Delta\subset \mathbb{Z}^d$ be the vertex set of a nondegenerate $(K-1)$-simplex, and let $A\subseteq[N]^d$ contain no nontrivial similar copy of $\Delta$. We prove that \[ |A|\ll_{\Delta,d} N^d\exp\!\left(-c_{\Delta,d}\sqrt{\log N}\right) \] improving upo...

Andrew Lott, Á. Magyar, N. R. Ponagandla · 0 citations
Jul 2026

Level-set entropy and sparse randomized embeddings

This work develops an approach to the spectral norm of the matrix product $\Pi U_V$, based on entropy estimates for level sets of vectors $x\in V$, and shows that matching results hold for other random models with negatively associated entries.

K. Tikhomirov · 0 citations
Preprint Sep 2026

Optimal central limit theorem for bounded random variables in high dimensions

Let $W=n^{-1/2}\sum_{i=1}^n X_i$, where the $X_i$ are independent centered random vectors in ${\mathbb R}^p$ with $|X_{ij}|\le B$ almost surely. Suppose that $\text{Cov}(W)$ has unit diagonal and smallest eigenvalue at least $b^2>0$. We prove that the distance between $W$ and a Gaussian vector with the same covariance,...

P. M. Aronow, Patrick Lopatto · 0 citations
Preprint Aug 2026

The sharp SAT/UNSAT phase transition in random ellipsoid fitting

Let $x_1,\ldots,x_n$ be independent standard Gaussian vectors in $\mathbb{R}^d$. An \emph{ellipsoid fit} is a matrix $S \succeq 0$ such that $x_i^\top S x_i =d$ for every $i$, so that all the points lie on the boundary of the centered ellipsoid $\{ x : x^\top S x = d\}$. Saunderson, Parrilo and Willsky conjectured that...

Theodor Misiakiewicz, Garrett Wen · 0 citations
Preprint Aug 2026

A $2$-systolic inequality for $\mathbb S^2\times P$

We prove a sharp $2$-systolic inequality for four-dimensional products $\mathbb S^2\times P$, where $P\subset\mathbb R^2$ is an arbitrary convex polygon. Let $h=g_{\mathbb S^2}+g_{\mathrm{eu}}$ be the standard product metric. If a Riemannian metric $g$ on $\mathbb S^2\times P$ has scalar curvature $\geq \sigma>0$, nonn...

Jin-Min Wang, Zhi-Zhang Xie · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.