Premium
Convex polyhedra with minimum and maximum names
Author(s) -
Voytekhovsky Yury L.
Publication year - 2017
Publication title -
acta crystallographica section a
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.742
H-Index - 83
ISSN - 2053-2733
DOI - 10.1107/s2053273317004053
Subject(s) - polyhedron , regular polygon , combinatorics , materials science , mathematics , geometry
The paper reports the combinatorial types of convex n ‐acra ( i.e . n ‐vertex polyhedra) for which the minimum (min.) and maximum (max.) names are attained. Hence, min. and max. names can be independently found without generating the whole combinatorial variety of convex n ‐acra ( e.g. by the routine recurrence Fedorov algorithm) and calculating names for each n ‐acron.