English
Related papers

Related papers: On the discretized sum-product problem

200 papers

We present a new random approximation method that yields the existence of a discrete Beurling prime system $\mathcal{P}=\{p_{1}, p_{2}, \dotso\}$ which is very close in a certain precise sense to a given non-decreasing, right-continuous,…

Number Theory · Mathematics 2024-09-24 Frederik Broucke , Jasson Vindas

Let $A,B \subset \mathbb{R}$ be closed Ahlfors-regular sets with dimensions $\dim_{\mathrm{H}} A =: \alpha$ and $\dim_{\mathrm{H}} B =: \beta$. I prove that $$\dim_{\mathrm{H}} [A + \theta B] \geq \alpha + \beta \cdot \tfrac{1 - \alpha}{2 -…

Classical Analysis and ODEs · Mathematics 2021-11-30 Tuomas Orponen

The Erd\H{o}s discrepancy problem, now a theorem by T. Tao, asks whether every sequence with values plus or minus one has unbounded discrepancy along all homogeneous arithmetic progressions. We establish weighted variants of this problem,…

Number Theory · Mathematics 2020-07-16 Nikos Frantzikinakis

We study the extent to which divisors of a typical integer $n$ are concentrated. In particular, defining the Erd\H{o}s-Hooley $\Delta$-function by $\Delta(n) := \max_t \# \{d | n, \log d \in [t,t+1]\}$, we show that $\Delta(n) \geq (\log…

Number Theory · Mathematics 2023-11-01 Kevin Ford , Ben Green , Dimitris Koukoulopoulos

Let $\Delta(x)$ denote the error term in the classical Dirichlet divisor problem, and let the modified error term in the divisor problem be $\Delta^*(x) = -\Delta(x) + 2\Delta(2x) - \frac{1}{2}\Delta(4x)$. We show that $$…

Number Theory · Mathematics 2014-06-04 Aleksandar Ivic

A symmetric subset of the reals is one that remains invariant under some reflection z --> c-z. We consider, for any 0 < x <= 1, the largest real number D(x) such that every subset of $[0,1]$ with measure greater than x contains a symmetric…

Combinatorics · Mathematics 2010-03-04 Greg Martin , Kevin O'Bryant

Besides various asymptotic results on the concept of sum-product bases in $\mathbb{N}_0$, we consider by probabilistic arguments the existence of thin sets $A,A'$ of integers such that $AA+A=\mathbb{N}_0$ and $A'A'+A'A'=\mathbb{N}_0$.

Number Theory · Mathematics 2019-04-15 Francois Hennecart , Gyan Prakash , E. Pramod

Using a slight modification of an argument of Croot, Ruzsa and Schoen we establish a quantitative result on the existence of a dilated copy of any given configuration of integer points in sparse difference sets. More precisely, given any…

Number Theory · Mathematics 2010-04-19 Mariah Hamel , Neil Lyall , Katherine Thompson , Nathan Walters

We prove bounds for the number of solutions to $$a_1 + \dots + a_k = a_1' + \dots + a_k'$$ over $N$-element sets of reals, which are sufficiently convex or near-convex. A near-convex set will be the image of a set with small additive…

Number Theory · Mathematics 2021-04-26 Peter J. Bradshaw , Brandon Hanson , Misha Rudnev

For a base $b\geq 2$ and a set of digits $\mathcal{A}\subset \{0,...,b-1\}$, let $\mathcal{P}$ denote the set of prime numbers with digits restricted to $\mathcal{A}$, when written in base-$b$. We prove that if $A\subset \mathbb{N}$ has…

Number Theory · Mathematics 2025-10-16 Alex Burgin

Constructing a discretization of a given set is a major problem in various theoretical and applied disciplines. An offset discretization of a set $X$ is obtained by taking the integer points inside a closed neighborhood of $X$ of a certain…

Discrete Mathematics · Computer Science 2018-08-10 Boris Brimkov , Valentin E. Brimkov

We show that the Freiman--Ruzsa theorem, characterising finite sets with bounded doubling, leads to an alternative proof of a characterisation of Meyer sets, that is, relatively dense subsets of Euclidean spaces whose difference sets are…

Number Theory · Mathematics 2023-12-20 Jakub Konieczny

We establish two new direct product theorems for the randomized query complexity of Boolean functions. The first shows that computing $n$ copies of a function $f$, even with a small success probability of $\gamma^n$, requires $\Theta(n)$…

Computational Complexity · Computer Science 2025-12-10 Shalev Ben-David , Eric Blais

In this paper we show that if $A$ is a subset of Chen primes with positive relative density $\alpha$, then $A+A$ must have positive upper density at least $c\alpha e^{-c^\prime\log(1/\alpha)^{2/3}(\log\log(1/\alpha))^{1/3}}$ in the natural…

Number Theory · Mathematics 2012-06-13 Zhen Cui , Hongze Li , Boqing Xue

We show that, in every weighted Dirichlet space on the unit disk with superharmonic weight, the Taylor series of a function in the space is $(C,\alpha)$-summable to the function in the norm of the space, provided that $\alpha>1/2$. We…

Complex Variables · Mathematics 2020-09-28 Javad Mashreghi , Pierre-Olivier Parisé , Thomas Ransford

Let $d(n)$ be the number of divisors of $n$, let $$ \Delta(x) := \sum_{n\le x}d(n) - x(\log x + 2\gamma -1) $$ denote the error term in the classical Dirichlet divisor problem, and let $\zeta(s)$ denote the Riemann zeta-function. Several…

Number Theory · Mathematics 2016-11-16 Aleksandar Ivić

We prove two conjectures in this paper. The first conjecture is by Lund, Pham and Thu: Given a Borel set $A\subset \mathbb{R}^n$ such that $\dim A\in (k,k+1]$ for some $k\in\{1,\dots,n-1\}$. For $0<s<k$, we have \[ \text{dim}(\{y\in…

Classical Analysis and ODEs · Mathematics 2024-03-04 Paige Bright , Shengwen Gan

Erd\H{o}s and Graham proposed to determine the number of subsets $S \subseteq \left\{1,2,\dots,n\right\}$ with $\sum_{s \in S} 1/s = 1$ and asked, among other things, whether that number could be as large as $2^{n - o(n)}$. We show that the…

Combinatorics · Mathematics 2024-04-30 Stefan Steinerberger

Green, Tao and Ziegler prove ``Dense Model Theorems'' of the following form: if R is a (possibly very sparse) pseudorandom subset of set X, and D is a dense subset of R, then D may be modeled by a set M whose density inside X is…

Combinatorics · Mathematics 2008-06-04 Omer Reingold , Luca Trevisan , Madhur Tulsiani , Salil Vadhan

We study discrete orderings in the real spectrum of a commutative ring by defining discrete prime cones and give an algebro-geometric meaning to some kind of diophantine problems over discretely ordered rings. Also for a discretely ordered…

Logic · Mathematics 2019-03-12 Shahram Mohsenipour
‹ Prev 1 4 5 6 7 8 10 Next ›