Searcharxiv⌕ Search

arXiv subjects

Zsolt Lángi

Publications and source records attributed to Zsolt Lángi.

At least 37 records · Page 2Linked to original sources
arXiv2023

On optimal $λ$-separable packings in the plane

Let $\mathcal{P}$ be a packing of circular disks of radius $ρ>0$ in the Euclidean, spherical, or hyperbolic plane. Let $0\leqλ\leqρ$. We say that $\mathcal{P}$ is a $λ$-separable packing of circular disks of radius $ρ$ if the family $\mathcal{P'}$ of disks concentric to the disks of $\mathcal{P}$ having radius $λ$ form a totally separable packing, i.e., any two disks of $\mathcal{P'}$ can be separated by a line which is disjoint from the interior of every disk of $\mathcal{F'}$. This notion bridges packings of circular disks of radius $ρ$ (with $λ=0$) and totally separable packings of circular disks of radius $ρ$ (with $λ=ρ$). In this note we extend several theorems on the density, tightness, and contact numbers of disk packings and totally separable disk packings to $λ$-separable packings of circular disks of radius $ρ$ in the Euclidean, spherical, and hyperbolic plane. In particular, our upper bounds (resp., lower bounds) for the density (resp., tightness) of $λ$-separable packings of unit disks in the Euclidean plane are sharp for all $0\leqλ\leq 1$ with the extremal values achieved by $λ$-separable lattice packings of unit disks. On the other hand, the bounds of similar results in the spherical and hyperbolic planes are not sharp for all $0\leqλ\leqρ$ although they do not seem to be far from the relevant optimal bounds either. The proofs use local analytic and elementary geometry and are based on the so-called refined Molnár decomposition, which is obtained from the underlying Delaunay decomposition and as such might be of independent interest.

math.MG↗
arXiv2023

Isoperimetric problems for zonotopes

Shephard (Canad. J. Math. 26: 302-321, 1974) proved a decomposition theorem for zonotopes yielding a simple formula for their volume. In this note we prove a generalization of this theorem yielding similar formulas for their intrinsic volumes. We use this result to investigate geometric extremum problems for zonotopes generated by a given number of segments. In particular, we solve isoperimetric problems for d-dimensional zonotopes generated by d or d+1 segments, and give asymptotic estimates for the solutions of similar problems for zonotopes generated by sufficiently many segments. In addition, we present applications of our results to the \ell_1$ polarization problem on the unit sphere and to a vector-valued Maclaurin inequality conjectured by Brazitikos and McIntyre in 2021.

math.MG↗
arXiv2022

From the separable Tammes problem to extremal distributions of great circles in the unit sphere

A family of spherical caps of the 2-dimensional unit sphere $\mathbb{S}^2$ is called a totally separable packing in short, a TS-packing if any two spherical caps can be separated by a great circle which is disjoint from the interior of each spherical cap in the packing. The separable Tammes problem asks for the largest density of given number of congruent spherical caps forming a TS-packing in $\mathbb{S}^2$. We solve this problem up to $8$ spherical caps and upper bound the density of any TS-packing of congruent spherical caps in terms of their angular radius. Based on this, we show that the centered separable kissing number of $3$-dimensional Euclidean balls is $8$. Furthermore, we prove bounds for the maximum of the smallest inradius of the cells of the tilings generated by $n>1$ great circles in $\mathbb{S}^2$. Next, we prove dual bounds for TS-coverings of $\mathbb{S}^2$ by congruent spherical caps. Here a covering of $\mathbb{S}^2$ by spherical caps is called a totally separable covering in short, a TS-covering if there exists a tiling generated by finitely many great circles of $\mathbb{S}^2$ such that the cells of the tiling are covered by pairwise distinct spherical caps of the covering. Finally, we extend some of our bounds on TS-coverings to spherical spaces of dimension $>2$.

math.MG↗
arXiv2022

An isoperimetric problem for three-dimensional parallelohedra

The aim of this note is to investigate isoperimetric-type problems for $3$-dimensional parallelohedra; that is, for convex polyhedra whose translates tile the $3$-dimensional Euclidean space. Our main result states that among $3$-dimensional parallelohedra with unit volume the one with minimal mean width is the regular truncated octahedron.

math.MG↗
arXiv2021

On generalized Minkowski arrangements

The concept of a Minkowski arrangement was introduced by Fejes Tóth in 1965 as a family of centrally symmetric convex bodies with the property that no member of the family contains the center of any other member in its interior. This notion was generalized by Fejes Tóth in 1967, who called a family of centrally symmetric convex bodies a generalized Minkowski arrangement of order $μ$ for some $0 < μ< 1$ if no member $K$ of the family overlaps the homothetic copy of any other member $K'$ with ratio $μ$ and with the same center as $K'$. In this note we prove a sharp upper bound on the total area of the elements of a generalized Minkowski arrangement of order $μ$ of finitely many circular disks in the Euclidean plane. This result is a common generalization of a similar result of Fejes Tóth for Minkowski arrangements of circular disks, and a result of Böröczky and Szabó about the maximum density of a generalized Minkowski arrangement of circular disks in the plane. In addition, we give a sharp upper bound on the density of a generalized Minkowski arrangement of homothetic copies of a centrally symmetric convex body.

math.MG↗
arXiv2021

Balancing polyhedra

We define the mechanical complexity $C(P)$ of a convex polyhedron $P,$ interpreted as a homogeneous solid, as the difference between the total number of its faces, edges and vertices and the number of its static equilibria, and the mechanical complexity $C(S,U)$ of primary equilibrium classes $(S,U)^E$ with $S$ stable and $U$ unstable equilibria as the infimum of the mechanical complexity of all polyhedra in that class. We prove that the mechanical complexity of a class $(S,U)^E$ with $S, U > 1$ is the minimum of $2(f+v-S-U)$ over all polyhedral pairs $(f,v )$, where a pair of integers is called a polyhedral pair if there is a convex polyhedron with $f$ faces and $v$ vertices. In particular, we prove that the mechanical complexity of a class $(S,U)^E$ is zero if, and only if there exists a convex polyhedron with $S$ faces and $U$ vertices. We also give asymptotically sharp bounds for the mechanical complexity of the monostatic classes $(1,U)^E$ and $(S,1)^E$, and offer a complexity-dependent prize for the complexity of the Gömböc-class $(1,1)^E$.

math.MG↗
arXiv2021

On the convex hull and homothetic convex hull functions of a convex body

The aim of this note is to investigate the properties of the convex hull and the homothetic convex hull functions of a convex body $K$ in Euclidean $n$-space, defined as the volume of the union of $K$ and one of its translates, and the volume of $K$ and a translate of a homothetic copy of $K$, respectively, as functions of the translation vector. In particular, we prove that the convex hull function of the body $K$ does not determine $K$. Furthermore, we prove the equivalence of the polar projection body problem raised by Petty, and a conjecture of G.Horváth and Lángi about translative constant volume property of convex bodies. We give a short proof of some theorems of Jerónimo-Castro about the homothetic convex hull function, and prove a homothetic variant of the translative constant volume property conjecture for $3$-dimensional convex polyhedra. We also apply our results to describe the properties of the illumination bodies of convex bodies.

math.MG↗
arXiv2021

Extremal convex polygons inscribed in a given convex polygon

A convex polygon $Q$ is inscribed in a convex polygon $P$ if every side of $P$ contains at least one vertex of $Q$. We present algorithms for finding a minimum area and a minimum perimeter convex polygon inscribed in any given convex $n$-gon in $O(n)$ and $O(n^3)$ time, respectively. We also investigate other variants of this problem.

math.MG↗
arXiv2021

Volume of the Minkowski sums of star-shaped sets

For a compact set $A \subset {\mathbb R}^d$ and an integer $k\ge 1$, let us denote by $$ A[k] = \left\{a_1+\cdots +a_k: a_1, \ldots, a_k\in A\right\}=\sum_{i=1}^k A$$ the Minkowski sum of $k$ copies of $A$. A theorem of Shapley, Folkmann and Starr (1969) states that $\frac{1}{k}A[k]$ converges to the convex hull of $A$ in Hausdorff distance as $k$ tends to infinity. Bobkov, Madiman and Wang (2011) conjectured that the volume of $\frac{1}{k}A[k]$ is non-decreasing in $k$, or in other words, in terms of the volume deficit between the convex hull of $A$ and $\frac{1}{k}A[k]$, this convergence is monotone. It was proved by Fradelizi, Madiman, Marsiglietti and Zvavitch (2016) that this conjecture holds true if $d=1$ but fails for any $d \geq 12$. In this paper we show that the conjecture is true for any star-shaped set $A \subset {\mathbb R}^d$ for $d=2$ and $d=3$ and also for arbitrary dimensions $d \ge 4$ under the condition $k \ge (d-1)(d-2)$. In addition, we investigate the conjecture for connected sets and present a counterexample to a generalization of the conjecture to the Minkowski sum of possibly distinct sets in ${\mathbb R}^d$, for any $d \geq 7$.

math.MG↗
arXiv2021

On $k$-diametral point configurations in Minkowski spaces

The structure of $k$-diametral point configurations in Minkowski $d$-space is shown to be closely related to the properties of $k$-antipodal point configurations in $\mathbb{R}^d$. In particular, the maximum size of $k$-diametral point configurations of Minkowski $d$-spaces is obtained for given $k\geq 2$ and $d\geq 2$ generalizing Petty's results (Proc. Am. Math. Soc. 29: 369-374, 1971) on equilateral sets in Minkowski spaces. Furthermore, bounds are derived for the maximum size of $k$-diametral point configurations in Euclidean $d$-space. In the proofs convexity methods are combined with volumetric estimates and combinatorial properties of diameter graphs.

math.MG↗
arXiv2021

A solution to some problems of Conway and Guy on monostable polyhedra

A convex polyhedron is called monostable if it can rest in stable position only on one of its faces. The aim of this paper is to investigate three questions of Conway, regarding monostable polyhedra, which first appeared in a 1969 paper of Goldberg and Guy (M. Goldberg and R.K. Guy, Stability of polyhedra (J.H. Conway and R.K. Guy), SIAM Rev. 11 (1969), 78-82). In this note we answer two of these problems and make a conjecture about the third one. The main tool of our proof is a general theorem describing approximations of smooth convex bodies by convex polyhedra in terms of their static equilibrium points. As another application of this theorem, we prove the existence of a convex polyhedron with only one stable and one unstable point.

math.MG↗
arXiv2019

Hexagon tilings of the plane that are not edge-to-edge

An irregular vertex in a tiling by polygons is a vertex of one tile and belongs to the interior of an edge of another tile. In this paper we show that for any integer $k\geq 3$, there exists a normal tiling of the Euclidean plane by convex hexagons of unit area with exactly $k$ irregular vertices. Using the same approach we show that there are normal edge-to-edge tilings of the plane by hexagons of unit area and exactly $k$ many $n$-gons ($n>6$) of unit area. A result of Akopyan yields an upper bound for $k$ depending on the maximal diameter and minimum area of the tiles. Our result complements this with a lower bound for the extremal case, thus showing that Akopyan's bound is asymptotically tight.

math.MG↗
arXiv2019

From spherical to Euclidean illumination

In this note we introduce the problem of illumination of convex bodies in spherical spaces and solve it for a large subfamily of convex bodies. We derive from it a combinatorial version of the classical illumination problem for convex bodies in Euclidean spaces as well as a solution to that for a large subfamily of convex bodies, which in dimension three leads to special Koebe polyhedra.

math.MG↗
arXiv2019

Tiling a circular disc with congruent pieces

In this note we prove that any monohedral tiling of the closed circular unit disc with $k \leq 3$ topological discs as tiles has a $k$-fold rotational symmetry. This result yields the first nontrivial estimate about the minimum number of tiles in a monohedral tiling of the circular disc in which not all tiles contain the center, and the first step towards answering a question of Stein appearing in the problem book of Croft, Falconer and Guy in 1994.

math.GT↗
arXiv2018

Centering Koebe polyhedra via Möbius transformations

A variant of the Circle Packing Theorem states that the combinatorial class of any convex polyhedron contains elements midscribed to the unit sphere centered at the origin, and that these representatives are unique up to Möbius transformations of the sphere. Motivated by this result, various papers investigate the problem of centering spherical configurations under Möbius transformations. In particular, Springborn proved that for any discrete point set on the sphere there is a Möbius transformation that maps it into a set whose barycenter is the origin, which implies that the combinatorial class of any convex polyhedron contains an element midsribed to a sphere with the additional property that the barycenter of the points of tangency is the center of the sphere. This result was strengthened by Baden, Krane and Kazhdan who showed that the same idea works for any reasonably nice measure defined on the sphere. The aim of the paper is to show that Springborn's statement remains true if we replace the barycenter of the tangency points by many other polyhedron centers. The proof is based on the investigation of the topological properties of the integral curves of certain vector fields defined in hyperbolic space. We also show that most centers of Koebe polyhedra cannot be obtained as the center of a suitable measure defined on the sphere.

math.MG↗
arXiv2018

Tracking critical points on evolving curves and surfaces

In recent years it became apparent that geophysical abrasion can be well characterized by the time evolution $N(t)$ of the number $N$ of static balance points of the abrading particle. Static balance points correspond to the critical points of the particle's surface represented as a scalar distance function $r$, measured from the center of mass, so their time evolution can be expressed as $N(r(t))$. The mathematical model of the particle can be constructed on two scales: on the macro scale the particle may be viewed as a smooth, convex manifold described by the smooth distance function $r$ with $N=N(r)$ equilibria, while on the micro scale the particle's natural model is a finely discretized, convex polyhedral approximation $r^Δ$ of $r$, with $N^Δ=N(r^Δ)$ equilibria. There is strong intuitive evidence suggesting that under some particular evolution models $N(t)$ and $N^Δ(t)$ primarily evolve in the opposite manner. Here we create the mathematical framework necessary to understand these phenomenon more broadly, regardless of the particular evolution equation. We study micro and macro events in one-parameter families of curves and surfaces, corresponding to bifurcations triggering the jumps in $N(t)$ and $N^Δ(t)$. We show that the intuitive picture developed for curvature-driven flows is not only correct, it has universal validity, as long as the evolving surface $r$ is smooth. In this case, bifurcations associated with $r$ and $r^Δ$ are coupled to some extent: resonance-like phenomena in $N^Δ(t)$ can be used to forecast downward jumps in $N(t)$ (but not upward jumps). Beyond proving rigorous results for the $Δ\to 0$ limit on the nontrivial interplay between singularities in the discrete and continuum approximations we also show that our mathematical model is structurally stable, i.e. it may be verified by computer simulations.

math.DS↗