Alexander Getmanenko
Families of translates and homothets of strictly convex curves are proven to possess Helly-type properties generalizing those of a circle. Weaker results are shown for arbitrary convex curves.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
In this short note we show that Helly's Intersection Theorem holds for convex sets in uniquely geodesic spaces (in particular in CAT(0) spaces) without the assumption that the convex sets are open or closed.
We prove the following Helly-type result. Let $\mathcal{C}_1,\dots,\mathcal{C}_{3d}$ be finite families of convex bodies in $\mathbb{R}^d$. Assume that for any colorful selection of $2d$ sets, $C_{i_k}\in \mathcal{C}_{i_k}$ for each $1\leq k\leq 2d$ with $1\leq i_1<\dots<i_{2d}\leq 3d$, the intersection $\bigcap\limits_{k=1}^{2d} C_{i_k}$ is of volume at least 1. Then there is an $1\leq i \leq 3d$ such that $\bigcap\limits_{C\in \mathcal{C}_i} C$ is of volume at least $d^{-O(d^2)}$.
The main results here are two Helly type theorems for the sum of (at most) unit vectors in a normed plane. Also, we give a new characterization of centrally symmetric convex sets in the plane.
We study a certain Helly-type question by Konrad Swanepoel. Assume that $X$ is a set of points such that every $k$-subset of $X$ is in centrally symmetric convex position, is it true that $X$ must also be in centrally symmetric convex position? It is easy to see that this is false if $k\le 5$, but it may be true for sufficiently large $k$. We investigate this question and give some partial results.
Positive bases, cones, Helly type theorems
本文研究凸体族交集中存在 $k$ 维锥的有限判定条件，证明了具有 $\max\{d+1,2(d-k+1)\}$ 界的 Helly 型定理，并借助凸锥线性空间维数的 Helly 型结果完成论证。
We study versions of Helly's theorem that guarantee that the intersection of a family of convex sets in $R^d$ has a large diameter. This includes colourful, fractional and $(p,q)$ versions of Helly's theorem. In particular, the fractional and $(p,q)$ versions work with conditions where the corresponding Helly theorem does not. We also include variants of Tverberg's theorem, Bárány's point selection theorem and the existence of weak epsilon-nets for convex sets with diameter estimates.
We prove the following sparse approximation result for polytopes. Assume that $Q$ is a polytope in John's position. Then there exist at most $2d$ vertices of $Q$ whose convex hull $Q'$ satisfies $Q \subseteq - 2d^2 \, Q'$. As a consequence, we retrieve the best bound for the quantitative Helly-type result for the volume, achieved by Brazitikos, and improve on the strongest bound for the quantitative Helly-type theorem for the diameter, shown by Ivanov and Naszódi: We prove that given a finite family $\mathcal{F}$ of convex bodies in $\mathbb{R}^d$ with intersection $K$, we may select at most $…
We prove that for a topological space X with the property that $H_p(U)=0$ for $p\geq d$ and every open subset $U$ of $X$, a finite family of open sets in $X$ has nonempty intersection if for any subfamily of size $j$, $1\leq j \leq d+1$, the $(d-j)$-dimensional homology group of its intersection is zero. We use this theorem to prove new results concerning transversal affine planes to families of convex sets.
We introduce a notion of halfspace for Hadamard manifolds that is natural in the context of convex optimization. For this notion of halfspace, we generalize a classic result of Grünbaum, which itself is a corollary of Helly's theorem. Namely, given a probability distribution on the manifold, there is a point for which all halfspaces based at this point have at least $\frac{1}{n+1}$ of the mass. As an application, the gradient oracle complexity of convex optimization is polynomial in the parameters defining the problem.
We provide a new quantitative version of Helly's theorem: there exists an absolute constant $α>1$ with the following property: if $\{P_i: i\in I\}$ is a finite family of convex bodies in ${\mathbb R}^n$ with ${\rm int}\left (\bigcap_{i\in I}P_i\right )\neq\emptyset $, then there exist $z\in {\mathbb R}^n$, $s\leq αn$ and $i_1,\ldots i_s\in I$ such that \begin{equation*} z+P_{i_1}\cap\cdots\cap P_{i_s}\subseteq cn^{3/2}\left(z+\bigcap_{i\in I}P_i\right), \end{equation*} where $c>0$ is an absolute constant. This directly gives a version of the "quantitative" diameter theorem of Bárány, Katchalsk…
We introduce a new variant of quantitative Helly-type theorems: the minimal \emph{"homothetic distance"} of the intersection of a family of convex sets to the intersection of a subfamily of a fixed size. As an application, we establish the following quantitative Helly-type result for the \emph{diameter}. If $K$ is the intersection of finitely many convex bodies in $\mathbb{R}^d$, then one can select $2d$ of these bodies whose intersection is of diameter at most $(2d)^3\mathrm{diam}(K)$. The best previously known estimate, due to Brazitikos, is $c d^{11/2}$. Moreover, we confirm that the multip…
This paper presents sixteen quantitative versions of the classic Tverberg, Helly, & Caratheodory theorems in combinatorial convexity. Our results include measurable or enumerable information in the hypothesis and the conclusion. Typical measurements include the volume, the diameter, or the number of points in a lattice.
Brazitikos' results on quantititative Helly-type theorems (for the volume and for the diameter) rely on the work of Srivastava on sparsification of John's decompositions. We change this technique by a stronger recent result due to Friedland and Youssef. This, together with an appropriate selection in the accuracy of the approximation, allow us to obtain Helly-type versions which are sensitive to the number of convex sets involved.
We study $S$-convex sets, which are the geometric objects obtained as the intersection of the usual convex sets in $\mathbb R^d$ with a proper subset $S\subset \mathbb R^d$. We contribute new results about their $S$-Helly numbers. We extend prior work for $S=\mathbb R^d$, $\mathbb Z^d$, and $\mathbb Z^{d-k}\times\mathbb R^k$; we give sharp bounds on the $S$-Helly numbers in several new cases. We considered the situation for low-dimensional $S$ and for sets $S$ that have some algebraic structure, in particular when $S$ is an arbitrary subgroup of $\mathbb R^d$ or when $S$ is the difference betw…
Research on Helly-type theorems in combinatorial convex geometry has produced volumetric versions of Helly's theorem using witness sets and quantitative extensions of Doignon's theorem. This paper combines these philosophies and presents quantitative Helly-type theorems for the integer lattice with axis-parallel boxes as witness sets. Our main result shows that, while quantitative Helly numbers for the integer lattice grow polynomially in each fixed dimension, their variants with boxes as witness sets are uniformly bounded. We prove several colorful and fractional variations on this theorem. W…
A Helly-type theorem for diameter provides a bound on the diameter of the intersection of a finite family of convex sets in $\mathbb{R}^d$ given some information on the diameter of the intersection of all sufficiently small subfamilies. We prove fractional and colorful versions of a longstanding conjecture by Bárány, Katchalski, and Pach. We also show that a Minkowski norm admits an exact Helly-type theorem for diameter if and only if its unit ball is a polytope and prove a colorful version for those that do. Finally, we prove Helly-type theorems for the property of ``containing $k$ colinear i…
We study two combinatorial parameters, which we denote by f(S) and h(S), associated to an arbitrary set S \subseteq R^d, where d \in N. In the nondegenerate situation, f(S) is the largest possible number of facets of a d-dimensional polyhedron L such that the interior of L is disjoint with S and L is inclusion-maximal with respect to this property. The parameter h(S) is the Helly number of the family of all sets that can be given as the intersection of S with a convex subset of R^d. We obtain the inequality f(S) \le h(S) for an arbitrary S and the equality f(S)=h(S) for every discrete S. Furth…
Improved Helly numbers of product sets
本文改进了形如 $A^d$ 的乘积集的 Helly 数上界，涵盖指数网格及同余关系定义的整数集，给出了更紧的界。
We show that for any compact convex set $K$ in $\mathbb{R}^d$ and any finite family $\mathcal{F}$ of convex sets in $\mathbb{R}^d$, if the intersection of every sufficiently small subfamily of $\mathcal{F}$ contains an isometric copy of $K$ of volume $1$, then the intersection of the whole family contains an isometric copy of $K$ scaled by a factor of $(1-\varepsilon)$, where $\varepsilon$ is positive and fixed in advance. Unless $K$ is very similar to a disk, the shrinking factor is unavoidable. We prove similar results for affine copies of $K$. We show how our results imply the existence of …
We prove several exact quantitative versions of Helly's and Tverberg's theorems, which guarantee that a finite family of convex sets in $R^d$ has a large intersection. Our results characterize conditions that are sufficient for the intersection of a family of convex sets to contain a "witness set" which is large under some concave or log-concave measure. The possible witness sets include ellipsoids, zonotopes, and $H$-convex sets. Our results also bound the complexity of finding the best approximation of a family of convex sets by a single zonotope or by a single $H$-convex set. We obtain colo…
The Quantitative Fractional Helly theorem
该研究结合分数Helly定理与体积定量定理得到最优结果，建立了$(p,q)$定理的定量版本，并推广了定量Helly定理的直径版本。
Semimodules over idempotent semirings like the max-plus or tropical semiring have much in common with convex cones. This analogy is particularly apparent in the case of subsemimodules of the n-fold cartesian product of the max-plus semiring it is known that one can separate a vector from a closed subsemimodule that does not contain it. We establish here a more general separation theorem, which applies to any finite collection of closed semimodules with a trivial intersection. In order to prove this theorem, we investigate the spectral properties of certain nonlinear operators called here idemp…
In 1940, Luis Santaló proved a Helly-type theorem for line transversals to boxes in R^d. An analysis of his proof reveals a convexity structure for ascending lines in R^d that is isomorphic to the ordinary notion of convexity in a convex subset of R^{2d-2}. This isomorphism is through a Cremona transformation on the Grassmannian of lines in P^d, which enables a precise description of the convex hull and affine span of up to d ascending lines: the lines in such an affine span turn out to be the rulings of certain classical determinantal varieties. Finally, we relate Cremona convexity to a new c…
Convex geometry over ordered hyperfields
本文开创有序超域上的凸几何研究，定义凸集与半空间，证明Helly、Radon和Carathéodory定理的超域类比，并分类半空间分离成立及严格有序超域。
We show quantitative versions of classic results in discrete geometry, where the size of a convex set is determined by some non-negative function. We give versions of this kind for the selection theorem of Bárány, the existence of weak epsilon-nets for convex sets and the $(p,q)$ theorem of Alon and Kleitman. These methods can be applied to functions such as the volume, surface area or number of points of a discrete set. We also give general quantitative versions of the colorful Helly theorem for continuous functions.
Colorful Intersections and Tverberg Partitions
本文证明了在离散几何中的彩色Helly定理和Tverberg定理之间进行插值的定理，展示了满足特定条件的凸集族必然存在Tverberg k-划分，并扩展了关于r维横截的相关工作。
We investigate the 2-center problem for arbitrary strictly convex, centrally symmetric curves instead of usual circles. In other words, we extend the 2-center problem (from the Euclidean plane) to strictly convex normed planes, since any strictly convex, centrally symmetric curve can be interpreted as (unit) circle of such a normed plane. Thus we generalize the respective algorithmical approach given by J. Hershberger for the Euclidean plane. We show that the corresponding decision problem can be solved in $O(n^2\log\, n)$ time. In addition, we prove various theorems on the notions of ball hul…
Perimeter approximation of convex discs in the hyperbolic plane and on the sphere
研究双曲平面和球面上凸盘的周长近似问题，证明双曲平面中凸盘的最佳近似多边形始终内接于盘，而球面则不成立。
Pál's isominwidth inequality for ball convex bodies in planes of constant curvature
本文在欧氏、双曲和球面平面中，对r-球凸体证明了等宽不等式，推广了Pál经典结果。
On generalized disc-polygons in plane convex bodies with a higher degree of smoothness
本文证明了平滑平面凸体中随机 $L$-凸多边形的顶点数期望与遗漏面积的幂级数展开式，扩展了已有渐近公式并推及 $L$-凸浮体与相对仿射表面积。
If K' and K are convex bodies of the plane such that K' is a subset of K then the perimeter of K' is not greater than the perimeter of K. We obtain the following generalization of this fact. Let K be a convex compact body of the plane with the perimeter p and the diameter d and r>1 be an integer. Let s be the smallest number such that for any curve of length greater than s contained in K there is a straight line intersecting the curve at least in r+1 different points. Then s=rp/2 if r is even and s=(r-1)p/2+d if r is odd.
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 pe…
A necessary and sufficient condition for $k$-transversals
本文通过拓扑方法，给出了实数和复数域中凸集族存在$k$-截集的必要且充分条件，并推广了Helly定理和Goodman-Pollack-Wenger定理。
We present an exhaustive search of all families of convex pentagons which tile the plane. This research shows that there are no more than the already 15 known families. In particular, this implies that there is no convex polygon which allows only non-periodic tilings.
With the geometric background provided by Alonso, Martini, and Spirova on the location of circumcenters of triangles in normed planes, we show the validity of the Elzinga--Hearn algorithm and the Shamos--Hoey algorithm for solving the minimal enclosing disk problem in strictly convex normed planes.
Extending results of Hershberger and Suri for the Euclidean plane, we show that ball hulls and ball intersections of sets of $n$ points in strictly convex normed planes can be constructed in $O(n \log n)$ time. In addition, we confirm that, like in the Euclidean subcase, the $2$-center problem with constrained circles can be solved also for strictly convex normed planes in $O(n^2)$ time. Some ideas for extending these results to more general types of normed planes are also presented.
After surveying some known properties of compact convex sets in the plane, we give a two rigorous proofs of the general feeling that supporting lines can be slide-turned slowly and continuously. Targeting a wide readership, our treatment is elementary on purpose.
Extremal Banach-Mazur distance between a symmetric convex body and an arbitrary convex body on the plane
本文证明在平面上，若对称凸体与另一凸体的Banach-Mazur距离达到极值2，则该凸体必为三角形。
We prove an extension of a ham sandwich theorem for families of lines in the plane by Dujmović and Langerman. Given two sets $A, B$ of $n$ lines each in the plane, we prove that it is possible to partition the plane into $r$ convex regions such that the following holds. For each region $C$ of the partition there is a subset of $c_r n^{1/r}$ lines of $A$ whose pairwise intersections are in $C$, and the same holds for $B$. In this statement $c_r$ only depends on $r$. We also prove that the dependence on $n$ is optimal.
We use results of [6] to enlarge our knowledge of the approximate fixed point property (AFPP) for digital images in $\mathbb{Z}^2$. In particular, we study conditions under which the union of two convex digital disks has the AFPP.
A new class of plurisubharmonic functions on the octonionic plane O^2= R^{16} is introduced. An octonionic version of theorems of A.D. Aleksandrov and Chern- Levine-Nirenberg, and Blocki are proved. These results are used to construct new examples of continuous translation invariant valuations on convex subsets of O^2=R^{16}. In particular a new example of Spin(9)-invariant valuation on R^{16} is given.
The Honeycomb Conjecture in normed planes and an alpha-convex variant of a theorem of Dowker
本文研究了normed平面中的蜂窝猜想，证明了正凸平铺的平均平方周长最小，并探讨了与Dowker定理α-凸变种相关的联系，进一步给出了关于平铺单元等周比的问题解答。
Old problem revisited: Which equilateral convex polygons tile the plane?
本文重探等边凸多边形平面密铺问题，基于M. Rao的五边形密铺结果，简化证明了Hirschhorn和Hunt的密铺定理，并概述了与准晶体的可能联系。
It is well known that the lattice packing density and the lattice covering density of a triangle are $\frac{2}{3}$ and $\frac{3}{2}$ respectively. We also know that the lattices that attain these densities both are unique. Let $δ_{L}(K)$ and $\vartheta_{L}(K)$ denote the lattice packing density and the lattice covering density of $K$, respectively. In this paper, I study the lattice packings and coverings for a special class of convex disks, which includes all triangles and convex quadrilaterals. In particular, I determine the densities $δ_{L}(Q)$ and $\vartheta_{L}(Q)$, where $Q$ is an arbitr…
We define a $C(k)$ to be a family of $k$ sets $F_1,\dots,F_k$ such that $\textrm{conv}(F_i\cup F_{i+1})\cap \textrm{conv}(F_j\cup F_{j+1})=\emptyset$ when $\{i,i+1\}\cap \{j,j+1\}=\emptyset$ (indices are taken modulo $k$). We show that if $\mathcal{F}$ is a family of compact, convex sets that does not contain a $C(k)$, then there are $k-2$ lines that pierce $\mathcal{F}$. Additionally, we give an example of a family of compact, convex sets that contains no $C(k)$ and cannot be pierced by $\left\lceil \frac{k}{2} \right\rceil -1$ lines.
Undecidability of Translational Tiling of the Plane with Orthogonally Convex Polyominoes
针对仅由几何形状决定的平面平移铺砌问题，本文摆脱以往极凹铺砌块构造，证明用一组 7 个正交凸多联骨牌铺砌平面仍不可判定。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。