Exploració per autor "Pfeifle, Julián"
Ara es mostren els items 21-26 de 26
-
Polygons as sections of higher-dimensional polytopes
(2015-02-09)
Article
Accés obertWe show that every heptagon is a section of a 3-polytope with 6 vertices. This implies that every n-gon with n >= 7 can be obtained as a section of a (2 + [n/7])-dimensional polytope with at most [6n/7] vertices; and ... -
Positive Plücker tree certificates for non-realizability
(2022-01-24)
Article
Accés obertWe introduce a new method for finding a non-realizability certificate of a simplicial sphere S: we exhibit a monomial combination of classical 3-term Pl¨ucker relations that yields a sum of products of determinants that ... -
Prodsimplicial-neighborly polytopes
(2010-11)
Article
Accés obertWe introduce PSN polytopes whose k-skeleton is combinatorially equivalent to that of a product of r simplices. They simultaneously generalize both neighborly and neighborly cubical polytopes. We construct PSN polytopes ... -
Root polytopes and growth series of root lattices
(2011)
Article
Accés obertThe convex hull of the roots of a classical root lattice is called a root polytope. We determine explicit unimodular triangulations of the boundaries of the root polytopes associated to the root lattices $A_n$, $C_n$, and ... -
Showing non-realizability of spheres by distilling a tree
(2021)
Text en actes de congrés
Accés obertIn [Zhe20a], Hailun Zheng constructs a combinatorial 3-sphere on 16 vertices whose graph is the complete 4-partite graph K4;4;4;4. Such a sphere seems unlikely to be realizable as the boundary complex of a 4-dimensional ... -
The rotation graph of k-ary trees is Hamiltonian
(Crete University Press, 2006)
Article
Accés restringit per política de l'editorialIn this paper we show that the graph of k-ary trees, connected by rotations, contains a Hamilton cycle. Our proof is constructive and thus provides a cyclic Gray code for k-ary trees. Furthermore, we identify a basic ...
