English
Related papers

Related papers: Sets with arithmetic progressions are abundant

200 papers

For an integer $b \geqslant 2$ and a set $S\subset \{0,\cdots,b-1\}$, we define the Kempner set $\mathcal{K}(S,b)$ to be the set of all non-negative integers whose base-$b$ digital expansions contain only digits from $S$. These well-studied…

Number Theory · Mathematics 2018-09-10 Aled Walker , Alexander Walker

In many everyday categories (sets, spaces, modules, ...) objects can be both added and multiplied. The arithmetic of such objects is a challenge because there is usually no subtraction. We prove a family of cases of the following principle:…

Category Theory · Mathematics 2010-02-04 Marcelo Fiore , Tom Leinster

In the present work the existence of some patterns of primes is shown which generalize the celebrated result of Green and Tao according to which there are arbitrarily long arithmetic progressions in the sequence of primes

Number Theory · Mathematics 2010-04-08 Janos Pintz

In this paper we prove: If 0 < d < 1, and p is a sufficiently large prime, then if S is a subset of Z/pZ having the least number of three-term arithmetic progressions among all subsets of Z/pZ having at least dp elements, then S has an…

Number Theory · Mathematics 2007-05-23 Ernie Croot

We present a certain generalization of a recent result of M. I. Cirnu on linear recurrence relations with coefficient in progressions [2]. We provide some interesting examples related to some well-known integer sequences, such as Fibonacci…

Number Theory · Mathematics 2015-03-19 Jerico B. Bacani , Julius Fergy T. Rabago

A set of positive integers $A \subset \mathbb{Z}_{> 0}$ is \emph{log-sparse} if there is an absolute constant $C$ so that for any positive integer $x$ the sequence contains at most $C$ elements in the interval $[x,2x)$. In this note we…

Combinatorics · Mathematics 2021-04-20 Noga Alon , Ryan Alweiss , Yang P. Liu , Anders Martinsson , Shyam Narayanan

We analyze sumsets A+B = {a+b : a in A, b in B} where A,B are sets of integers, A is infinite, and B has positive upper Banach density. For each k, we show that A+B contains at least the expected density of k-term arithmetic progressions…

Dynamical Systems · Mathematics 2010-11-23 John T. Griesmer

A set $A\subseteq\mathbb N$ is called $complete$ if every sufficiently large integer can be written as the sum of distinct elements of $A$. In this paper we present a new method for proving the completeness of a set, improving results of…

Combinatorics · Mathematics 2016-09-27 Vitaly Bergelson , David Simmons

Inspired by the Erd\"os-Turan conjecture we consider subsets of the natural numbers that contains infinitely many aritmetic progressions (APs) of any given length - such sets will be called AP-sets and we know due to the Green-Tao Theorem…

Number Theory · Mathematics 2011-06-16 Jonas Lindstrøm Jensen

The purpose of this note is to verify that the results attained in [6] admit an extension to the multidimensional setting. Namely, for subsets of the two dimensional torus we find the sharp growth rate of the step(s) of a generalized…

Classical Analysis and ODEs · Mathematics 2017-11-13 Itay Londner

In the present paper we prove that there exist infinitely many arithmetic progressions of three different primes $p_1,p_2,p_3=2p_2-p_1$ such that $p_1=x_1^2 + y_1^2 +1$, $p_2=x_2^2 + y_2^2 +1$.

Number Theory · Mathematics 2017-06-21 S. I. Dimitrov

We prove that if $A$ is any set of prime numbers satisfying \[ \sum_{a\in A}\frac{1}{a}=\infty, \] then $A$ must contain a $3$-term arithmetic progression. This is accomplished by combining the transference principle with a density…

Number Theory · Mathematics 2015-06-12 Eric Naslund

We show the middle Nth cantor set contains arithmetic progressions of length at least proportional to N/log_2(N).

Number Theory · Mathematics 2017-03-28 Jon Chaika

There has been much work on the following question: given n how large can a subset of {1,...,n} be that has no arithmetic progressions of length 3. We call such sets 3-free. Most of the work has been asymptotic. In this paper we sketch…

Combinatorics · Mathematics 2025-01-06 William Gasarch , James Glenn , Clyde Kruskal

This paper is mainly concerned with sets which do not contain four-term arithmetic progressions, but are still very rich in three term arithmetic progressions, in the sense that all sufficiently large subsets contain at least one such…

Combinatorics · Mathematics 2020-09-17 Cosmin Pohoata , Oliver Roche-Newton

We identify pairs of positive integers $(t, d)$ with the property that the integer sequence with general term $\lfloor{n^t/d\rfloor}$ contains at most finitely many primes.

Number Theory · Mathematics 2025-01-10 Dan Ismailescu , Yunkyu James Lee

A strictly increasing sequence of positive integers is called a slightly curved sequence with small error if the sequence can be well-approximated by a function whose second derivative goes to zero faster than or equal to $1/x^\alpha$ for…

Number Theory · Mathematics 2019-03-05 Kota Saito , Yuuya Yoshida

In the present work we prove a number of surprising results about gaps between consecutive primes and arithmetic progressions in the sequence of generalized twin primes which could not have been proven without the recent fantastic…

Number Theory · Mathematics 2013-05-28 Janos Pintz

We demonstrate $k+1$-term arithmetic progressions in certain subsets of the real line whose "higher-order Fourier dimension" is sufficiently close to 1. This Fourier dimension, introduced in previous work, is a higher-order (in the sense of…

Classical Analysis and ODEs · Mathematics 2015-01-20 Marc Carnovale

We characterize the fixed sets of automorphisms of an arbitrary countable, arithmetically saturated structure.

Logic · Mathematics 2026-05-21 James Schmerl