Prodsimplicial-neighborly polytopes

DOI10.1007/S00454-010-9311-YzbMATH Open1223.52005arXiv0908.4177OpenAlexW2001708423MaRDI QIDQ542391FDOQ542391

Authors: Benjamin Matschke, Julian Pfeifle, Vincent Pilaud 

Publication date: 10 June 2011

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/0908.4177

Recommendations

• Construction and analysis of projected deformed products
• scientific article; zbMATH DE number 3892082
• Neighborly cubical polytopes and spheres
• Neighborly cubical polytopes
• Constructions and obstructions for extremal polytopes

zbMATH Keywords

polytope projectionsneighborly polytopesdeformed productneighborly cubical polytopesprodsimplicial (PSN)product of simplicesskeleta preserving projection

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)

Cites Work

• Lectures on Polytopes
• Triangulations. Structures for algorithms and applications
• Neighborly cubical polytopes
• Title not available (Why is that?)
• 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
• Kneser's conjecture, chromatic number, and homotopy
• Topological obstructions for vertex numbers of Minkowski sums
• Construction and analysis of projected deformed products
• Title not available (Why is that?)
• Projected products of polygons
• Non-projectability of polytope skeleta
• Neighborly cubical polytopes and spheres

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)