2012/09/06 by Barry Monson, B. Monson, Monson, B. +2 · 1 citation
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Metric Geometry (math.MG) #Optimization and Packing Problems #math.CO #math.MG #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1209.1167
7 pages
arxiv created 2012/09/06 · openalex publication_date 2012/09/06 · arxiv updated 2012/09/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We prove that any finite, abstract n-polytope is covered by a finite, abstract regular n-polytope.