Convex polyhedra with minimum and maximum names

Abstract

The paper reports the combinatorial types of convexn-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 convexn-acra (e.g.by the routine recurrence Fedorov algorithm) and calculating names for eachn-acron.