Abstract
AbstractWe construct, for all d ≥ 4, a cellulation of . We prove that these cellulations cannot be polytopal with maximal combinatorial symmetry. Such non-realizability phenomenon was first described in dimension 4 by Bokowski, Ewald and Kleinschmidt, and, to the knowledge of the author, until now there have not been any known examples in higher dimensions. As a starting point for the construction, we introduce a new class of (Wythoffian) uniform polytopes, which we call duplexes. In proving our main result, we use some tools that we developed earlier while studying perfect polytopes. In particular, we prove perfectness of the duplexes; furthermore, we prove and make use of the perfectness of another new class of polytopes which we obtain by a variant of the so-called E-construction introduced by Eppstein, Kuperberg and Ziegler.
Publisher
Canadian Mathematical Society
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Computing symmetry groups of polyhedra;LMS Journal of Computation and Mathematics;2014