contained in a hypercube - university of the ryukyus.pdfVIP

LARGE REGULAR SIMPLICES CONTAINED IN A HYPERCUBE HIROSHI MAEHARA, IMRE Z. RUZSA, AND NORIHIDE TOKUSHIGE ABSTRACT. We prove that the n-dimensional unit hypercube contains an n-dimensional regular simplex of edge length c√n, where c 0 is a constant independent of n. Let ℓ∆n be the n-dimensional regular simplex of edge length ℓ, and let ℓQn be the n-dimensional hypercube of edge length ℓ. For simplicity, we omit ℓ if ℓ = 1, e.g., Qn denotes the unit hypercube. We are interested in the maximum edge length of a regular n-dimensional simplex contained in Q . n Theorem. For every ε0 0 there is an N0 such that for every n N0 one has (1 −ε0 √n)∆n ⊂ Qn . 2 On the other hand, if ℓ∆ ⊂ Q , then ℓ ≤ √(n + 1)/2, which follows by n n comparing the circumscribed balls of ℓ∆ and Q . (Recall that the circumra- n n dius of ∆n is √n/(2n + 2).) This upper bound is reached iff there exists an Hadamard matrix of order n + 1. Schoenberg [3] pointed out that this “read- ily established fact” went back to Coxeter, see also §4 of [1]. Our lower bound given by the theorem is approximately 1/√2 of the upper bound. Proof of Theorem. For a matrix (or a vector) A = (ai j ), let us define its norm by ∥A ∥ := maxi j |ai j |. Let Jn be the n ×n all one matrix. Lemma 1. Let A = (ai j ) be an n ×n real orthogonal matrix, and let c 0 be a constant. If 1 √ ∥A ∥ ≤ (1) c n Date :