Related papers: Explicit lower bounds for opaque sets of unit squa…

We provide a new construction of the Brownian disks, which have been defined by Bettinelli and Miermont as scaling limits of quadrangulations with a boundary when the boundary size tends to infinity. Our method is very similar to the…

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,…

In a series of papers, Avraham, Filtser, Kaplan, Katz, and Sharir (SoCG'14), Kaplan, Katz, Saban, and Sharir (ESA'23), and Katz, Saban, and Sharir (ESA'24) studied a class of geometric optimization problems -- including reverse shortest…

A general method for constructing essential uniform algebras with prescribed properties is presented. Using the method, the following examples are constructed: an essential, natural, regular uniform algebra on the closed unit disc; an…

We prove generalized lower Ricci bounds for Euclidean and spherical cones over complete Riemannian manifolds. These cones are regarded as complete metric measure spaces. In general, they will be neither manifolds nor Alexandrov spaces. We…

We consider a smooth Euclidean solid cone endowed with a smooth homogeneous density function used to weight Euclidean volume and hypersurface area. By assuming convexity of the cone and a curvature-dimension condition we prove that the…

Following Riemann's idea, we prove the existence of a minimal disk in Euclidean space bounded by three lines in generic position and with three helicoidal ends of angles less than $\pi$. In the case of general angles, we prove that there…

We prove a new bound for the minimum distance of geometric Goppa codes that generalizes two previous improved bounds. We include examples of the bound to one and two point codes over both the Suzuki and Hermitian curves.

We obtain upper and lower bounds for Steklov eigenvalues of submanifolds with prescribed boundary in Euclidean space. A very general upper bound is proved, which depends only on the geometry of the fixed boundary and on the measure of the…

The systole of a closed Riemannian manifold is the minimal length of a non-contractible closed loop. We give a uniform lower bound for the systole for large classes of simple arithmetic locally symmetric orbifolds. We establish new bounds…

For each integer $g\geq 1$ we use variational methods to construct in the unit $3$-ball $B$ a free boundary minimal surface $\Sigma_g$ of symmetry group $\mathbb{D}_{g+1}$. For $g$ large, $\Sigma_g$ has three boundary components and genus…

While many bounds have been proved for partial trace inequalities over the last decades for a large variety of quantities, recent problems in quantum information theory demand sharper bounds. In this work, we study optimal bounds for…

It is proved, using the curved line element of a spherically symmetric charged object in general relativity and the Schwinger discharge mechanism of quantum field theory, that the orbital periods $T_{\infty}$ of test particles around…

In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least distortion for Hamming graphs, Johnson graphs, and all strongly regular…

We prove generalized lower Ricci bounds for Euclidean and spherical cones over compact Riemannian manifolds. These cones are regarded as complete metric measure spaces. We show that the Euclidean cone over an n-dimensional Riemannian…

We improve the best known upper bound on the number of edges in a unit-distance graph on $n$ vertices for each $n\in\{16,\ldots,30\}$. When $n\leq 21$, our bounds match the best known lower bounds, and we fully enumerate the densest…

We apply polynomial techniques (linear programming) to obtain lower and upper bounds on the covering radius of spherical designs as function of their dimension, strength, and cardinality. In terms of inner products we improve the lower…

The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an {\em opaque set} or a {\em barrier} for that region. We consider the…

We prove that the highest density of non-overlapping translates of a given centrally symmetric convex domain relative to its outer parallel domain of given outer radius is attained by a lattice packing in the Euclidean plane. This…

We study expansion/contraction properties of some common classes of mappings of the Euclidean space ${\mathbb R}^n, n\ge 2\,,$ with respect to the distance ratio metric. The first main case is the behavior of M\"obius transformations of the…