English
Related papers

Related papers: Arithmetic Progressions with Restricted Digits

200 papers

Let $G$ be a multiplicative subgroup of the prime field $\mathbb F_p$ of size $|G|> p^{1-\kappa}$ and $r$ an arbitrarily fixed positive integer. Assuming $\kappa=\kappa(r)>0$ and $p$ large enough, it is shown that any proportional subset…

Number Theory · Mathematics 2016-11-21 Mei-Chu Chang

We study parallel algorithms for addition of numbers having finite representation in a positional numeration system defined by a base $\beta$ in $\mathbb{C}$ and a finite digit set $\mathcal{A}$ of contiguous integers containing $0$. For a…

Number Theory · Mathematics 2016-10-27 Christiane Frougny , Edita Pelantova , Milena Svobodova

Let $b \geq 2$ be an integer, and write the base $b$ expansion of any non-negative integer $n$ as $n=x_0+x_1b+\dots+ x_{d}b^{d}$, with $x_d>0$ and $ 0 \leq x_i < b$ for $i=0,\dots,d$. Let $\phi(x)$ denote an integer polynomial such that…

Number Theory · Mathematics 2021-06-01 Dino Lorenzini , Mentzelos Melistas , Arvind Suresh , Makoto Suwama , Haiyang Wang

We consider a problem concerning the distribution of points with missing digits coordinates that are close to non-degenerate analytic submanifolds. We show that large enough (to be specified in the paper) sets of points with missing digits…

Number Theory · Mathematics 2023-09-04 Han Yu

We prove that if a set is `large' in the sense of Erd\H{o}s, then it approximates arbitrarily long arithmetic progressions in a strong quantitative sense. More specifically, expressing the error in the approximation in terms of the gap…

Metric Geometry · Mathematics 2019-05-14 Jonathan M. Fraser , Han Yu

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

A geometric-arithmetic progression of primes is a set of $k$ primes (denoted by GAP-$k$) of the form $p_1 r^j + j d$ for fixed $p_1$, $r$ and $d$ and consecutive $j$, {\it i.e}, $\{p_1, \, p_1 r + d, \, p_1 r^2 + 2 d, \, p_1 r^3 + 3 d,…

Number Theory · Mathematics 2017-02-15 Sameen Ahmed Khan

We provide upper bounds on the density of a symmetric generalized arithmetic progression lacking nonzero elements of the form h(n) for natural numbers n, or h(p) with p prime, for appropriate polynomials h with integer coefficients. The…

Number Theory · Mathematics 2015-07-10 Ernie Croot , Neil Lyall , Alex Rice

We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…

Combinatorics · Mathematics 2021-07-01 Imre Ruzsa , Jozsef Solymosi

Estimating the discrepancy of the hypergraph of all arithmetic progressions in the set $[N]=\{1,2,\hdots,N\}$ was one of the famous open problems in combinatorial discrepancy theory for a long time. An extension of this classical hypergraph…

Number Theory · Mathematics 2007-05-23 Nils Hebbinghaus

For fixed integers $b\geq k$, the problem of perfect $(b,k)$-hashing asks for the asymptotic growth of largest subsets of $\{1,2,\ldots,b\}^n$ such that for any $k$ distinct elements in the set, there is a coordinate where they all differ.…

Information Theory · Computer Science 2021-01-27 Stefano Della Fiore , Simone Costa , Marco Dalai

This paper focuses on greedy expansions, one possible representation of numbers, and on arithmetical operations with them. Performing addition or multiplication some additional digits can appear. We study bounds on the number of such digits…

Number Theory · Mathematics 2022-12-16 Magdaléna Tinková

In its usual form, Freiman's 3k-4 theorem states that if A and B are subsets of the integers of size k with small sumset (of size close to 2k) then they are very close to arithmetic progressions. Our aim in this paper is to strengthen this…

Combinatorics · Mathematics 2022-04-22 Bela Bollobas , Imre Leader , Marius Tiba

An augmented generalized happy function $S_{[c,b]}$ maps a positive integer to the sum of the squares of its base $b$ digits plus $c$. For $b\geq 2$ and $k \in \mathbb{Z}^+$, a $k$-desert base $b$ is a set of $k$ consecutive non-negative…

Number Theory · Mathematics 2019-08-07 Breeanne Baker Swart , Susan Crook , Helen G. Grundman , Laura Hall-Seelig , May Mei , Laurie Zack

Let H stand for the set of homeomorphisms on [0,1]. We prove the following dichotomy for Borel subsets A of [0,1]: either there exists a homeomorphism f in H such that the image f(A) contains no 3-term arithmetic progressions; or, for every…

Dynamical Systems · Mathematics 2013-03-20 Michael Boshernitzan , Jon Chaika

Let S be an infinite set of non-empty, finite subsets of the nonnegative integers. If p is an odd prime, let c(p) denote the cardinality of the set {T {\in} S : T {\subseteq} {1,...,p-1} and T is a set of quadratic residues (respectively,…

Number Theory · Mathematics 2016-07-29 Steve Wright

Using the algebraic structure of the Stone-Cech compactification of the integers, Furstenberg and Glasner proved that for arbitrary k, every piecewise syndetic set contains a piecewise syndetic set of k-term arithmetic progressions. We…

Combinatorics · Mathematics 2008-09-11 Mathias Beiglboeck

I show that a trivial modification of a standard proof of the Roth's Theorem on triples in arithmetic progression would lead to the following Theorem: If A is a "large set" that is its elements are monotone increasing integers and the sum…

Number Theory · Mathematics 2014-04-08 Gabor Korvin

We study the following generalization of Roth's theorem for 3-term arithmetic progressions. For s>1, define a nontrivial s-configuration to be a set of s(s+1)/2 integers consisting of s distinct integers x_1,...,x_s as well as all the…

Combinatorics · Mathematics 2013-09-04 Xuancheng Shao

Assuming the well-known conjecture that [x,x+x^t] contains a prime for t > 0 and x sufficiently large, we prove: For 0 < r < 1, there exists 0 < s < r < 1, 0 < d < 1, and infinitely many primes q such that if S is a subset of Z/qZ having…

Number Theory · Mathematics 2007-05-23 Ernie Croot
‹ Prev 1 4 5 6 7 8 10 Next ›