Related papers: Upper bound on the expected size of intrinsic ball

The Onsager's conjecture has two parts: conservation of energy, if the exponent is larger than $1/3$ and the possibility of dissipative Euler solutions, if the exponent is less or equal than $1/3$. The paper proves half of the conjecture,…

Ramras conjectured that the maximum size of an independent set in the discrete cube containing equal numbers of sets of even and odd size is 2^(n-1) - (n-1 choose (n-1)/2) when n is odd. We prove this conjecture, and find the analogous…

We prove that an m-dimensional unit ball D^m in the Euclidean space {\mathbb R}^m cannot be isometrically embedded into a higher-dimensional Euclidean ball B_r^d \subset {\mathbb R}^d of radius r < 1/2 unless one of two conditions is met --…

We observe that the diameter of small (in a locally uniform sense) balls in $C^{1,1}$ sub-Riemannian manifolds equals twice the radius. We also prove that, when the regularity of the structure is further lowered to $C^0$, the diameter is…

The growth exponent $\alpha$ for loop-erased or Laplacian random walk on the integer lattice is defined by saying that the expected time to reach the sphere of radius $n$ is of order $n^\alpha$. We prove that in two dimensions, the growth…

Let $H$ be a Hilbert space. For a closed convex body $A$ denote by $r(A)$ the supremum of radiuses of balls, contained in $A$. We prove, that $\sum_{n=1}^\infty r(A_n) \ge r(A)$ for every covering of a convex closed body $A \subset H$ by a…

The maximum size of a cosmic structure is given by the maximum turnaround radius -- the scale where the attraction due to its mass is balanced by the repulsion due to dark energy. We derive generic formulae for the estimation of the maximum…

In this paper we derive an explicit lower bound on the volume of a hyperbolic $n$-orbifold for dimensions greater than or equal to four. Our main tool is H. C. Wang's bound on the radius of a ball embedded in the fundamental domain of a…

We consider the system of $N$ ($\ge2$) elastically colliding hard balls of masses $m_1,...,m_N$ and radius $r$ in the flat unit torus $\Bbb T^\nu$, $\nu\ge2$. In the case $\nu=2$ we prove (the full hyperbolicity and) the ergodicity of such…

We have discovered a "little" gap in our proof of the sharp conjecture that in $\mathbb{R}^n$ with volume and perimeter densities $r^m$ and $r^k$, balls about the origin are uniquely isoperimetric if $0 < m \leq k - k/(n+k-1)$, that is, if…

Let ${\mathbb E}^d$ denote the $d$-dimensional Euclidean space. The $r$-ball body generated by a given set in ${\mathbb E}^d$ is the intersection of balls of radius $r$ centered at the points of the given set. In this paper we prove the…

We show that the capacity of the Ising perceptron is with high probability upper bounded by the constant $\alpha_\star \approx 0.833$ conjectured by Krauth and M\'ezard, under the condition that an explicit two-variable function…

Let $M^d$ denote the $d$-dimensional Euclidean, hyperbolic, or spherical space. The $r$-dual set of given set in $M^d$ is the intersection of balls of radii $r$ centered at the points of the given set. In this paper we prove that for any…

The Upper Bound Theorem for convex polytopes implies that the $p$-th Betti number of the \v{C}ech complex of any set of $N$ points in $\mathbb R^d$ and any radius satisfies $\beta_{p} = O(N^{m})$, with $m = \min \{ p+1, \lceil d/2 \rceil…

A translation structure equips a Riemann surface with a singular flat metric. Not much is known about the shape of a random translation surface. We compute an upper bound on the expected value of the covering radius of a translation surface…

In this paper, we show that the oriented diameter of any $n$-vertex $2$-connected near triangulation is at most $\lceil{\frac{n}{2}}\rceil$ (except for seven small exceptions), and the upper bound is tight. This extends a result of Wang…

Ryser's Conjecture states that any $r$-partite $r$-uniform hypergraph has a vertex cover of size at most $r - 1$ times the size of the largest matching. For $r = 2$, the conjecture is simply K\"onig's Theorem and every bipartite graph is a…

In this note we study the maximal perimeter of a convex set in $\mathbb{R}^n$ with respect to various classes of measures. Firstly, we show that for a probability measure $\mu$ on $ \mathbb{R}^n$, satisfying very mild assumptions, there…

A triangulation of a surface is \emph{irreducible} if there is no edge whose contraction produces another triangulation of the surface. We prove that every irreducible triangulation of a surface with Euler genus $g\geq1$ has at most $13g-4$…

In the Metric Capacitated Covering (MCC) problem, given a set of balls $\mathcal{B}$ in a metric space $P$ with metric $d$ and a capacity parameter $U$, the goal is to find a minimum sized subset $\mathcal{B}'\subseteq \mathcal{B}$ and an…