Related papers: On the lower bound in the lattice point remainder …

We propose Shotgun, a parallel coordinate descent algorithm for minimizing L1-regularized losses. Though coordinate descent seems inherently sequential, we prove convergence bounds for Shotgun which predict linear speedups, up to a…

Shock wave solutions of the Einstein equations have been constructed in coordinate systems in which the gravitational metric is only Lipschitz continuous, but the connection $\Gamma$ and curvature $Riem(\Gamma)$ are both in $L^{\infty}$. At…

For a real number $c > 4$, we prove that every graph $G$ with $\alpha(G) \leq 2$ and $|V(G)| \geq ct$ has a matching $M$ with $|M| = t$ such that the number of non-adjacent pairs of edges in $M$ is at most: \begin{equation*} \left(…

We use variational convergence to derive a hierarchy of one-dimensional rod theories, starting out from three-dimensional models in nonlinear elasticity subject to local volume-preservation. The densities of the resulting $\Gamma$-limits…

This work investigates linear precoding over non-singular linear channels with additive white Gaussian noise, with lattice-type inputs. The aim is to maximize the minimum distance of the received lattice points, where the precoder is…

We consider the LP in standard form min {c T x\,: Ax = b; x $\ge$ 0} and inspired by $\epsilon$-regularization in Optimal Transport, we introduce its $\epsilon$-regularization ''min {c T x + $\epsilon$ f (x)\,: Ax = b; x $\ge$ 0}'' via the…

On a compact metric graph, we consider the spectrum of the Laplacian defined with a mix of standard and Dirichlet vertex conditions. A Cheeger-type lower bound on the gap $\lambda_2 - \lambda_1$ is established, with a constant that depends…

Let A be a compact set in the right-half plane and $\Gamma(A)$ the set in $\mathbb{R}^{3}$ obtained by rotating A about the vertical axis. We investigate the support of the limit distribution of minimal energy point charges on $\Gamma(A)$…

Bayesian inference requires approximation methods to become computable, but for most of them it is impossible to quantify how close the approximation is to the true posterior. In this work, we present a theorem upper-bounding the KL…

Let $\mathcal{P} \subset \mathbb{R}^d$ be a lattice polytope of dimension $d$. Let $b$ denote the number of lattice points belonging to the boundary of $\mathcal{P}$ and $c$ that to the interior of $\mathcal{P}$. It follows from a lower…

We study the maximum achievable differential entropy at the output of a system assigning to each input X the sum X+N, with N a given noise with probability law absolutely continuous with respect to the Lebesgue measure and where the input…

We show that Lipschitz solutions $u$ of $\mathrm{div}\, G(\nabla u)=0$ in $B_1\subset\mathbb R^2$ are $C^1$, for strictly monotone vector fields $G\in C^0(\mathbb R^2;\mathbb R^2)$ satisfying a mild ellipticity condition. If $G=\nabla F$…

We study the minimum number of constraints needed to formulate random instances of the maximum stable set problem via linear programs (LPs), in two distinct models. In the uniform model, the constraints of the LP are not allowed to depend…

Many geometric and analytic properties of sets hinge on the properties of harmonic measure, notoriously missing for sets of higher co-dimension. The aim of this manuscript is to develop a version of elliptic theory, associated to a linear…

For a positive integer $r$, let $G(r)$ be the smallest $N$ such that, whenever the edges of the Cartesian product $K_N \times K_N$ are $r$-coloured, then there is a rectangle in which both pairs of opposite edges receive the same colour. In…

For a finite group $G$ denote by $\gamma(L(G))$ the genus of the subgroup graph of $G.$ We prove that $\gamma(L(G))$ tends to infinity as either the rank of $G$ or the number of prime divisors of $|G|$ tends to infinity.

A recent upper bound by Le and Solomon [STOC '23] has established that every $n$-node graph has a $(1+\varepsilon)(2k-1)$-spanner with lightness $O(\varepsilon^{-1} n^{1/k})$. This bound is optimal up to its dependence on $\varepsilon$; the…

An upper bound on the error probability of specific lattices, based on their distance-spectrum, is constructed. The derivation is accomplished using a simple alternative to the Minkowski-Hlawka mean-value theorem of the geometry of numbers.…

We study lattice embeddings for the class of countable groups $\Gamma$ defined by the property that the largest amenable uniformly recurrent subgroup $A_\Gamma$ is continuous. When $A_\Gamma$ comes from an extremely proximal action and the…

We prove a number field analogue of W. M. Schmidt's conjecture on the intersection of weighted badly approximable vectors and use this to prove an instance of a conjecture of An, Guan and Kleinbock. Namely, let $G := SL_2(\mathbb{R}) \times…