Searcharxiv⌕ Search

arXiv subjects

Márton Naszódi

Publications and source records attributed to Márton Naszódi.

38 records · Page 3Linked to original sources

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↗

On the Transversal Number and VC-Dimension of Families of Positive Homothets of a Convex Body

Let F be a family of positive homothets (or translates) of a given convex body K in R^n. We investigate two approaches to measuring the complexity of F. First, we find an upper bound on the transversal number $τ(F)$ of F in terms of $n$ and the independence number $ν(F)$. This question is motivated by a problem of Grünbaum. Our bound $τ(F)\le 2^n \binom{2n}{n} (n \log n + \log\log n + 5n) ν(F)$ is exponential in n, an improvement from the previously known bound of Kim, Nakprasit, Pelsmajer and Skokan, which was of order n^n. By a lower bound, we show that the right order of magnitude is exponential in n. Next, we consider another measure of complexity, the Vapnik--Chervonenkis dimension of F. We prove that this quantity is at most 3 if n=2 and is infinite for some F if n>2. This settles a conjecture of Günbaum: Show that the maximum dual VC-dimension of a family of positive homothets of a given convex body K in R^n is n+1. This conjecture was disproved by Naiman and Wynn, who constructed a counterexample of dual VC-dimension $\lfloor 3n/2\rfloor$. Our result implies that no upper bound exists.

math.MG↗