Abstract
In this note, it is shown that the maximum number of pairwise touching translates of an -simplex is at least for , and for all such that . The current best known lower bound for general is . For and , we will also present an alternative construction to give touching simplices using Hadamard matrices.
Citation
Bas Lemmens. Christopher Parsons. "On the number of pairwise touching simplices." Involve 8 (3) 513 - 520, 2015. https://doi.org/10.2140/involve.2015.8.513
Information