Related papers: Gaps in Multiplicative Sidon Sets

A celebrated result of Gowers states that for every \epsilon > 0 there is a graph G so that every \epsilon-regular partition of G (in the sense of Szemeredi's regularity lemma) has order given by a tower of exponents of height polynomial in…

We give asymptotic sharp estimates for the cardinality of a set of residue classes with the property that the representation function is bounded by a prescribed number. We then use this to obtain an analogous result for sets of integers,…

For a subset $A \subseteq [N]$, we define the representation function $ r_{A-A}(d) := \#\{(a,a') \in A \times A : d = a - a'\}$ and define $M_D(A) := \max_{1 \leq d < D} r_{A-A}(d)$ for $D>1$. We study the smallest possible value of…

For a positive integer $n>1$ denote by $\omega(n)$ the maximal possible number $k$ of different functions $f_1,\dots,f_k:\mathbb{Z}/n\mathbb{Z}\mapsto \mathbb{Z}/n\mathbb{Z}$ such that each function $f_i-f_j,i<j$, is bijective. Recently A.…

Let $\varepsilon >0$. Let $f$ be a Steinhaus or Rademacher random multiplicative function. We prove that we have almost surely, as $x \to +\infty$, $$ \sum_{n \leqslant x} f(n) \ll \sqrt{x} (\log_2 x)^{\frac{3}{4}+ \varepsilon}. $$

We describe an infinite family of graphs $G_n$, where $G_n$ has $n$ vertices, independence number at least $n/4$, and no set of less than $\sqrt{n}/2$ vertices intersects all its maximum independent sets. This is motivated by a question of…

In this paper we study various Rogers-Shephard type inequalities for the lattice point enumerator $\mathrm{G}_{n}(\cdot)$ on $\mathbb{R}^n$. In particular, for any non-empty convex bounded sets $K,L\subset\mathbb{R}^n$, we show that…

Hardy and Littlewood conjectured that every large integer $n$ that is not a square is the sum of a prime and a square. They believed that the number $\mathcal{R}(n)$ of such representations for $n = p+m^2$ is asymptotically given by…

The irregularity strength of a graph $G$, $s(G)$, is the least $k$ admitting a $\{1,2,\ldots,k\}$-weighting of the edges of $G$ assuring distinct weighted degrees of all vertices, or equivalently the least possible maximal edge multiplicity…

Let $G$ be a connected graph on $n$ vertices. The Gallai number $Gal(G)$ of $G$ is the size of the smallest set of vertices that meets every maximum path in $G$. Gr\"unbaum constructed a graph $G$ with $Gal(G)=3$. Very recently, Long,…

For a natural number $N\geq 2$ and a real $\alpha$ such that $0 < \alpha \leq \sqrt{N}-1$, we define $I_\alpha:=[\alpha,\alpha+1]$ and $I_\alpha^-:=[\alpha,\alpha+1)$ and investigate the continued fraction map $T_\alpha:I_\alpha \to…

We prove that every $n$-point metric space of negative type (and, in particular, every $n$-point subset of $L_1$) embeds into a Euclidean space with distortion $O(\sqrt{\log n} \cdot\log \log n)$, a result which is tight up to the iterated…

Suppose $\left\{x_1, \dots, x_n\right\} \subset \mathbb{R}^2$ is a set of $n$ points in the plane with diameter $\leq 1$, meaning $|x_i - x_j| \leq 1$ for all $1 \leq i,j \leq n$. We show that the ratio of the number of ``neighbors''…

Let $ \Pi(n) $ be the largest number such that for every set $ S $ of $ n $ points in a polygon~$ P $, there always exist two points $ x, y \in S $, where every geodesic disk containing $ x $ and $ y $ contains $ \Pi(n) $ points of~$ S $.…

In this paper, we prove that an $n\times n$ matrix $A$ with independent centered subgaussian entries satisfies \[ s_{n+1-l}(A) \le C_1t \frac{l}{\sqrt{n}} \] with probability at least $1-\exp(-C_2tl)$. This yields $s_{n-l}(A) \sim…

Let $p(x)=a_0 + a_1 x + \ldots + a_n x^n$ be a polynomial with all roots real and satisfying $x \leq -\delta$ for some $0<\delta <1$. We show that for any $0 < \epsilon <1$, the value of $p(1)$ is determined within relative error $\epsilon$…

Assuming Lang's conjectured lower bound on the heights of non-torsion points on an elliptic curve, we show that there exists an absolute constant C such that for any elliptic curve E/Q and non-torsion point P in E(Q), there is at most one…

Let $G$ be a graph on $n$ vertices, independence number $\alpha(G)$, Lov\'asz theta function $\vartheta(G)$, and Shannon capacity $\Theta(G)$. We define $n_{\ge0}(G)$ to be the minimum number of non-negative eigenvalues taken over all…

We introduce a refinement of the GPY sieve method for studying prime $k$-tuples and small gaps between primes. This refinement avoids previous limitations of the method, and allows us to show that for each $k$, the prime $k$-tuples…

Let $f$ be a Rademacher or a Steinhaus random multiplicative function. Let $\varepsilon>0$ small. We prove that, as $x\rightarrow +\infty$, we almost surely have $$\bigg|\sum_{\substack{n\leq x\\…