Searcharxiv⌕ Search

arXiv subjects

Károly Bezdek

Publications and source records attributed to Károly Bezdek.

At least 19 recordsLinked to original sources

On basic $r$-ball polyhedra

This note introduces the class of basic $r$-ball polyhedra in the $d$-dimensional Euclidean space $\mathbb{E}^{d}$ for $d>1$ and $r>0$. We investigate their face structure and, for given integers $0\leq i\leq d-1$, $n\geq d+1\geq 3$ determine the maximal number of $i$-dimensional faces among all basic $r$-ball polyhedra in $\mathbb{E}^{d}$ with $n$ facets. In addition, we establish that for $d>2$, every basic $r$-ball polyhedron is globally rigid with respect to its inner dihedral angles.

math.MG↗

From Blaschke--Santaló-type inequalities to uniform contractions

In this short note, we establish Blaschke--Santaló-type inequalities for $r$-ball bodies. Building on these inequalities, we somewhat further extend earlier results on analogues of the Kneser--Poulsen conjecture concerning intersections of balls under uniform contractions in Euclidean $d$-space. As an immediate corollary, we obtain a proof of Alexander's conjecture for uniform contractions.

math.MG↗

Notes on non-separable arrangements of convex bodies

A problem posed by Erdős in 1945 initiated the study of non-separable arrangements of convex bodies. A finite collection of convex bodies in Euclidean $d$-space is called a non-separable family (or NS-family) if every hyperplane intersecting their convex hull also intersects at least one member of the family. Recent work has focused on minimal coverings of NS-families consisting of positive homothetic convex bodies. In this paper, we strengthen these results by establishing their analogues for weakly non-separable families of convex polytopes. We further obtain stability results and analyze maximal weakly non-separable families of cubes. As an additional extension, we also examine weakly $k$-impassable families of convex $d$-polytopes for $0<k<d-1$.

math.MG↗

Selected topics from the theory of intersections of balls

In this survey, we discuss volumetric and combinatorial results concerning (mostly finite) intersections or unions of balls (mostly of equal radii) in the $d$-dimensional real vector space, mostly equipped with the Euclidean norm. Our first topic is the Kneser--Poulsen Conjecture, according to which if a finite number of balls are rearranged so that the pairwise distances of the centers increase, then the volume of the union (resp., intersection) increases (resp., decreases). Next, we discuss Blaschke--Santaló-type inequalities, and reverse isoperimetric inequalities for convex sets in Euclidean $d$-space obtained as intersections of (possibly infinitely many) balls of radius $r$, which we call $r$-ball bodies. We present some results on $1$-ball bodies (also called ball-bodies or spindle convex sets) in the plane, with special attention paid to their approximation by the spindle convex hull of a finite subset. A ball-polyhedron is a ball-body obtained as the intersection of finitely many unit balls in Euclidean $d$-space. We consider the combinatorial structure of their faces, and volumetric properties of ball-polyhedra obtained from choosing the centers of the balls randomly.

math.MG↗

On separability in discrete geometry

A problem of Erdős (Amer. Math. Monthly 52: 494-498, 1945) and a theorem of Fejes Tóth and Fejes Tóth (Acta Math. Acad. Sci. Hungar. 24: 229-232, 1973) initiated the study of non-separable arrangements of convex bodies and the investigation of totally separable packings of convex bodies with both topics analyzing the concept of separability from the point view of discrete geometry. This article surveys the progress made on these and some closely related problems and highlights the relevant questions that have been left open.

math.MG↗

Density bounds for unit ball packings relative to their outer parallel domains

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 generalizes some earlier (classical) results. Sharp upper bounds are proved for the analogue problem on congruent circular disks in the spherical (resp., hyperbolic) plane and on congruent balls in Euclidean $3$-space.

math.MG↗

Remarks on soft ball packings in dimensions 2 and 3

We study translative arrangements of centrally symmetric convex domains in the plane (resp., of congruent balls in the Euclidean $3$-space) that neither pack nor cover. We define their soft density depending on a soft parameter and prove that the largest soft density for soft translative packings of a centrally symmetric convex domain with $3$-fold rotational symmetry and given soft parameter is obtained for a proper soft lattice packing. Furthermore, we show that among the soft lattice packings of congruent soft balls with given soft parameter the soft density is locally maximal for the corresponding face centered cubic (FCC) lattice.

math.MG↗

On a Blaschke-Santaló-type inequality for $r$-ball bodies

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. The author [Discrete Optimization 44/1 (2022), Paper No. 100539] proved the following Blaschke-Santaló-type inequality for $r$-ball bodies: for all $0<k< d$ and for any set of given $d$-dimensional volume in ${\mathbb E}^d$ the $k$-th intrinsic volume of the $r$-ball body generated by the set becomes maximal if the set is a ball. In this note we give a new proof showing also the uniqueness of the maximizer. Some applications and related questions are mentioned as well.

math.MG↗

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↗

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↗

Illuminating spiky balls and cap bodies

The convex hull of a ball with an exterior point is called a spike (or cap). A union of finitely many spikes of a ball is called a spiky ball. If a spiky ball is convex, then we call it a cap body. In this note we upper bound the illumination numbers of $2$-illuminable spiky balls as well as centrally symmetric cap bodies. In particular, we prove the Illumination Conjecture for centrally symmetric cap bodies in sufficiently large dimensions by showing that any $d$-dimensional centrally symmetric cap body can be illuminated by $<2^d$ directions in Euclidean $d$-space for all $d\geq 20$. Furthermore, we strengthen the latter result for $1$-unconditionally symmetric cap bodies.

math.MG↗

On a strengthening of the Blaschke-Leichtweiss theorem

The Blaschke-Leichtweiss theorem (Abh. Math. Sem. Univ. Hamburg 75: 257-284, 2005) states that the smallest area convex domain of constant width $w$ in the $2$-dimensional spherical space ${\mathbb S}^2$ is the spherical Reuleaux triangle for all $0<w\leq\fracπ{2}$. In this paper we extend this result to the family of wide $r$-disk domains of ${\mathbb S}^2$, where $0<r\leq\fracπ{2}$. Here a wide $r$-disk domain is an intersection of spherical disks of radius $r$ with centers contained in their intersection. This gives a new and elementary proof of the Blaschke-Leichtweiss theorem. Furthermore, we investigate the higher dimensional analogue of wide $r$-disk domains called wide $r$-ball bodies. In particular, we determine their minimum spherical width (resp., inradius) in the spherical $d$-space ${\mathbb S}^d$ for all $d\geq 2$. Also, it is shown that any minimum volume wide $r$-ball body is of constant width $r$ in ${\mathbb S}^d$, $d\geq 2$.

math.MG↗

On contact numbers of locally separable unit sphere packings

The contact number of a packing of finitely many balls in Euclidean $d$-space is the number of touching pairs of balls in the packing. A prominent subfamily of sphere packings is formed by the so-called totally separable sphere packings: here, a packing of balls in Euclidean $d$-space is called totally separable if any two balls can be separated by a hyperplane such that it is disjoint from the interior of each ball in the packing. Bezdek, Szalkai and Szalkai (Discrete Math. 339(2): 668-676, 2016) upper bounded the contact numbers of totally separable packings of $n$ unit balls in Euclidean $d$-space in terms of $n$ and $d$. In this paper we improve their upper bound and extend that new upper bound to the so-called locally separable packings of unit balls. We call a packing of unit balls a locally separable packing if each unit ball of the packing together with the unit balls that are tangent to it form a totally separable packing. In the plane, we prove a crystallization result by characterizing all locally separable packings of $n$ unit disks having maximum contact number.

math.MG↗

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↗

Volumetric bounds for intersections of congruent balls

We investigate the intersections of balls of radius $r$, called $r$-ball bodies, in Euclidean $d$-space. An $r$-lense (resp., $r$-spindle) is the intersection of two balls of radius $r$ (resp., balls of radius $r$ containing a given pair of points). We prove that among $r$-ball bodies of given volume, the $r$-lense (resp., $r$-spindle) has the smallest inradius (resp., largest circumradius). In general, we upper (resp., lower) bound the intrinsic volumes of $r$-ball bodies of given inradius (resp., circumradius). This complements and extends some earlier results on volumetric estimates for $r$-ball bodies.

math.MG↗

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↗

On uniform contractions of balls in Minkowski spaces

Let $N$ balls of the same radius be given in a $d$-dimensional real normed vector space, i.e., in a Minkowski $d$-space. Then apply a uniform contraction to the centers of the $N$ balls without changing the common radius. Here a uniform contraction is a contraction where all the pairwise distances in the first set of centers are larger than all the pairwise distances in the second set of centers. The main results of this paper state that a uniform contraction of the centers does not increase (resp., decrease) the volume of the union (resp., intersection) of $N$ balls in Minkowski $d$-space, provided that $N\geq 2^d$ (resp., $N\geq 3^d$ and the unit ball of the Minkowski $d$-space is a generating set). Some improvements are presented in Euclidean spaces.

math.MG↗

On the intrinsic volumes of intersections of congruent balls

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 following Blaschke-Santaló-type inequalities for $r$-ball bodies: for all $1\leq k\leq d$ and for any set of given volume in ${\mathbb E}^d$ the $k$-th intrinsic volume of the $r$-ball body generated by the set becomes maximal if the set is a ball. As an application we investigate the Gromov-Klee-Wagon problem for congruent balls in ${\mathbb E}^d$, which is a question on proving or disproving that if the centers of a family of $N$ congruent balls in ${\mathbb E}^d$ are contracted, then the volume of the intersection does not decrease. In particular, we investigate this problem for uniform contractions, which are contractions where all the pairwise distances in the first set of centers are larger than all the pairwise distances in the second set of centers, that is, when the pairwise distances of the two sets are separated by some positive real number. The author and M. Naszódi [Discrete Comput. Geom. 60/4 (2018), 967-980] proved that the intrinsic volumes of the intersection of $N$ congruent balls in ${\mathbb E}^d$, $d>1$ increase under any uniform contraction of the center points when $ N\geq \left(1+\sqrt{2}\right)^d$. We give a short proof of this result using the Blaschke-Santaló-type inequalities of $r$-ball bodies and improve it for $d\geq 42$.

math.MG↗