Related papers: On the Erd\H{o}s distance problem

In this paper, we study the distance problem in the setting of finite p-adic rings. In odd dimensions, our results are essentially sharp. In even dimensions, we clarify the conjecture and provide examples to support it. Surprisingly,…

An influential result by Dor, Halperin, and Zwick (FOCS 1996, SICOMP 2000) implies an algorithm that can compute approximate shortest paths for all vertex pairs in $\tilde{O}(n^{2+O\left(\frac{1}{k}\right )})$ time, ensuring that the output…

The purpose of this paper is to solve the two conjectures on the largest minimum distance $d_{so}(n,5)$ of a binary self-orthogonal $[n,5]$ code proposed by Kim and Choi (IEEE Trans. Inf. Theory, 2022). The determination of $d_{so}(n,k)$…

Given $E \subseteq \mathbb{F}_q^d \times \mathbb{F}_q^d$, with the finite field $\mathbb{F}_q$ of order $q$ and the integer $d \ge 2$, we define the two-parameter distance set as $\Delta_{d, d}(E)=\left\{\left(\|x_1-y_1\|,…

We analyze two algorithms for approximating the general optimal transport (OT) distance between two discrete distributions of size $n$, up to accuracy $\varepsilon$. For the first algorithm, which is based on the celebrated Sinkhorn's…

The purpose of this paper is twofold. First, we provide an optimal $\Omega(\sqrt{n})$ bits lower bound for any two-way protocol for the Vector in Subspace Communication Problem which is of bounded total rank. This result complements Raz's…

We provide a reformulation of the hyperplane conjecture (the slicing problem) in terms of the floating body and give upper and lower bounds on the logarithmic Hausdorff distance between an arbitrary convex body $K\subset \mathbb{R}^{d}$\…

Given $m \in \mathbb{N} \setminus \{0\}$ and $\rho > 0$, we find solutions $(\lambda,u)$ to the problem \begin{equation*} \begin{cases} \bigl(-\frac{\mathrm{d}^2}{\mathrm{d} x^2}\bigr)^m u + \lambda G'(u) = F'(u)\\ \int_{\mathbb{R}} K(u) \,…

Fix an integer $r\ge2$. For each $n$ we consider families $\mathcal F\subseteq 2^{[n]}$ that form an antichain and have the property that, for every $t$, if there exists $A\in\mathcal F$ with $|A|=t$ then there exist at least $r$ members of…

As a variant of the celebrated Szemer\'edi--Trotter theorem, Guth and Katz proved that $m$ points and $n$ lines in $\mathbb{R}^3$ with at most $\sqrt{n}$ lines in a common plane must determine at most $O(m^{1/2}n^{3/4})$ incidences for…

Recently, Gilmer proved the first constant lower bound for the union-closed sets conjecture via an information-theoretic argument. The heart of the argument is an entropic inequality involving the OR function of two i.i.d.\ binary vectors,…

We prove the uniform boundedness of all solutions for a general class of Dirichlet anisotropic elliptic problems of the form $$-\Delta_{\overrightarrow{p}}u+\Phi_0(u,\nabla u)=\Psi(u,\nabla u) +f $$ on a bounded open subset $\Omega\subset…

Let $g:\mathbb{N}\to\{-1,1\}$ be a completely multiplicative function, $\mu$ be the M\"obius function and $\mu_2^2(n)$ be the indicator that $n$ is cubefree. We prove that $f=\mu^2g$ and $f=\mu_2^2g$ have unbounded partial sums. Our proofs…

We show that every set $A$ of natural numbers with positive upper density can be shifted to contain the restricted sumset $\{b_1 + b_2 : b_1, b_2\in B \text{ and } b_1 \neq b_2 \}$ for some infinite set $B \subset A$.

An old question posed by Erd\H{o}s asked whether there exists a set of $n$ points such that $c \cdot n$ distances occur more than $n$ times. We provide an affirmative answer to this question, showing that there exists a set of $n$ points…

We show the existence and uniqueness as well as boundedness of weak solutions to linear elliptic equations with $L^2$-drifts of negative divergence and singular zero-order terms which are positive. Our main target is to show the…

For $d\geq 2$ and any norm on $\mathbb R^d$, we prove that there exists a set of $n$ points that spans at least $(\tfrac d2-o(1))n\log_2n$ unit distances under this norm for every $n$. This matches the upper bound recently proved by Alon,…

We study distributed convex optimization with two ubiquitous forms of coupling: consensus constraints and global affine equalities. We first design a linearized method of multipliers for the consensus optimization problem. Without…

Given $k$-uniform hypergraphs $G$ and $H$ on $n$ vertices with densities $p$ and $q$, their relative discrepancy is defined as $\hbox{disc}(G,H)=\max\big||E(G')\cap E(H')|-pq\binom{n}{k}\big|$, where the maximum ranges over all pairs…

We report the finding of the new upper bound on the lowest positive integer $x$ for which the Mertens conjecture \begin{equation*} \left| \sum_{1 \leq n \leq x} \mu(n) \right| < \sqrt{x} \end{equation*} fails to hold: $x < \exp(1.017 \times…