Enumerating Neighborly Polytopes and Oriented Matroids

DOI10.1080/10586458.2015.1015084zbMath1370.52018arXiv1408.0688OpenAlexW1939927341MaRDI QIDQ3194584

Hiroyuki Miyata, Arnau Padrol

Publication date: 20 October 2015

Published in: Experimental Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

oriented matroidneighborly polytopeenumeration of combinatorial types

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Oriented matroids in discrete geometry (52C40)

Related Items (6)

General non-realizability certificates for spheres with linear programming ⋮ Realizability and inscribability for simplicial polytopes via nonlinear optimization ⋮ Transversals and colorings of simplicial spheres ⋮ On \(k\)-neighborly reorientations of oriented matroids ⋮ Six Topics on Inscribable Polytopes ⋮ Small covers and quasitoric manifolds over neighborly polytopes

Uses Software

• nauty
• SCIP
• TOPCOM
• relsat

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complete enumeration of the 4-polytopes and 3-spheres with eight vertices
• On the generalized lower bound conjecture for polytopes and spheres
• Many neighborly polytopes and oriented matroids
• A counterexample to the Hirsch conjecture
• Neighborly 6-polytopes with 10 vertices
• Neighborly polytopes and oriented matroids
• On the finding of final polynomials
• Matroid enumeration for incidence geometry
• SCIP: solving constraint integer programs
• Abstract order type extension and new results on the rectilinear crossing number
• Points surrounding the origin
• Neighborly polytopes
• Altshuler's sphere \(M^{10}_{425}\) is not polytopal
• Polytopal and nonpolytopal spheres. An algorithmic approach
• On the combinatorial classification of nondegenerate configurations in the plane
• The classification of simplicial 3-spheres with nine vertices into polytopes and nonpolytopes
• Every simplicial polytope with at most \(d+4\) vertices is a quotient of a neighborly polytope
• On the generation of oriented matroids
• Enumerating order types for small point sets with applications
• Complete enumeration of small realizable oriented matroids
• Neighborly 4-polytopes with 9 vertices
• Simplicial neighbourly 5-polytopes with nine vertices
• Practical graph isomorphism. II.
• The Number of Rooted Convex Polyhedra
• A new branch of enumerative graph theory
• Neighborly 4-Polytopes and Neighborly Combinatorial 3-Manifolds with Ten Vertices
• Convex Polytopes
• The number of simplicial neighbourly d ‐polytopes with d +3 vertices
• The number of neighbourly d ‐polytopes with d +3 vertices
• Realization spaces of 4-polytopes are universal
• Edge-Graph Diameter Bounds for Convex Polytopes with Few Facets
• More bounds on the diameters of convex polytopes
• An enumeration of simplicial 4-polytopes with 8 vertices
• The maximum numbers of faces of a convex polytope
• Diameters of Polyhedral Graphs
• Cocircuit graphs and efficient orientation reconstruction in oriented matroids

This page was built for publication: Enumerating Neighborly Polytopes and Oriented Matroids