Related papers: Finding Points in Convex Position in Density-Restr…

The Weber problem consists of finding a point in $\mathbbm{R}^n$ that minimizes the weighted sum of distances from $m$ points in $\mathbbm{R}^n$ that are not collinear. An application that motivated this problem is the optimal location of…

We show that the largest possible diameter $\delta(d,k)$ of a $d$-dimensional polytope whose vertices have integer coordinates ranging between $0$ and $k$ is at most $kd-\lceil2d/3\rceil$ when $k\geq3$. In addition, we show that…

We study fixed-points of scalar fields that transform in the bifundamental representation of $O(N)\times O(M)$ in $3-\epsilon$ dimensions, generalizing the classic tricritical sextic vector model. In the limit where $N$ is large but $M$ is…

The Tammes problem is to find the arrangement of N points on a unit sphere which maximizes the minimum distance between any two points. This problem is presently solved for several values of N, namely for N=3,4,6,12 by L. Fejes Toth (1943);…

For a constant $\gamma \in[0,1]$ and a graph $G$, let $\omega_{\gamma}(G)$ be the largest integer $k$ for which there exists a $k$-vertex subgraph of $G$ with at least $\gamma\binom{k}{2}$ edges. We show that if $0<p<\gamma<1$ then…

The rank of an $A$-hypergeometric $D$-module $M_A(\beta)$, associated with a full rank $(d\times n)$-matrix $A$ and a vector of parameters $\beta\in \mathbb{C}^d$, is known to be the normalized volume of $A$, denoted $\mathrm{vol}(A)$, when…

The second and fourth authors have conjectured that a certain hollow tetrahedron $\Delta$ of width $2+\sqrt2$ attains the maximum lattice width among all three-dimensional convex bodies. We here prove a local version of this conjecture:…

We focus on decentralized stochastic non-convex optimization, where $n$ agents work together to optimize a composite objective function which is a sum of a smooth term and a non-smooth convex term. To solve this problem, we propose two…

Let $G_1,\dots,G_m$ be independent copies of the standard gaussian random vector in $\mathbb{R}^d$. We show that there is an absolute constant $c$ such that for any $A \subset S^{d-1}$, with probability at least $1-2\exp(-c\Delta m)$, for…

We prove that any extended formulation that approximates the matching polytope on $n$-vertex graphs up to a factor of $(1+\varepsilon)$ for any $\frac2n \le \varepsilon \le 1$ must have at least $\binom{n}{{\alpha}/{\varepsilon}}$ defining…

In 2013, Koldobsky posed the problem to find a constant $d_n$, depending only on the dimension $n$, such that for any origin-symmetric convex body $K\subset\mathbb{R}^n$ there exists an $(n-1)$-dimensional linear subspace…

A set $A$ is coarsely computable with density $r \in [0,1]$ if there is an algorithm for deciding membership in $A$ which always gives a (possibly incorrect) answer, and which gives a correct answer with density at least $r$. To any Turing…

We study the oracle complexity of producing $(\delta,\epsilon)$-stationary points of Lipschitz functions, in the sense proposed by Zhang et al. [2020]. While there exist dimension-free randomized algorithms for producing such points within…

We introduce the theory of div point sets, which aims to provide a framework to study the combinatoric nature of any set of points in general position on an Euclidean plane. We then show that proving the unsatisfiability of some first-order…

The aim of this paper is to prove that if a planar set $A$ has a difference set $\Delta(A)$ satisfying $\Delta(A)\subset \Z^++s$ for suitable $s$ than $A$ has at most 3 elements. This result is motivated by the conjecture that the disk has…

We introduce a new decomposition technique for random variables that maps a generic instance of the prophet inequalities problem to a new instance where all but a constant number of variables have a tractable structure that we refer to as…

Let $V \subset \mathbb{R}$ be a finite set with $|V| = n $ and suppose we are given each pairwise distance independently with probability $p$. We show that if $p = (1+\epsilon)/n$, for some fixed $\epsilon >0$, then we can reconstruct a…

Let \((a_n)_{n \in \mathbb{N}}\) be a lacunary sequence of integers satisfying the Hadamard gap condition. For any fixed dimension $d \geq 1$, we establish asymptotic upper bounds for the maximal gap in the set of dilates…

Consider a linear program of the form $\max\;c^{\top}x:Ax\leq b$, where $A$ is an $m\times n$ integral matrix. In 1986 Cook, Gerards, Schrijver, and Tardos proved that, given an optimal solution $x^{*}$, if an optimal integral solution…

Let $P$ be a set of $n$ points in $\mathbb{R}^2$. For a given positive integer $w<n$, our objective is to find a set $C \subset P$ of points, such that $CH(P\setminus C)$ has the smallest number of vertices and $C$ has at most $n-w$ points.…