Many neighborly polytopes and oriented matroids
From MaRDI portal
Abstract: In this paper we present a new technique to construct neighborly polytopes, and use it to prove a lower bound of ((r+d)^((r/2+d/2)^2))/(r^((r/2)^2)d^((d/2)^2)e^(3rd/4)) for the number of combinatorial types of vertex-labeled neighborly polytopes in even dimension d with r+d+1 vertices. This improves current bounds on the number of combinatorial types of polytopes. The previous best lower bounds for the number of neighborly polytopes were found by Shemer in 1982 using a technique called the Sewing Construction. We provide a simpler proof that sewing works, and generalize it to oriented matroids in two ways: to Extended Sewing and to Gale Sewing. Our lower bound is obtained by estimating the number of polytopes that can be constructed via Gale Sewing. Combining both new techniques, we are also able to construct many non-realizable neighborly oriented matroids.
Recommendations
Cites work
- A family of neighborly polytopes
- A generalized sewing construction for polytopes
- Altshuler's sphere \(M^{10}_{425}\) is not polytopal
- Construction and analysis of projected deformed products
- Cyclic polytopes and oriented matroids
- Every simplicial polytope with at most \(d+4\) vertices is a quotient of a neighborly polytope
- scientific article; zbMATH DE number 17657 (Why is no real title available?)
- scientific article; zbMATH DE number 53152 (Why is no real title available?)
- scientific article; zbMATH DE number 3639651 (Why is no real title available?)
- scientific article; zbMATH DE number 718862 (Why is no real title available?)
- scientific article; zbMATH DE number 1993723 (Why is no real title available?)
- scientific article; zbMATH DE number 2008526 (Why is no real title available?)
- scientific article; zbMATH DE number 3223483 (Why is no real title available?)
- Lectures on Polytopes
- Neighborly 4-Polytopes and Neighborly Combinatorial 3-Manifolds with Ten Vertices
- Neighborly 4-polytopes with 9 vertices
- Neighborly 6-polytopes with 10 vertices
- Neighborly inscribed polytopes and Delaunay triangulations
- Neighborly polytopes
- Neighborly polytopes and oriented matroids
- Neighbourly polytopes with few vertices
- On sign-invariance graphs of uniform oriented matroids
- polymake: a framework for analyzing convex polytopes
- Some Applications of Affine Gale Diagrams to Polytopes with Few Vertices
- The maximum numbers of faces of a convex polytope
- The number of polytopes, configurations and real matroids
- Triangulations of oriented matroids
- Triangulations. Structures for algorithms and applications
- Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
Cited in
(34)- Realizability and inscribability for simplicial polytopes via nonlinear optimization
- The flag upper bound theorem for 3- and 5-manifolds
- The universality theorem for neighborly polytopes
- Neighborly inscribed polytopes and Delaunay triangulations
- Highly neighborly centrally symmetric spheres
- Rigidity with few locations
- Ear decomposition and balanced neighborly simplicial manifolds
- Samuel Gitler and the topology of intersections of quadrics
- Cyclic polytopes, oriented matroids and intersections of quadrics
- Many triangulated odd-dimensional spheres
- Six topics on inscribable polytopes
- Extension complexity of polytopes with few vertices or facets
- Polytopes with few vertices and few facets
- Intersection patterns of finite sets and of convex sets
- Enumerating neighborly polytopes and oriented matroids
- scientific article; zbMATH DE number 1993723 (Why is no real title available?)
- scientific article; zbMATH DE number 6928867 (Why is no real title available?)
- The degree of point configurations: Ehrhart theory, Tverberg points and almost neighborly polytopes
- From singularities to polyhedral products
- New families of highly neighborly centrally symmetric spheres
- scientific article; zbMATH DE number 3892082 (Why is no real title available?)
- Constructing neighborly polytopes and oriented matroids
- Neighborly polytopes and oriented matroids
- COMBINATORIAL INSCRIBABILITY OBSTRUCTIONS FOR HIGHER DIMENSIONAL POLYTOPES
- Many neighborly spheres
- Reconstructing simplicial polytopes from their graphs and affine 2-stresses
- Positive Plücker tree certificates for non-realizability
- Face numbers: the upper bound side of the story
- On \(k\)-neighborly reorientations of oriented matroids
- Geometric, algebraic and topological combinatorics. Abstracts from the workshop held December 10--15, 2023
- On the genera of moment-angle manifolds associated with dual-neighborly polytopes: combinatorial formulas and sequences
- Graphs, skeleta and reconstruction of polytopes
- Levels in arrangements: linear relations, the g-matrix, and applications to crossing numbers
- Universality theorems for inscribed polytopes and Delaunay triangulations
This page was built for publication: Many neighborly polytopes and oriented matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393727)
