Prodsimplicial-neighborly polytopes
From MaRDI portal
Abstract: Simultaneously generalizing both neighborly and neighborly cubical polytopes, we introduce PSN polytopes: their k-skeleton is combinatorially equivalent to that of a product of r simplices. We construct PSN polytopes by three different methods, the most versatile of which is an extension of Sanyal and Ziegler's "projecting deformed products" construction to products of arbitrary simple polytopes. For general r and k, the lowest dimension we achieve is 2k+r+1. Using topological obstructions similar to those introduced by Sanyal to bound the number of vertices of Minkowski sums, we show that this dimension is minimal if we additionally require that the PSN polytope is obtained as a projection of a polytope that is combinatorially equivalent to the product of r simplices, when the dimensions of these simplices are all large compared to k.
Recommendations
Cites work
- scientific article; zbMATH DE number 1241836 (Why is no real title available?)
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- Construction and analysis of projected deformed products
- Kneser's conjecture, chromatic number, and homotopy
- Lectures on Polytopes
- Neighborly cubical polytopes
- Neighborly cubical polytopes and spheres
- Non-projectability of polytope skeleta
- Projected products of polygons
- Topological obstructions for vertex numbers of Minkowski sums
- Triangulations. Structures for algorithms and applications
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
Cited in
(10)- Graphs, skeleta and reconstruction of polytopes
- Construction and analysis of projected deformed products
- Non-projectability of polytope skeleta
- Mixture decompositions of exponential families using a decomposition of their sample spaces
- A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes
- Polyhedral graph abstractions and an approach to the linear Hirsch conjecture
- Relative Stanley-Reisner theory and upper bound theorems for Minkowski sums
- The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores theorem
- Polytopality and Cartesian products of graphs
- Polyhedral products for connected sums of simplicial complexes
This page was built for publication: Prodsimplicial-neighborly polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q542391)
