arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1412.1769math.MGcs.CGmath.CO
收藏

关于凸性的Beer指数及其变式

On the Beer index of convexity and its variants

Martin Balko, Vít Jelínek, Pavel Valtr, Bartosz Walczak

摘要:

设$S$是$\mathbb{R}^d$的一个子集,它具有有限的正Lebesgue测度. $S$的凸性Beer指数$\operatorname{b}(S)$是随机一致独立选择的$S$中的两个点在$S$中相遇的概率。$S$的凸度比$\operatorname{c}(S)$是$S$的最大凸子集的勒贝格测度除以$S$的勒贝格测度。我们研究这两个自然的凸性措施之间的关系。我们证明了,只要定义了$\operatorname{b}(S)$,对于一个绝对常数$α$,每个具有单连通分量的集合$S\subseteq\mathbb{R}^2$满足$\operatorname{b}(S)\leqα\operatorname{c}(S)$。这意味着对Cabello等人的猜想的肯定回答,该估计对简单多边形成立。我们也考虑高阶推广的$\operatorname{b}(S)$。对于$1\leq k\leq d$,集合$S\subseteq\mathbb{R}^d$的凸性$k$ -指数$\operatorname{b}_k(S)$是从$S$中随机一致地独立选择的点的$(k+1)$ -元组的凸包包含在$S$中的概率。我们表明,对于每一个$d\geq 2$有一个常数$β(d)>0$,使每个集合$S\subseteq\mathbb{R}^d$满足$\operatorname{b}_d(S)\leqβ\operatorname{c}(S)$,提供$\operatorname{b}_d(S)$存在。我们提供了一个几乎匹配的下界,有一个恒定的$γ(d)>0$,使每个$\varepsilon\in(0,1)$有一组$S\subseteq\mathbb{R}^d$的勒贝格措施$1$满足$\operatorname{c}(S)\leq\varepsilon$和$\operatorname{b}_d(S)\geqγ\frac{\varepsilon}{\log_2{1/\varepsilon}}\geqγ\frac{\operatorname{c}(S)}{\log_2{1/\operatorname{c}(S)}}$。

英文摘要:

Let $S$ be a subset of $\mathbb{R}^d$ with finite positive Lebesgue measure. The Beer index of convexity $\operatorname{b}(S)$ of $S$ is the probability that two points of $S$ chosen uniformly independently at random see each other in $S$. The convexity ratio $\operatorname{c}(S)$ of $S$ is the Lebesgue measure of the largest convex subset of $S$ divided by the Lebesgue measure of $S$. We investigate the relationship between these two natural measures of convexity. We show that every set $S\subseteq\mathbb{R}^2$ with simply connected components satisfies $\operatorname{b}(S)\leqα\operatorname{c}(S)$ for an absolute constant $α$, provided $\operatorname{b}(S)$ is defined. This implies an affirmative answer to the conjecture of Cabello et al. that this estimate holds for simple polygons. We also consider higher-order generalizations of $\operatorname{b}(S)$. For $1\leq k\leq d$, the $k$-index of convexity $\operatorname{b}_k(S)$ of a set $S\subseteq\mathbb{R}^d$ is the probability that the convex hull of a $(k+1)$-tuple of points chosen uniformly independently at random from $S$ is contained in $S$. We show that for every $d\geq 2$ there is a constant $β(d)>0$ such that every set $S\subseteq\mathbb{R}^d$ satisfies $\operatorname{b}_d(S)\leqβ\operatorname{c}(S)$, provided $\operatorname{b}_d(S)$ exists. We provide an almost matching lower bound by showing that there is a constant $γ(d)>0$ such that for every $\varepsilon\in(0,1)$ there is a set $S\subseteq\mathbb{R}^d$ of Lebesgue measure $1$ satisfying $\operatorname{c}(S)\leq\varepsilon$ and $\operatorname{b}_d(S)\geqγ\frac{\varepsilon}{\log_2{1/\varepsilon}}\geqγ\frac{\operatorname{c}(S)}{\log_2{1/\operatorname{c}(S)}}$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑