English
Related papers

Related papers: Linear forms and higher-degree uniformity for func…

200 papers

We give improved bounds for our theorem in [GW09], which shows that a system of linear forms on $\mathbb{F}_p^n$ with squares that are linearly independent has the expected number of solutions in any linearly uniform subset of…

Number Theory · Mathematics 2014-01-14 W. T. Gowers , J. Wolf

Consider a subset $A$ of $\mathbb{F}_p^n$ and a decomposition of its indicator function as the sum of two bounded functions $1_A=f_1+f_2$. For every family of linear forms, we find the smallest degree of uniformity $k$ such that assuming…

Number Theory · Mathematics 2011-03-25 Hamed Hatami , Shachar Lovett

In this paper, we prove power-saving bounds for the corelation of the M\"obius function with polynomial phases of degree $k$ in function fields $\mathbb{F}_p[t]$, when $p > k$. The proof relies on a new approximation result for phases of…

Combinatorics · Mathematics 2025-12-22 Luka Milićević , Žarko Ranđelović

We study sequences of functions of the form F_p^n -> {0,1} for varying n, and define a notion of convergence based on the induced distributions from restricting the functions to a random affine subspace. Using a decomposition theorem and a…

Combinatorics · Mathematics 2013-08-20 Hamed Hatami , Pooya Hatami , James Hirst

A bracket polynomial on the integers is a function formed using the operations of addition, multiplication and taking fractional parts. For a fairly large class of bracket polynomials we show that if p is a bracket polynomial of degree k-1…

Number Theory · Mathematics 2014-09-29 Matthew Tointon

For every natural number k we prove a decomposition theorem for bounded measurable functions on compact abelian groups into a structured part, a quasi random part and a small error term. In this theorem quasi randomness is measured with the…

Combinatorics · Mathematics 2010-11-04 Balazs Szegedy

A remarkable result of Bergelson, Tao and Ziegler implies that if $c>0$, $k$ is a positive integer, $p\geq k$ is a prime, $n$ is sufficiently large, and $f:\mathbb F_p^n\to\mathbb C$ is a function with $\|f\|_\infty\leq 1$ and…

Combinatorics · Mathematics 2017-12-04 W. T. Gowers , Luka Milićević

We define a natural notion of higher order stability and show that subsets of $\mathbb{F}_p^n$ that are tame in this sense can be approximately described by a union of low-complexity quadratic varieties, up to linear error. This generalizes…

Combinatorics · Mathematics 2025-10-17 C. Terry , J. Wolf

Let $\lambda$ denote the Liouville function. We show that, as $X \rightarrow \infty$, $$\int_{X}^{2X} \sup_{\substack{P(Y)\in \mathbb{R}[Y]\\ deg(P)\leq k}} \Big | \sum_{x \leq n \leq x + H} \lambda(n) e(-P(n)) \Big |\ dx = o ( X H)$$ for…

Number Theory · Mathematics 2023-02-21 Kaisa Matomäki , Maksym Radziwiłł , Terence Tao , Joni Teräväinen , Tamar Ziegler

Our contribution is a bounded cubic compilation theorem. For each fixed resource parameter $k$, syntactic proof checking at resource level $k$ is faithfully represented by a finite bounded-domain system of cubic polynomial equations. Every…

Logic · Mathematics 2026-04-29 Milan Rosko

A very useful fact in additive combinatorics is that analytic expressions that can be used to count the number of structures of various kinds in subsets of Abelian groups are robust under quasirandom perturbations, and moreover that…

Number Theory · Mathematics 2019-06-14 W. T. Gowers , J. Wolf

Let x be a random vector coming from any k-wise independent distribution over {-1,1}^n. For an n-variate degree-2 polynomial p, we prove that E[sgn(p(x))] is determined up to an additive epsilon for k = poly(1/epsilon). This answers an open…

Computational Complexity · Computer Science 2010-02-18 Ilias Diakonikolas , Daniel M. Kane , Jelani Nelson

For any $p\in[1,\infty]$, we prove that the set of simple functions taking at most $k$ different values is proximinal in $L^p$ for all $k\geq 1$. We introduce the class of uniformly approximable subsets of $L^p$, which is larger than the…

Classical Analysis and ODEs · Mathematics 2022-09-07 Guillaume Grelier , Jaime San Martín

In this note we characterize when non-classical polynomials are necessary in the inverse theorem for the Gowers $U^k$-norm. We give a brief deduction of the fact that a bounded function on $\mathbb F_p^n$ with large $U^k$-norm must…

Combinatorics · Mathematics 2022-10-28 Aaron Berger , Ashwin Sah , Mehtaab Sawhney , Jonathan Tidor

We introduce a notion of complexity for systems of linear forms, called sequential Cauchy-Schwarz complexity, which is parametrized by two positive integers $k,\ell$ and refines the notion of Cauchy-Schwarz complexity introduced by Green…

Combinatorics · Mathematics 2022-07-05 Pablo Candela , Diego González-Sánchez , Balázs Szegedy

Fix an odd prime $p$. If $r$ is a positive integer and $f$ a polynomial with coefficients in $\mathbb{F}_{p^r}$, let $P_{p,r}(f)$ be the proportion of $\mathbb{P}^1(\mathbb{F}_{p^r})$ that is periodic with respect to $f$. We show that as…

Number Theory · Mathematics 2022-08-26 Derek Garton

We establish the \emph{inverse conjecture for the Gowers norm over finite fields}, which asserts (roughly speaking) that if a bounded function $f: V \to \C$ on a finite-dimensional vector space $V$ over a finite field $\F$ has large Gowers…

Combinatorics · Mathematics 2011-09-09 Terence Tao , Tamar Ziegler

On the sets of $2\pi$-periodic functions $f$, which are defined with a help of $(\psi, \beta)$-integrals of the functions $\varphi$ from $L_{1}$, we establish Lebesgue-type inequalities, in which the uniform norms of deviations of Fourier…

Classical Analysis and ODEs · Mathematics 2023-01-06 Anatoly Serdyuk , Tetiana Stepaniuk

We consider a class of $n^{\text{th}}$-order linear ordinary differential equations with a large parameter $u$. Analytic solutions of these equations can be described by (divergent) formal series in descending powers of $u$. We demonstrate…

Classical Analysis and ODEs · Mathematics 2024-09-30 Gergő Nemes

Consider $k\ge 2$ distinct, linearly independent, homogeneous linear recurrences of order $k$ satisfying the same recurrence relation. We prove that the recurrences are related to a decomposable form of degree $k$, and there is a very broad…

Number Theory · Mathematics 2023-08-29 Kalman Gyory , Attila Petho , Laszlo Szalay
‹ Prev 1 2 3 10 Next ›