Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Statement

Setting as in Theorem 4.2: kk-codimensional cylinders C=B+HC=B+H, cross-sectional volume crv⁡K(C)=vol⁡d−k(B)/vol⁡d−k(PH⊥K)\operatorname{crv}_K(C)=\operatorname{vol}_{d-k}(B)/\operatorname{vol}_{d-k}(P_{H^\perp}K) (p. 2), and packings in the sense of Definition 4.1 (p. 4). B2dB_2^d is the Euclidean unit ball and ωm\omega_m the volume of B2mB_2^m.

Theorem 4.8 (p. 7). Let d>3d>3, 1≤k<d1\le k<d and δ∈(0,π/4)\delta\in(0,\pi/4). There exist kk-codimensional cylinders C1,…,CNC_1,\ldots,C_N forming a packing in B2dB_2^d with

∑i=1Ncrv⁡B2d(Ci)=1ωd−k∑i=1Nvol⁡d−k(Bi)≥cd (sin⁡δ)2−k2d−2(d−k)3/2,\sum_{i=1}^N\operatorname{crv}_{B_2^d}(C_i)=\frac1{\omega_{d-k}}\sum_{i=1}^N\operatorname{vol}_{d-k}(B_i)\ge\frac{c\sqrt d\,(\sin\delta)^{2-k}}{2^{d-2}(d-k)^{3/2}},

where cc is an absolute positive constant.

Remark 4.9 (pp. 7--8). For the cylinders of the proof, whose truncations are the convex hulls of spherical caps of geodesic radius δ\delta, the upper bound of Theorem 4.6 becomes (dk)(sin⁡δ)−k\binom dk(\sin\delta)^{-k}, so in this example the upper and lower bounds differ by a factor of order C(d,k)(sin⁡δ)−2C(d,k)(\sin\delta)^{-2}.

Proof pointer

P. 8. Take a maximal 2δ2\delta-separated set {xi}\{x_i\} on Sd−1S^{d-1} in geodesic distance. Over each xix_i build a cylinder whose base is the solid cap of geodesic radius δ\delta about xix_i in a fixed (d−k)(d-k)-dimensional subspace through xix_i; its truncation by the ball is the convex hull of the spherical cap S(xi,δ)S(x_i,\delta), so the cylinders form a packing. Maximality makes the caps S(xi,2δ)S(x_i,2\delta) cover the sphere, which bounds NN below by the reciprocal of a cap measure. Lemma 4.7 (p. 7), δ(sin⁡δ)n/(e(n+1))≤∫π/2−δπ/2(cos⁡t)n dt≤δ(sin⁡δ)n\delta(\sin\delta)^n/(e(n+1))\le\int_{\pi/2-\delta}^{\pi/2}(\cos t)^n\,dt\le\delta(\sin\delta)^n for δ∈(0,π/2)\delta\in(0,\pi/2) and n≥1n\ge1, and estimates for ωm\omega_m give the bound.

Read depth

Claims checked: Lemma 4.7, Theorem 4.8 and Remark 4.9 were read clause by clause on the print, and the proof on p. 8 was followed in outline; its final constant estimate was not rechecked.

Dependencies

Theorem 4.6 (for Remark 4.9 only).

Source. K. Bezdek and A. E. Litvak, Packing convex bodies by cylinders, Discrete Comput. Geom. 55 (2016), no. 3, 725--738, doi:10.1007/s00454-016-9760-z; labels and pages are those of arXiv:1507.05115v2 (21 November 2015), as the source card records.

Bears on

No problem page of this corpus.