相关论文: Improving the $\frac{1}{3}-\frac{2}{3}$ Conjecture…

We study two popular ways to sketch the shortest path distances of an input graph. The first is distance preservers, which are sparse subgraphs that agree with the distances of the original graph on a given set of demand pairs. Prior work…

We prove a lower bound on the eigenvalues $\lambda_k$, $k\in\mathbb{N}$, of the Dirichlet Laplacian of a bounded domain $\Omega\subset\mathbb{R}^n$ of volume $V$: $$ \lambda_k \geq C_n\bigg( \delta\frac{k}{V}\bigg)^{2/n} $$ where $\delta$…

The distinct dot products problem, a variant of the Erd\H{o}s distinct distances problem, asks "Given a set $P_n$ of $n$ points in $\mathbb{R}^2$, what is the minimum number $|D(P_n)|$ of distinct dot products they determine?" The best…

In this paper, among other results, we improve the best known estimates for the constants of the generalized Bohnenblust-Hille inequality. These enhancements are then used to improve the best known constants of the Hardy--Littlewood…

We show that height $h$ posets that have planar cover graphs have dimension $\mathcal{O}(h^6)$. Previously, the best upper bound was $2^{\mathcal{O}(h^3)}$. Planarity plays a key role in our arguments, since there are posets such that (1)…

Consider the Delaunay triangulation T of a set P of points in the plane as a Euclidean graph, in which the weight of every edge is its length. It has long been conjectured that the dilation in T of any pair p, p \in P, which is the ratio of…

For a field $\mathbb{F}$ and integers $d$ and $k$, a set of vectors of $\mathbb{F}^d$ is called $k$-nearly orthogonal if its members are non-self-orthogonal and every $k+1$ of them include an orthogonal pair. We prove that for every prime…

The main goal of this paper is to provide an alternative proof of the following theorem of Petty: in the normed space of dimension at least three, every 3-element equilateral set can be extended to a 4-element equilateral set. Our approach…

For every hyperplane $H$ supporting a convex body $C$ in the hyperbolic space $\mathbb{H}^d$ we define the width of $C$ determined by $H$ as the distance between $H$ and a most distant ultraparallel hyperplane supporting $C$. We prove that…

The Betke-Henk-Wills conjecture proposes a sharp upper bound for the lattice point enumerator $G(K, \Lambda)$ of a convex body in terms of its successive minima. While the conjecture remains open for general convex bodies in dimensions $d…

Given a finite poset $\mathcal{P}$, a family $\mathcal{F}$ of elements in the Boolean lattice is induced-$\mathcal{P}$-saturated if $\mathcal{F}$ contains no copy of $\mathcal{P}$ as an induced subposet but every proper superset of…

A stochastic PDE, describing mesoscopic fluctuations in systems of weakly interacting inertial particles of finite volume, is proposed and analysed in any finite dimension $d\in\mathbb{N}$. It is a regularised and inertial version of the…

Let $\beta\in(1,2)$ and let $H_\beta$ denote Garsia's entropy for the Bernoulli convolution $\mu_\beta$ associated with $\beta$. In the present paper we show that $H_\beta>0.82$ for all $\beta \in (1, 2)$ and improve this bound for certain…

We consider the problem of minimizing a fixed-degree polynomial over the standard simplex. This problem is well known to be NP-hard, since it contains the maximum stable set problem in combinatorial optimization as a special case. In this…

Gilmer has recently shown that in any nonempty union-closed family $\mathcal F$ of subsets of a finite set, there exists an element contained in at least a proportion $.01$ of the sets of $\mathcal F$. We improve the proportion from $.01$…

We consider weak solutions to a class of Dirichlet boundary value problems invloving the $p$-Laplace operator, and prove that the second weak derivatives are in $L^{q}$ with $q$ as large as it is desirable, provided $p$ is sufficiently…

We study the problem of $2$-dimensional orthogonal range counting with additive error. Given a set $P$ of $n$ points drawn from an $n\times n$ grid and an error parameter $\eps$, the goal is to build a data structure, such that for any…

By analogy with conjectures for random matrices, Fyodorov-Hiary-Keating and Fyodorov-Keating proposed precise asymptotics for the maximum of the Riemann zeta function in a typical short interval on the critical line. In this paper, we…

For a tuple $T$ of Hilbert space operators, the 'commuting dilation constant' is the smallest number $c$ such that the operators of $T$ are a simultaneous compression of commuting normal operators of norm at most $c$. We present numerical…

Probabilistic proofs of the Johnson-Lindenstrauss lemma imply that random projection can reduce the dimension of a data set and approximately preserve pairwise distances. If a distance being approximately preserved is called a success, and…