English
Related papers

Related papers: Sampling-based proofs of almost-periodicity result…

200 papers

Despite much research, hard weighted problems still resist super-polynomial improvements over their textbook solution. On the other hand, the unweighted versions of these problems have recently witnessed the sought-after speedups.…

Data Structures and Algorithms · Computer Science 2026-02-13 Mihail Stoian

Existence of long arithmetic progression in sumsets and subset sums has been studied extensively in the field of additive combinatorics. These additive combinatorics results play a central role in the recent progress of fundamental problems…

Data Structures and Algorithms · Computer Science 2025-04-08 Lin Chen , Yuchen Mao , Guochuan Zhang

Under the generalized Riemann Hypothesis (GRH), Baluyot, Chandee, and Li nearly doubled the range in which the density of low lying zeros predicted by Katz and Sarnak is known to hold for a large family of automorphic $L$-functions with…

Number Theory · Mathematics 2025-08-13 Timothy Cheek , Pico Gilman , Kareem Jaber , Steven J. Miller , Marie-Hélène Tomé

The densities of small linear structures (such as arithmetic progressions) in subsets of Abelian groups can be expressed as certain analytic averages involving linear forms. Higher-order Fourier analysis examines such averages by…

Number Theory · Mathematics 2014-05-09 Hamed Hatami , Pooya Hatami , Shachar Lovett

We prove a rigidity theorem that shows that, under many circumstances, quasi-isometric embeddings of equal rank, higher rank symmetric spaces are close to isometric embeddings. We also produce some surprising examples of quasi-isometric…

Differential Geometry · Mathematics 2018-06-13 David Fisher , Kevin Whyte

We give a fast algorithm for sampling uniform solutions of general constraint satisfaction problems (CSPs) in a local lemma regime. Suppose that the CSP has $n$ variables with domain size at most q, each constraint contains at most k…

Data Structures and Algorithms · Computer Science 2023-03-10 Kun He , Chunyang Wang , Yitong Yin

We prove a query complexity variant of the weak polynomial Freiman-Ruzsa conjecture in the following form. For any $\epsilon > 0$, a set $A \subset \mathbb{Z}^d$ with doubling $K$ has a subset of size at least $K^{-\frac{4}{\epsilon}}|A|$…

Number Theory · Mathematics 2022-01-14 Dmitrii Zhelezov , Dömötör Pálvölgyi

Polynomial approximations to boolean functions have led to many positive results in computer science. In particular, polynomial approximations to the sign function underly algorithms for agnostically learning halfspaces, as well as…

Computational Complexity · Computer Science 2014-12-09 Mark Bun , Thomas Steinke

We introduce the categories of quasi-measurable spaces, which are slight generalizations of the category of quasi-Borel spaces, where we now allow for general sample spaces and less restrictive random variables, spaces and maps. We show…

Probability · Mathematics 2021-09-27 Patrick Forré

Let $S(z)$ be an absolutely convergent Dirichlet series with a bounded spectrum and only real zeros $a_n$, let $\mu$ be the sum of unit masses at points $a_n$. It is proven that the Fourier transform $\hat\mu$ in the sense of distributions…

Functional Analysis · Mathematics 2023-11-07 Serhii Favorov

We prove a pointwise ergodic theorem for quasi-probability-measure-preserving (quasi-pmp) locally countable measurable graphs, equivalently, Schreier graphs of quasi-pmp actions of countable groups. For ergodic graphs, the theorem gives an…

Dynamical Systems · Mathematics 2023-08-29 Anush Tserunyan

We explore consequences of a hyperbolic metric induced by the composition property of the Harvda-Charvat/Dar\'{o}czy/Cressie-Read/Tsallis entropy. We address the special case of systems described by small deviations of the non-extensive…

Statistical Mechanics · Physics 2014-05-27 Nikos Kalogeropoulos

Following the groundbreaking Moser-Tardos algorithm for the Lovasz Local Lemma (LLL), a series of works have exploited a key ingredient of the original analysis, the witness tree lemma, in order to: derive deterministic, parallel and…

Discrete Mathematics · Computer Science 2019-06-11 Fotis Iliopoulos

Previous work of the second author and Wolf showed that given a set $A\subseteq \mathbb{F}_p^n$ of bounded $\textrm{VC}_2$-dimension, there is a high rank quadratic factor $\mathcal{B}$ of bounded complexity such that $A$ is approximately…

Combinatorics · Mathematics 2025-12-02 Hannah Sheats , Caroline Terry

This paper establishes several sharp spectral results for analytic quasiperiodic Schrodinger operators. Key contributions include: (1) exact exponential decay rates for spectral gaps of the almost Mathieu operator, addressing a question…

Dynamical Systems · Mathematics 2025-11-25 Lingrui Ge , Jiangong You , Qi Zhou

In this paper, we refine the Berry-Esseen bounds for the multivariate normal approximation of Polyak-Ruppert averaged iterates arising from the linear stochastic approximation (LSA) algorithm with decreasing step size. We consider the…

Machine Learning · Statistics 2025-10-15 Bogdan Butyrin , Eric Moulines , Alexey Naumov , Sergey Samsonov , Qi-Man Shao , Zhuo-Song Zhang

A classical limit theorem of stochastic process theory concerns the sample cumulative distribution function (CDF) from independent random variables. If the variables are uniformly distributed then these centered CDFs converge in a suitable…

Statistics Theory · Mathematics 2007-06-13 Lawrence D. Brown

In this paper, we prove that any analytic quasi-periodic cocycle close to constant is the Poincar\'{e} map of an analytic quasi-periodic linear system close to constant. With this local embedding theorem, we get fruitful new results. We…

Dynamical Systems · Mathematics 2015-06-04 Jiangong You , Qi Zhou

We prove a structure theorem for multiplicative functions which states that an arbitrary bounded multiplicative function can be decomposed into two terms, one that is approximately periodic and another that has small Gowers uniformity norm…

Number Theory · Mathematics 2016-01-27 Nikos Frantzikinakis , Bernard Host

For many random Constraint Satisfaction Problems, by now, we have asymptotically tight estimates of the largest constraint density for which they have solutions. At the same time, all known polynomial-time algorithms for many of these…

Combinatorics · Mathematics 2017-11-29 Dimitris Achlioptas , Amin Coja-Oghlan