arXiv subjects

Zsolt Lángi

Publications and source records attributed to Zsolt Lángi.

50 records · Page 3Linked to original sources

arXiv2017

Minimizing the mean projections of finite $ρ$-separable packings

A packing of translates of a convex body in the $d$-dimensional Euclidean space $\mathbb{E}^d$ is said to be totally separable if any two packing elements can be separated by a hyperplane of $\mathbb{E}^{d}$ disjoint from the interior of every packing element. We call the packing $\mathcal P$ of translates of a centrally symmetric convex body $\mathbf{C}$ in $\mathbb{E}^d$ a $ρ$-separable packing for given $ρ\geq 1$ if in every ball concentric to a packing element of $\mathcal P$ having radius $ρ$ (measured in the norm generated by $\mathbf{C}$) the corresponding sub-packing of $\mathcal P$ is totally separable. The main result of this paper is the following theorem. Consider the convex hull $\mathbf{Q}$ of $n$ non-overlapping translates of an arbitrary centrally symmetric convex body $\mathbf{C}$ forming a $ρ$-separable packing in $\mathbb{E}^d$ with $n$ being sufficiently large for given $ρ\geq 1$. If $\mathbf{Q}$ has minimal mean $i$-dimensional projection for given $i$ with $1\leq i<d$, then $\mathbf{Q}$ is approximately a $d$-dimensional ball. This extends a theorem of K. Böröczky Jr. [Monatsh. Math. 118 (1994), 41-54] from translative packings to $ρ$-separable translative packings for $ρ\geq 1$.

math.MG↗

arXiv2017

Bounds for totally separable translative packings in the plane

A packing of translates of a convex domain in the Euclidean plane is said to be totally separable if any two packing elements can be separated by a line disjoint from the interior of every packing element. This notion was introduced by G. Fejes Tóth and L. Fejes Tóth (1973) and has attracted significant attention. In this paper we prove an analogue of Oler's inequality for totally separable translative packings of convex domains and then we derive from it some new results. This includes finding the largest density of totally separable translative packings of an arbitrary convex domain and finding the smallest area convex hull of totally separable packings (resp., totally separable soft packings) generated by given number of translates of a convex domain (resp., soft convex domain). Finally, we determine the largest covering ratio (that is, the largest fraction of the plane covered by the soft disks) of an arbitrary totally separable soft disk packing with given soft parameter.

math.MG↗

arXiv2017

A shape evolution model under affine transformations

In this note we describe a discrete dynamical system acting on the similarity classes of a plane convex body within the affine class of the body. We find invariant elements in all affine classes, and describe the orbits of bodies in some special classes. We point out applications with abrasion processes of pebble shapes.

math.MG↗

arXiv2016

Decompositions of a polygon into centrally symmetric pieces

In this paper we deal with edge-to-edge, irreducible decompositions of a centrally symmetric convex $(2k)$-gon into centrally symmetric convex pieces. We prove an upper bound on the number of these decompositions for any value of $k$, and characterize them for octagons.

math.MG↗

arXiv2015

A topological classification of convex bodies

The shape of homogeneous, generic, smooth convex bodies as described by the Euclidean distance with nondegenerate critical points, measured from the center of mass represents a rather restricted class M_C of Morse-Smale functions on S^2. Here we show that even M_C exhibits the complexity known for general Morse-Smale functions on S^2 by exhausting all combinatorial possibilities: every 2-colored quadrangulation of the sphere is isomorphic to a suitably represented Morse-Smale complex associated with a function in M_C (and vice versa). We prove our claim by an inductive algorithm, starting from the path graph P_2 and generating convex bodies corresponding to quadrangulations with increasing number of vertices by performing each combinatorially possible vertex splitting by a convexity-preserving local manipulation of the surface. Since convex bodies carrying Morse-Smale complexes isomorphic to P_2 exist, this algorithm not only proves our claim but also generalizes the known classification scheme in [36]. Our expansion algorithm is essentially the dual procedure to the algorithm presented by Edelsbrunner et al. in [21], producing a hierarchy of increasingly coarse Morse-Smale complexes. We point out applications to pebble shapes.

math.DG↗

arXiv2015

Semi-inner products and the concept of semi-polarity

The lack of an inner product structure in Banach spaces yields the motivation to introduce a semi-inner product with a more general axiom system, one missing the requirement for symmetry, unlike the one determing a Hilbert space. We use it on a finite dimensional real Banach space $(\X, \| \cdot\|)$ to define and investigate three concepts. First, we generalize that of \emph{antinorms}, already defined in Minkowski planes, for even dimensional spaces. Second, we introduce \emph{normality maps}, which in turn leads us to the study of \emph{semi-polarity}, a variant of the notion of polarity, which makes use of the underlying semi-inner product.

math.MG↗

arXiv2015

Separation with restricted families of sets

Given a finite $n$-element set $X$, a family of subsets ${\mathcal F}\subset 2^X$ is said to separate $X$ if any two elements of $X$ are separated by at least one member of $\mathcal F$. It is shown that if $|\mathcal F|>2^{n-1}$, then one can select $\lceil\log n\rceil+1$ members of $\mathcal F$ that separate $X$. If $|\mathcal F|\ge α2^n$ for some $0<α<1/2$, then $\log n+O(\log\frac1α\log\log\frac1α)$ members of $\mathcal F$ are always sufficient to separate all pairs of elements of $X$ that are separated by some member of $\mathcal F$. This result is generalized to simultaneous separation in several sets. Analogous questions on separation by families of bounded Vapnik-Chervonenkis dimension and separation of point sets in ${\mathbb{R}}^d$ by convex sets are also considered.

math.CO↗

arXiv2015

A genealogy of convex solids via local and global bifurcations of gradient vector fields

Three-dimensional convex bodies can be classified in terms of the number and stability types of critical points on which they can balance at rest on a horizontal plane. For typical bodies these are nondegenerate maxima, minima, and saddle-points, the numbers of which provide a primary classification. Secondary and tertiary classifications use graphs to describe orbits connecting these critical points in the gradient vector field associated with each body. In previous work it was shown that these classifications are complete in that no class is empty. Here we construct 1- and 2-parameter families of convex bodies connecting members of adjacent primary and secondary classes and show that transitions between them can be realized by codimension 1 saddle-node and saddle-saddle (heteroclinic) bifurcations in the gradient vector fields. Our results indicate that all combinatorially possible transitions can be realized in physical shape evolution processes, e.g. by abrasion of sedimentary particles.

math.MG↗

arXiv2014

On a normed version of a Rogers-Shephard type problem

A translation body of a convex body is the convex hull of two of its translates intersecting each other. In the 1950s, Rogers and Shephard found the extremal values, over the family of $n$-dimensional convex bodies, of the maximal volume of the translation bodies of a given convex body. In our paper, we introduce a normed version of this problem, and for the planar case, determine the corresponding quantities, with one exception, for the four types of volumes regularly used in the literature: Busemann, Holmes-Thompson, and Gromov's mass and mass*. We examine the problem also for higher dimensions, and for centrally symmetric convex bodies.

math.MG↗

arXiv2014

Maximum volume polytopes inscribed in the unit sphere

In this paper we investigate the problem of finding the maximum volume polytopes, inscribed in the unit sphere of the $d$-dimensional Euclidean space, with a given number of vertices. We solve this problem for polytopes with $d+2$ vertices in every dimension, and for polytopes with $d+3$ vertices in odd dimensions. For polytopes with $d+3$ vertices in even dimensions we give a partial solution.

math.MG↗

arXiv2014

On the average number of normals through points of a convex body

In 1944, Santaló asked about the average number of normals through a point of a given convex body. Since then, numerous results appeared in the literature about this problem. The aim of this paper is to give a concise summary of these results, with some new, recent developments. We point out connections of this problem to static equilibria of rigid bodies as well as to geometric partial differential equations of surface evolution.

math.MG↗

arXiv2013

On multiple Borsuk numbers in normed spaces

Hujter and Lángi introduced the $k$-fold Borsuk number of a set $S$ in Euclidean $n$-space of diameter $d > 0$ as the smallest cardinality of a family $\mathcal F$ of subsets of $S$, of diameters strictly less than $d$, such that every point of $S$ belongs to at least $k$ members of $\mathcal F$. We investigate whether a $k$-fold Borsuk covering of a set $S$ in a finite dimensional real normed space can be extended to a completion of $S$. Furthermore, we determine the $k$-fold Borsuk number of sets in not angled normed planes, and give a partial characterization for sets in angled planes.

math.MG↗

arXiv2012

Ball and Spindle Convexity with respect to a Convex Body

Let $C\subset {\mathbb R}^n$ be a convex body. We introduce two notions of convexity associated to C. A set $K$ is $C$-ball convex if it is the intersection of translates of $C$, or it is either $\emptyset$, or ${\mathbb R}^n$. The $C$-ball convex hull of two points is called a $C$-spindle. $K$ is $C$-spindle convex if it contains the $C$-spindle of any pair of its points. We investigate how some fundamental properties of conventional convex sets can be adapted to $C$-spindle convex and $C$-ball convex sets. We study separation properties and Carathéodory numbers of these two convexity structures. We investigate the basic properties of arc-distance, a quantity defined by a centrally symmetric planar disc $C$, which is the length of an arc of a translate of $C$, measured in the $C$-norm, that connects two points. Then we characterize those $n$-dimensional convex bodies $C$ for which every $C$-ball convex set is the $C$-ball convex hull of finitely many points. Finally, we obtain a stability result concerning covering numbers of some $C$-ball convex sets, and diametrically maximal sets in $n$-dimensional Minkowski spaces.

math.MG↗

arXiv2012

On the perimeters of simple polygons contained in a plane convex body

A simple n-gon is a polygon with n edges such that each vertex belongs to exactly two edges and every other point belongs to at most one edge. Brass, Moser and Pach asked the following question: For n > 3 odd, what is the maximum perimeter of a simple n-gon contained in a Euclidean unit disk? In 2009, Audet, Hansen and Messine answered this question, and showed that the supremum is the perimeter of an isosceles triangle inscribed in the disk, with an edge of multiplicity n-2. Lángi generalized their result for polygons contained in a hyperbolic disk. In this note we find the supremum of the perimeters of simple n-gons contained in an arbitrary plane convex body in the Euclidean or in the hyperbolic plane.

math.MG↗