Convex polyhedra with minimum and maximum names

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.