math.MG — Metric Geometry
Illumination of complex convex bodies
For every complex -unconditional convex body , we prove \[ \operatorname{ill}(K)\le (2^{m+1}-1)\binom nm+\sum_{k=m+1}^{n}\binom nk-(n-m), \qquad m=\lceil2n/3\rceil. \] This bound is asymptotic to . We further obtain and , where is defined by an explicit scalar equation. For normalized bodies other than that contain a full coordinate -polydisc, we prove the sharp bound . We also prove the sharp bound for every normalized complex -unconditional body in other than , and the sharp bound in for every normalized non-polydisc. The four-dimensional proof includes one finite covering assertion verified by exact integer arithmetic; its complete verifier is included. Under full coordinate permutation symmetry, we improve the three-dimensional bound to by an explicit twelve-vector construction and an exact finite covering certificate. For complex Hanner bodies, we compute both illumination numbers exactly and determine the equality cases in their dimension bounds. If every extreme point has all coordinates nonzero, we prove and a quantitative strict fractional bound for normalized non-polydiscs. For real -symmetric non-cubes we obtain bounds in dimension four, in dimension five, and for every . We also determine the leading asymptotic maximum in the real -symmetric non-cube class: it is . An explicit binary construction proves this without an external coding theorem. A connection to connected domination in cube graphs improves the upper estimate to .