17 citations · 73 across the 26 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
math.MG2015
Six topics on inscribable polytopes
Arnau Padrol, Günter M. Ziegler
Inscribability of polytopes is a classic subject but also a lively research area nowadays. We illustrate this with a selection of well-known results and recent developments on six…
math.MG2015★ 9 cited
Scribability problems for polytopes
Hao Chen, Arnau Padrol
In this paper we study various scribability problems for polytopes. We begin with the classical -scribability problem proposed by Steiner and generalized by Schulte, which asks…
math.CO2015
Polytopes with few vertices and few facets
Arnau Padrol
In this note we prove that the number of combinatorial types of -polytopes with vertices and facets is bounded by a constant independent of .