English
Related papers

Related papers: Arithmetic progressions in middle Nth cantor sets

200 papers

In this paper we give a very elementary proof that if A and B are subsets of {1,2,...,N}, each having at least 5N^{1 - (4(k-1))^{-1}} elements, then the sumset A+B has a k-term arithmetic progression.

Number Theory · Mathematics 2007-05-23 Ernie Croot

We prove that for any function $f$ satisfying certain mild conditions and any Cantor set $K$ with Newhouse thickness greater than $1$, there exists $x\in K$ and $t>0$ such that \[ \{x-t,x,x+f(t)\}\subset K. \] This is an extension of…

Classical Analysis and ODEs · Mathematics 2026-01-23 Alex McDonald , Micah Nguyen

We describe some of the machinery behind recent progress in establishing infinitely many arithmetic progressions of length $k$ in various sets of integers, in particular in arbitrary dense subsets of the integers, and in the primes.

Number Theory · Mathematics 2007-05-23 Terence Tao

A class of subharmonic functions represented by the modified kernels are proved to have the growth estimates u(x) =o(x_{n}^{1-alpha}|x|^{m+alpha})at infinity in the upper half space of Rn, which generalizes the growth properties of analytic…

Functional Analysis · Mathematics 2008-11-14 Pan Guoshuang , Deng Guantie

In this paper, we study a class of Cantor-integers $\{C_n\}_{n\geq 1}$ with the base conversion function $f:\{0,\dots,m\}\to \{0,\dots,p\}$ being strictly increasing and satisfying $f(0)=0$ and $f(m)=p$. Firstly we provide an algorithm to…

Number Theory · Mathematics 2022-11-03 Jin Chen , Xin-Yu Wang

We show that there exists a positive constant C such that the following holds: Given an infinite arithmetic progression A of real numbers and a sufficiently large integer n (depending on A), there needs at least Cn geometric progressions to…

Number Theory · Mathematics 2014-09-18 Carlo Sanna

One of the central problems in additive combinatorics is to determine how large a subset of the first $N$ integers can be before it is forced to contain $k$ elements forming an arithmetic progression. Around 25 years ago, Gowers proved the…

Number Theory · Mathematics 2025-09-30 Sarah Peluse

We study arithmetic progressions $\{a,a+b,a+2b,\dots,a+(\ell-1) b\}$, with $\ell\ge 3$, in random subsets of the initial segment of natural numbers $[n]:=\{1,2,\dots, n\}$. Given $p\in[0,1]$ we denote by $[n]_p$ the random subset of $[n]$…

Probability · Mathematics 2019-02-13 Yacine Barhoumi-Andréani , Christoph Koch , Hong Liu

Let F be a fixed finite field of characteristic at least 5. Let G = F^n be the n-dimensional vector space over F, and write N := |G|. We show that if A is a subset of G with size at least c_F N(log N)^{-c}, for some absolute constant c > 0…

Combinatorics · Mathematics 2014-02-26 Ben Green , Terence Tao

The questions of the measure and finding open intervals in certain sets of sums and products of elements of the middle third Cantor set (or a variant of it), have generated considerable interest recently. A broad general framework that…

Metric Geometry · Mathematics 2023-07-19 Aritro Pathak

We answer a number of questions of Erd\H{o}s on the existence of arithmetic progressions in $k$-full numbers (i.e. integers with the property that every prime divisor necessarily occurs to at least the $k$-th power). Further, we deduce a…

Number Theory · Mathematics 2023-02-08 Prajeet Bajpai , Michael A. Bennett , Tsz Ho Chan

The main result of the paper is that assuming that the level $\theta$ of distribution of primes exceeds 1/2, then there exists a positive $d\leq C(\theta)$ such that there are arbitrarily long arithmetic progressions with the property that…

Number Theory · Mathematics 2010-02-16 Janos Pintz

Let A \subseteq [1,..,N]^2 be a set of cardinality at least N^2/(log log N)^c, where c>0 is an absolute constant. We prove that A contains a triple {(k,m), (k+d,m), (k,m+d)}, where d>0. This theorem is a two-dimensional generalization of…

Number Theory · Mathematics 2007-05-23 I. D. Shkredov

We show that the hereditary discrepancy of homogeneous arithmetic progressions is lower bounded by $n^{1/O(\log \log n)}$. This bound is tight up to the constant in the exponent. Our lower bound goes via proving an exponential lower bound…

Combinatorics · Mathematics 2015-04-10 Aleksandar Nikolov , Kunal Talwar

We study the set of lengths of the horizontal chords of a continuous function. We give a new proof of Hopf's characterization of this set, and show that it implies that no matter which function we choose, at least half of the possible…

General Mathematics · Mathematics 2023-05-26 Diana Davis , Serge Troubetzkoy

We study a Dirichlet series in two variables which counts primitive three-term arithmetic progressions of squares. We show that this multiple Dirichlet series has meromorphic continuation to $\mathbb{C}^2$ and use Tauberian methods to…

Number Theory · Mathematics 2025-07-28 Thomas A. Hulse , Chan Ieong Kuan , David Lowry-Duda , Alexander Walker

We are looking for integer sets that resemble classical Cantor set and investigate the structure of their sum sets. Especially we investigate $FS(B)$ the subset sum of sequence type $B=\{\lfloor p^n\alpha\rfloor\}^\infty_{n=0}$. When $p=2$,…

Combinatorics · Mathematics 2023-07-17 Norbert Hegyvári

In this paper we study the existence of higher dimensional arithmetic progression in Meyer sets. We show that the case when the ratios are linearly dependent over $\ZZ$ is trivial, and focus on arithmetic progressions for which the ratios…

Number Theory · Mathematics 2023-10-30 Anna Klick , Nicolae Strungaru

In this article we study Cantor sets defined by monotone sequences, in the sense of Besicovitch and Taylor. We classify these Cantor sets in terms of their h-Hausdorff and h-Packing measures, for the family of dimension functions h, and…

Classical Analysis and ODEs · Mathematics 2010-04-13 Carlos A. Cabrelli , Kathryn E. Hare , Ursula M. Molter

Let $A_1$ and $A_2$ be randomly chosen subsets of the first $n$ integers of cardinalities $s_2\geq s_1 = \Omega(s_2)$, such that their sumset $A_1+A_2$ has size $m$. We show that asymptotically almost surely $A_1$ and $A_2$ are almost fully…

Combinatorics · Mathematics 2023-01-31 Marcelo Campos , Matthew Coulson , Oriol Serra , Maximilian Wötzel
‹ Prev 1 3 4 5 6 7 10 Next ›