Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Convex polyhedra with minimum and maximum names

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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Crystallographica Section A Foundations of Crystallography Wiley

Convex polyhedra with minimum and maximum names

Download PDF
3 pages

Loading next page...
 
/lp/wiley/convex-polyhedra-with-minimum-and-maximum-names-L3cPz2kg2w

References (5)

Publisher
Wiley
Copyright
Copyright © 2017 Wiley Subscription Services, Inc., A Wiley Company
ISSN
0108-7673
eISSN
1600-5724
DOI
10.1107/S2053273317004053
pmid
28447598
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Acta Crystallographica Section A Foundations of Crystallography – Wiley

Published: May 1, 2017

Keywords: ; ; ; ;

There are no references for this article.