关于凸体的正同伦族的transmittance数和VC-维数
On the Transversal Number and VC-Dimension of Families of Positive Homothets of a Convex Body
摘要:
设F是R^n中给定的凸体K的正同素同构(或平移)族。我们研究了两种方法来测量F的复杂性。首先,我们找到了F的横截数$τ(F)$关于$n$和独立数$ν(F)$的一个上界。这个问题是由Grünbaum的一个问题引起的。我们的界$τ(F)\le 2^n \binom{2n}{n} (n \log n + \log\log n + 5n) ν(F)$在n中是指数的,这是对Kim,Nakprasit,Pelsmajer和Skokan已知的n^n阶界的改进。通过一个下界,我们证明了n的右数量级是指数的。接下来,我们考虑另一种复杂性度量,F的Vapnik-Chervonenkis维数。我们证明了这个数量是最多3,如果n=2,是无限的,如果n>2。这解决了Günbaum的一个猜想:证明在R^n中给定的凸体K的正同素映射族的最大对偶VC-维数是n+1。这个猜想被Naiman和Wynn否定了,他们构造了一个对偶VC维$\lfloor 3n/2\rfloor$的反例。我们的结果意味着不存在上界。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。