Search arXivSearch

arXiv · 2106.04894

Geometric and o-minimal Littlewood-Offord problems

Abstract

The classical Erdős-Littlewood-Offord theorem says that for nonzero vectors $a_1,\dots,a_n\in \mathbb{R}^d$, any $x\in \mathbb{R}^d$, and uniformly random $(ξ_1,\dots,ξ_n)\in\{-1,1\}^n$, we have $\Pr(a_1ξ_1+\dots+a_nξ_n=x)=O(n^{-1/2})$. In this paper we show that $\Pr(a_1ξ_1+\dots+a_nξ_n\in S)\le n^{-1/2+o(1)}$ whenever $S$ is definable with respect to an o-minimal structure (for example, this holds when $S$ is any algebraic hypersurface), under the necessary condition that it does not contain a line segment. We also obtain an inverse theorem in this setting.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jacob Fox, Matthew Kwan, Hunter Spink. 2022-06-14. Geometric and o-minimal Littlewood-Offord problems. https://arxiv.org/abs/2106.04894

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO