What is it about?
It is about the convex n-acra (n-vertex polyhedra) which have minimum and maximum digital names (as they have been defined in my previous papers) for given n.
Featured Image
Why is it important?
It is a part of an algebraic theory on how to name and operate with the convex polyhedra, especially with the combinatorially asymmetric (primitive triclinic) ones forming overwhelming majority in their whole variety.
Perspectives
The paper gives the possibility to formulate some theorems on how the digital names of the convex polyhedra are spread on a real line.
Voytekhovsky Yury
Read the Original
This page is a summary of: Convex polyhedra with minimum and maximum names, Acta Crystallographica Section A Foundations and Advances, April 2017, International Union of Crystallography,
DOI: 10.1107/s2053273317004053.
You can read the full text:
Contributors
The following have contributed to this page
