English
Related papers

Related papers: A new proof of Roth's theorem on arithmetic progre…

200 papers

We prove a structural theorem for generalized arithmetic progressions in $\F_p$ which contain a large product set of two other progressions.

Combinatorics · Mathematics 2024-12-20 Ernie Croot , Junzhe Mao

Green and Tao famously proved in 2005 that any subset of the primes of fixed positive density contains arbitrarily long arithmetic progressions. Green had previously shown that in fact any subset of the primes of relative density tending to…

Number Theory · Mathematics 2019-06-14 Luka Rimanic , Julia Wolf

A folk theorem says higher order arithmetic has the proof theoretic strength of set theory with limited power set. This paper makes the theorem precise in terms of several axiom system based on ZF.

Logic · Mathematics 2013-02-18 Colin McLarty

In this paper, we prove a theorem on the distribution of primes in cubic progressions on average.

Number Theory · Mathematics 2013-05-17 Timothy Foo , Liangyi Zhao

In this article we discuss a version of the Chebotarev density for function fields over perfect fields with procyclic absolute Galois groups. Our version of this density theorem differs from other versions in two aspects: we include…

Number Theory · Mathematics 2016-06-28 Michiel Kosters

Pattern classes which avoid 321 and other patterns are shown to have the same growth rates as similar (but strictly larger) classes obtained by adding articulation points to any or all of the other patterns. The method of proof is to show…

Combinatorics · Mathematics 2009-10-09 M. H. Albert , M. D. Atkinson , R. Brignall , N. Ruskuc , Rebecca Smith , J. West

We present a solution of Exercise 1.2.1 of [2] which yields a short new proof of a key step in one of proofs of Brouwer's fixed point theorem, 1910. A few people asked the author about the details of the solution and they might be…

Classical Analysis and ODEs · Mathematics 2025-02-18 N. V. Krylov

We strengthen the maximal ergodic theorem for actions of groups of polynomial growth to a form involving jump quantity, which is the sharpest result among the family of variational or maximal ergodic theorems. As a consequence, we deduce in…

Dynamical Systems · Mathematics 2026-01-14 Guixiang Hong , Wei Liu

In this paper, we prove some new thickness theorems with partial derivatives. We give some applications. First, we give a simple criterion that can judge whether two scaled Cantor sets have non-empty intersection. Second, we prove under…

Dynamical Systems · Mathematics 2022-12-02 Kan Jiang

We give the converse to Dirichlet's theorem on primes in arithmetic progressions by generalizing an old result of Guinand.

Number Theory · Mathematics 2025-03-14 D. Liu

Let v be a multiplicative arithmetic function with support of positive asymptotic density. We prove that for any not identically zero arithmetic function f such that \sum_{f(n) \neq 0} 1 / n < \infty, the support of the Dirichlet…

Number Theory · Mathematics 2014-10-31 Carlo Sanna

In this short note we prove a theorem of the Stone-Weierstrass sort for subsets of the cone of non-decreasing continuous functions on compact partially ordered sets.

Classical Analysis and ODEs · Mathematics 2013-04-30 Fabien Besnard

We prove a result concerning the spreading of weighted Fekete points in the plane.

Complex Variables · Mathematics 2016-06-07 Yacin Ameur

We give new proofs for the hardness amplification of efficiently samplable predicates and of weakly verifiable puzzles which generalize to new settings. More concretely, in the first part of the paper, we give a new proof of Yao's XOR-Lemma…

Cryptography and Security · Computer Science 2010-12-30 Thomas Holenstein , Grant Schoenebeck

We use automated theorem provers to significantly shorten a formal development in higher order set theory. The development includes many standard theorems such as the fundamental theorem of arithmetic and irrationality of square root of…

Logic in Computer Science · Computer Science 2025-09-11 Chad E. Brown , Cezary Kaliszyk , Martin Suda , Josef Urban

Let $\alpha_1, \cdots, \alpha_d$ be real numbers, and let $S$ be the set of integers $s$ so that $||\alpha_i s||_{\mathbb{R}/\mathbb{Z}}>\delta$ for some $i$ and some fixed $\delta>0$. We prove $S$ is not \enquote{$2$-large}, i.e. there is…

Combinatorics · Mathematics 2025-12-25 Ryan Alweiss

A simple proof for the Shannon coding theorem, using only the Markov inequality, is presented. The technique is useful for didactic purposes, since it does not require many preliminaries and the information density and mutual information…

Information Theory · Computer Science 2012-05-08 Yuval Lomnitz , Meir Feder

We prove an upper bound for the length of an arithmetic progression represented by an irreducible integral binary quadratic form or a norm form, which depends only on the form and the progression's common difference. For quadratic forms,…

Number Theory · Mathematics 2019-08-14 Christian Elsholtz , Christopher Frei

Let $r_k(N)$ denote the size of the largest subset of $[N] = \{1,\ldots,N\}$ with no $k$-term arithmetic progression. We show that for $k\ge 5$, there exists $c_k>0$ such that \[r_k(N)\ll N\exp(-(\log\log N)^{c_k}).\] Our proof is a…

Combinatorics · Mathematics 2024-03-01 James Leng , Ashwin Sah , Mehtaab Sawhney

Given a level set $E$ of an arbitrary multiplicative function $f$, we establish, by building on the fundamental work of Frantzikinakis and Host [13,14], a structure theorem which gives a decomposition of $\mathbb{1}_E$ into an almost…

Number Theory · Mathematics 2022-05-16 Vitaly Bergelson , Joanna Kułaga-Przymus , Mariusz Lemańczyk , Florian K. Richter