English
Related papers

Related papers: Arithmetic progressions in sumsets and L^p-almost-…

200 papers

It was proved that whenever N is partitioned into finitely many cells, one cell must contain arbitrary length geo-arithmetic progressions. It was also proved that arithmetic and geometric progressions can be nicely intertwined in one cell…

Combinatorics · Mathematics 2017-03-07 Tanushree Biswas

We give a new $(1+\epsilon)$-approximation for sparsest cut problem on graphs where small sets expand significantly more than the sparsest cut (sets of size $n/r$ expand by a factor $\sqrt{\log n\log r}$ bigger, for some small $r$; this…

Data Structures and Algorithms · Computer Science 2013-04-12 Sanjeev Arora , Rong Ge , Ali Kemal Sinop

We give almost-linear-time algorithms for constructing sparsifiers with $n\ poly(\log n)$ edges that approximately preserve weighted $(\ell^{2}_2 + \ell^{p}_p)$ flow or voltage objectives on graphs. For flow objectives, this is the first…

Data Structures and Algorithms · Computer Science 2021-02-16 Deeksha Adil , Brian Bullins , Rasmus Kyng , Sushant Sachdeva

New asymptotic relations between the $L_p$-errors of best approximation of univariate functions by algebraic polynomials and entire functions of exponential type are obtained for $p\in (0,\iy]$. General asymptotic relations are applied to…

Classical Analysis and ODEs · Mathematics 2022-12-26 Michael I. Ganzburg

We show that if A is a subset of {1,...,N} contains no non-trivial three-term arithmetic progressions then |A|=O(N/ log^{1-o(1)} N). The approach is somewhat different from that used in arXiv:1007.5444.

Classical Analysis and ODEs · Mathematics 2012-12-04 Tom Sanders

We study the minimum number of heaps required to sort a random sequence using a generalization of Istrate and Bonchis's algorithm (2015). In a previous paper, the authors proved that the expected number of heaps grows logarithmically. In…

Probability · Mathematics 2017-02-22 Anne-Laure Basdevant , Arvind Singh

Given $m \in \mathbb{N}$ and a $p$-random subset $A \subseteq \mathbb{N}$, we asymptotically determine $\log \Pr(|\mathbb{N} \setminus (A + A)| \ge m)$ for $p$ above the threshold for this property. The proof is based on a bespoke container…

Combinatorics · Mathematics 2026-05-29 Rajko Nenadov , Lander Verlinde

We obtain asymptotic estimates for the best approximations by trigonometric polynomials in the metric space $C$ $(L_p)$ of classes of periodic functions that can be represented as a convolution of kernels $\Psi_\beta$, which Fourier…

Classical Analysis and ODEs · Mathematics 2012-12-11 A. S. Serdyuk , I. V. Sokolenko

The densities of small linear structures (such as arithmetic progressions) in subsets of Abelian groups can be expressed as certain analytic averages involving linear forms. Higher-order Fourier analysis examines such averages by…

Number Theory · Mathematics 2014-05-09 Hamed Hatami , Pooya Hatami , Shachar Lovett

According to a classical result of Szemer\'{e}di, every dense subset of $1,2,...,N$ contains an arbitrary long arithmetic progression, if $N$ is large enough. Its analogue in higher dimensions due to F\"urstenberg and Katznelson says that…

Combinatorics · Mathematics 2010-04-13 Adrian Dumitrescu

In this paper, we study the persistence approximation property for quantitative $K$-theory of filtered $L^p$ operator algebras. Moreover, we define quantitative assembly maps for $L^p$ operator algebras when $p\in [1,\infty)$. Finally, in…

Operator Algebras · Mathematics 2024-12-04 Hang Wang , Yanru Wang , Jianguo Zhang , Dapeng Zhou

Golomb's sequence is the unique nondecreasing sequence of positive integers in which each $n$ appears exactly $a(n)$ times. It satisfies the global self-referential rule \[ a\bigl(a(n)+a(n-1)+\cdots+a(1)\bigr)=n, \] grows smoothly like a…

Number Theory · Mathematics 2026-04-06 Benoit Cloitre

The culmination of the papers (arXiv:0905.0518, arXiv:0910.0909) was a proof of the norm convergence in $L^2(\mu)$ of the quadratic nonconventional ergodic averages \frac{1}{N}\sum_{n=1}^N(f_1\circ T_1^{n^2})(f_2\circ…

Dynamical Systems · Mathematics 2010-05-25 Tim Austin

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 prove non-trivial lower bounds for sums of type $\sum_{p\sim P}g(\gamma\Log p)$, where $g$ is a non-negative $2\pi$-periodical function and $\gamma$ is a given parameter. As an application we prove that $\zeta(1+it)^{\pm1}\ll\Log\Log…

Number Theory · Mathematics 2024-12-17 Olivier Ramaré

Let $A$ be a subset of the cyclic group $\mathbf{Z}/p\mathbf{Z}$ with $p$ prime. It is a well-studied problem to determine how small $|A|$ can be if there is no unique sum in $A+A$, meaning that for every two elements $a_1,a_2\in A$, there…

Combinatorics · Mathematics 2023-09-20 Benjamin Bedert

We determine a lower gap property for the growth of an unbounded \(\mathbb{Z}\)-valued \(k\)-regular sequence. In particular, if \(f:\mathbb{N}\to\mathbb{Z}\) is an unbounded \(k\)-regular sequence, we show that there is a constant \(c>0\)…

Number Theory · Mathematics 2014-10-22 Jason P. Bell , Michael Coons , Kevin G. Hare

Let N be the set all of non-negative integers, let A be a finite subset of N, and let (2A) be the set of all numbers of form a+b for each a and b in A. The arithmetic structure of A was accurately characterized by Freiman when (i)…

Number Theory · Mathematics 2007-05-23 Renling Jin

In 1946, Behrend gave a construction of dense finite sets of integers that do not contain 3-term arithmetic progressions. In 1961, Rankin generalized Behrend's construction to sets avoiding k-term arithmetic progressions, and in 2008 Elkin…

Number Theory · Mathematics 2010-06-22 Kevin O'Bryant

We study linearly edge-reinforced random walks on $\mathbb{Z}_+$, where each edge $\{x,x+1\}$ has the initial weight $x^{\alpha} \vee 1$, and each time an edge is traversed, its weight is increased by $\Delta$. It is known that the walk is…

Probability · Mathematics 2020-07-28 Masato Takei