Let $f(N)$ denote the largest size of a set $A\subseteq [N]=\{1,\ldots,N\}$ containing no distinct $a,b,c$ such that \[ \frac2a=\frac1b+\frac1c . \] We prove \[ f(N)\gg N\exp\!\left(-(2\sqrt{\log(24/7)}+o(1))\sqrt{\log\log N}\right). \] The construction filters the odd integers up to $N$ by a random affine image of a dense three-term-progression-free set in a prime field $\mathbb{F}_q$ with $q\asymp\log N$, and then deletes a controlled family of collapsed triples.
For $n\ge1$, let $F(n)$ be the least $H$ such that any $H$ consecutive integers contain $n$ pairwise distinct integers $a_1, a_2, \dots, a_n$ with $k \mid a_k$ for $1\le k\le n$, and define $h_{\mathbb P}(n)$ analogously for the primes at most $n$. We prove \[ F(n)\le n^{4/3}\exp\!\left(O\!\left(\frac{\log n}{\log\log...
Let $L$ be a fixed set of positive integers. A family $\mathcal{F}\subseteq 2^{[n]}$ is called $L$-differencing if $\lvert A\setminus B\rvert\in L$ for every ordered pair of distinct members $A,B\in\mathcal{F}$. A longstanding conjecture of Frankl, proposed in 1985, asserts that every $L$-differencing family has size a...
Let $\mu$ be the M\"obius function and $e(t)=e^{2\pi it}$. We prove that if $N\ge2$, $\alpha\in\mathbb{R}$, $(a,q)=1$, and $|\alpha-a/q|\le q^{-2}$, then \[\bigg|\sum_{n\le N}\mu^2(n)e(\alpha n)\bigg|\ll\left(\frac Nq+q\right)(\log 2N)^5, \] with an absolute implied constant, and we deduce the corresponding estimate on...
Nicolas Robles, Alexandru Zaharescu, Dirk Zeindler· 0 citations
For an odd prime $p$, let $m(p)$ be the minimum cardinality of a set $A\subseteq \mathbb Z/p\mathbb Z$, with $|A|\geq2$, such that no sum in $A+A$ has a unique representation as an unordered pair from $A$, with repetition allowed. Bedert proved \[ m(p)\gg \log p\, \frac{\sqrt{\log^{(3)}p}}{\log^{(4)}p}. \] We prove the...
Let $P=\{0,a,b\}$, where $0<a<b$ and $\gcd(a,b)=1$. For a finite set $A\subset\mathbb Z$, let $M_P^+(A)$ count the copies $x,x+ad,x+bd\in A$ with $d>0$, and let $M_P(A)$ count the copies with any $d\ne0$. We prove that every such three-point pattern other than the arithmetic progression $\{0,1,2\}$ satisfies \[ M_P^+(A...
Let $p$ be a prime, $d\ge 2$, $H\in [1,p)$, and $\ln\ln p = o(\ln H)$. We prove that $$ \min_{1\le n \le H} n \left\|\frac{a_1 n}{p}\right\|\ldots \left\|\frac{a_d n}{p}\right\| \approx \frac{1}{(\ln p)^{d-1} \ln H} $$ for"almost all"$a \in ({\Bbb Z} / p{\Bbb Z})^d$.
A. A. Illarionov· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
