We show that for every fixed $\varepsilon>0$, there exist arbitrarily large families of point-line pairs $(x_1,\ell_1),\ldots,(x_n,\ell_n)$ in $[0,1]^2$, with $x_i \in \ell_i$ for all $i$, and such that $\operatorname{dist}(x_i,\ell_j)\ge n^{-2/3-\varepsilon}$ for all $i \neq j$. Combined with a previous result of Cohen, the author, and Zakharov, this solves the minimal distance problem. The same construction also comes with an unexpected finite field consequence: for every $\varepsilon>0$, there exists a set of primes $q$ of positive relative density for which $\mathbb F_q^2$ contains an induced point-line matching of size $\gtrsim q^{3/2-\varepsilon}$. This disproves a conjecture of Hunter, the author, Verstra\"ete and Zhang.
Let $P (Y_1, ..., Y_d)$ be a certain fixed homogeneous polynomial of integral coefficients. In this paper, we establish a quantitative equidistribution criterion for the ergodic averages along $\Omega (|P (n_1, ..., n_d)|)$. Consequently, by an estimate of Lachand, we prove the following variant of a theorem of Bergelson and Richter: if $P$ is an irreducible binary cubic form and $ (X, T)$ is a uniquely ergodic system with unique invariant measure $\mu$, then for any $x \in X$ and $f \in C(X)$, \begin{equation*} \lim_{N \rightarrow \infty} \frac 1 {N^2} {\mathop{\sum\sum}_{n_1, n_2 \leqslant N}} f \big( T^{ \Omega (|P (n_1, n_2)| ) } x \big) = \int_{X} f \ \mathrm{d} \mu . \end{equation*} Moreover, we prove in the appendix a related conjecture of C\'espedes and Donoso over number fields.
Let $C_n$ be the optimal constant with the following property. For every even, continuous, strictly positive density $f$ on $R^n$ and all origin-symmetric convex bodies $K,L\subset R^n$, the inequalities $$ \int_{K\cap\xi^\perp}f \leq \int_{L\cap\xi^\perp}f \qquad\text{for all }\xi\in S^{n-1} $$ imply $\int_Kf\leq C_n\int_Lf$. In an earlier paper the authors proved that $C_n\leq\sqrt n$. In this paper, we prove the matching lower bound $C_n\geq c\sqrt n$. To simplify the exposition, we first give a complete one-scale construction, based on earlier work of Klartag and Koldobsky, which yields $C_n\geq c\sqrt{n/\log n}$. For the sharp result, we use the random-rounding construction of Klartag and Livshyts as a black box and combine it with a spherical-averaging support-separation argument.
A subset $A\subseteq \mathbb N_0$ is $k$-AP covering if there exists a constant $n_0$ such that for every integer $x>n_0$, there exists $d\in\mathbb N_0$ such that $x-d, x-2d,\dots,x-(k-1)d$ are all in $A$. Disproving a conjecture of Kiss, S\'andor, and Yang, we prove that for every integer $k\geq 6$, there exists a constant $\varepsilon=\varepsilon_k>0$ and a $k$-AP covering set $A$ such that $|A\cap \{0,1,\dots,n\}|<n^{\frac{k-2}{k-1}-\varepsilon}$ for all sufficiently large $n$. We also relate this problem to the Arithmetic Kakeya Conjecture by Katz and Tao.
The uniform Littlewood conjecture (ULC), introduced by Bandi, Fregoli and Kleinbock, asserts in the two-number case that $$ \lim_{Q\to\infty} Q\min_{1\le n\le Q}\|n\xi\|\,\|n\zeta\|=0 $$ for all real $\xi,\zeta$. It is proven to hold for almost every pair $(\xi,\zeta)$. Schleischitz, however, has recently disproved the full statement and showed that the set of counterexamples contains a dense $G_\delta$ set. We prove that a set of counterexample pairs with the first coordinate being a badly approximable number has Hausdorff dimension at least $3/2$. We further show that the set of badly approximable numbers $\xi$ for which there exists $\zeta$ such that $(\xi,\zeta)$ is a counterexample to ULC has full Hausdorff dimension. This contrasts with the classical Littlewood conjecture, for which the set of possible counterexamples is known to have Hausdorff dimension $0$.
Let $\mu$ be a log-concave probability measure on $\mathbb R^n$ and let $f\colon\mathbb R^n\to\mathbb R^k$ be a polynomial mapping of degree at most $d$. We show that \[ \mu(f\in A) \le C\bigl(\lambda_k(A)\bigr)^{\frac{1}{k(d-1)+1}} \] for every Borel set $A\subset\mathbb R^k$ whenever the image measure $\mu\circ f^{-1}$ is absolutely continuous. The constant $C$ is independent of the dimension $n$, and the exponent $\frac{1}{k(d-1)+1}$ is sharp. This extends the scalar Carbery--Wright inequality and answers, in the log-concave setting, a question raised by Avni, Glazer, and Larsen. In addition, we show that the density of $\mu\circ f^{-1}$, whenever it exists, belongs to the Nikolskii--Besov space $B^{\frac{1}{k(d-1)+1}}_{1,\infty}(\mathbb R^k)$, with a dimension-free bound for the corresponding norm. A central difficulty in passing from scalar polynomials to vector-valued polynomial mappings is the lack of a suitable nondegeneracy parameter quantifying absolute continuity of $\mu\circ f^{-1}$, as the variance does in the scalar case. Natural candidates such as the covariance matrix or the Jacobian matrix either fail to characterize this property or do not lead to dimension-free estimates. We identify such a parameter and define it to be the covariance matrix of the vector formed by the monomials of degree up to $d^{k-1}$ in the normalized components of $f$. The dimension-free nature of our results allows us to extend Kusuoka's absolute continuity criterion for Gaussian polynomial random vectors to the log-concave setting. Moreover, in this setting, we obtain estimates relating convergence in distribution to convergence in total variation for polynomial random vectors.
We prove, for all fixed $0<\delta<1$, and all sufficiently large $n$, that there exists $S \subset [n]$ with $|S| \ge \delta n$ such that $A + B \not \subset S$ for all ${A, B \subset \mathbb{N}}$ satisfying $$\min\big\{|A|, |B|\big\} \ge \big(3 + o(1)\big) \frac{\log n }{ \log (1 / \delta)}.$$ A very recent result of Hern\'andez and Hetzel shows that our bound is sharp up to a factor of 3, and together our results settle a conjecture of Kra, Moreira, Richter, and Robertson. In fact, we prove that a $\delta$-dense random subset of $[n]$ is a valid choice for $S$ with high probability, and that one can take $n^{-\alpha} \le \delta \le 1 - c$ where $c>0$ is fixed and $\alpha>0$ depends only on the $o(1)$ error, answering another question of the same authors in a strong form.
Gabriel Dahia, João Pedro Marciano, Victor Souza· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
