Related papers: Maximal Distortion of Geodesic Diameters in Polygo…
We consider the volume of a Boolean expression of some congruent balls about a given system of centers in the $d$-dimensional Euclidean space. When the radius $r$ of the balls is large, this volume can be approximated by a polynomial of…
In [6], Kellerhals and Perren conjectured that the growth rates of the reflection groups given by hyperbolic Coxeter polyhedra are always Perron numbers. We prove that this conjecture is always true for the case of ideal Coxeter polyhedra…
Given any two vertices u, v of a random geometric graph, denote by d_E(u,v) their Euclidean distance and by d_G(u,v) their graph distance. The problem of finding upper bounds on d_G(u,v) in terms of d_E(u,v) has received a lot of attention…
Let $E$ be a $(\mathrm{IV})$-polyhedral Banach space. We show that, for each $\epsilon>0$, $E$ admits an $\epsilon$-equivalent $\mathrm{(V)}$-polyhedral norm such that the corresponding closed unit ball is the closed convex hull of its…
We prove three results conjectured or stated by Chartrand, Fink and Zhang [European J. Combin {\bf 21} (2000) 181--189, Disc. Appl. Math. {\bf 116} (2002) 115--126, and pre-print of ``The hull number of an oriented graph'']. For a digraph…
To untangle a geometric graph means to move some of the vertices so that the resulting geometric graph has no crossings. Pach and Tardos [Discrete Comput. Geom., 2002] asked if every n-vertex geometric planar graph can be untangled while…
The isoperimetric problem asks for the maximum area of a region of given perimeter. It is natural to consider other measurements of a region, such as the diameter and width, and ask for the extreme value of one when another is fixed. The…
The maximal contact symmetry dimensions for scalar ODEs of order $\ge 4$ and vector ODEs of order $\ge 3$ are well known. Using a Cartan-geometric approach, we determine for these ODEs the next largest realizable (submaximal) symmetry…
Computing the diameter of a graph, i.e. the largest distance, is a fundamental problem that is central in fine-grained complexity. In undirected graphs, the Strong Exponential Time Hypothesis (SETH) yields a lower bound on the time vs.…
In this paper, we study a quadratic equation on the one-dimensional torus : $$i \partial_t u = 2J\Pi(|u|^2)+\bar{J}u^2, \quad u(0, \cdot)=u_0,$$ where $J=\int_\mathbb{T}|u|^2u \in\mathbb{C}$ has constant modulus, and $\Pi$ is the Szeg\H{o}…
We show that for every $\alpha > 0$, there exist $n$-point metric spaces (X,d) where every "scale" admits a Euclidean embedding with distortion at most $\alpha$, but the whole space requires distortion at least $\Omega(\sqrt{\alpha \log…
In this paper we develop a new theory of infinitesimal harmonic deformations for compact hyperbolic 3-manifolds with ``tubular boundary''. In particular, this applies to complements of tubes of radius at least $R_0 = \arctanh(1/\sqrt{3})…
Recently, motivated by the rapid increase of the data size in various applications, Monemizadeh [APPROX'23] and Driemel, Monemizadeh, Oh, Staals, and Woodruff [SoCG'25] studied geometric problems in the setting where the only access to the…
In projective dimension growth results, one bounds the number of rational points of height at most $H$ on an irreducible hypersurface in $\mathbb P^n$ of degree $d>3$ by $C(n)d^2 H^{n-1}(\log H)^{M(n)}$, where the quadratic dependence in…
There exists a positive function $\psi(t)${on}$t\geq0${, with fast decay at infinity, such that for every measurable set}$\Omega${in the Euclidean space and}$R>0${, there exist entire functions}$A(x) ${and}$B(x) ${of exponential type}$R${,…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
We study a cutting-plane method for semidefinite optimization problems (SDOs), and supply a proof of the method's convergence, under a boundedness assumption. By relating the method's rate of convergence to an initial outer approximation's…
We approximate boundaries of convex polytopes by smooth hypersurfaces $Y=Y_\varepsilon$ with {\it positive mean curvatures} and, by using basic geometric relations between the scalar curvatures of Riemannin manifolds and the mean curvatures…
In this paper, we study the extremal behaviour of deep holes in polyominoes. We determine the maximum number, $h_n$ of deep holes that an $n$-omino can enclose, ensuring that the boundary of each hole is disjoint from the boundaries of any…
This second part on polygons in the hyperbolic plane is based on the first part which deals with uniqueness and existence of cocyclic polygons with prescribed sidelengths. The topic here is the maximum question for the area of these…