Complete enumeration of small realizable oriented matroids
From MaRDI portal
Publication:1943649
DOI10.1007/s00454-012-9470-0zbMath1278.52014arXiv1204.0645OpenAlexW1551329641MaRDI QIDQ1943649
Hiroyuki Miyata, Sonoko Moriyama, Komei Fukuda
Publication date: 20 March 2013
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.0645
Exact enumeration problems, generating functions (05A15) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Other designs, configurations (05B30) Oriented matroids in discrete geometry (52C40)
Related Items
The Lower Bound Theorem for $d$-Polytopes with $2{d}+1$ Vertices, Reconstructibility of Matroid Polytopes, Enumerating Neighborly Polytopes and Oriented Matroids, Minimum number of edges of polytopes with \(2d+2\) vertices, On moments of a polytope, Realizability and inscribability for simplicial polytopes via nonlinear optimization, Characterizing face and flag vector pairs for polytopes, Polytopes close to being simple, The visible-volume function of a set of cameras is continuous, piecewise rational, locally Lipschitz, and semi-algebraic in all dimensions, The numbers of edges of 5-polytopes with a given number of vertices, Combining realization space models of polytopes, Color-dressed generalized biadjoint scalar amplitudes: local planarity, On the reconstruction of polytopes, Enumeration of PLCP-orientations of the 4-cube, Enumeration of 2-level polytopes, Complexity reduction for sign configurations through the KP II equation and its information-theoretic aspects, polyDB: A Database for Polytopes and Related Objects, The geometry of gaussoids, Two-Level Polytopes with a Prescribed Facet, Many order types on integer grids of polynomial size, Small covers and quasitoric manifolds over neighborly polytopes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complete enumeration of the 4-polytopes and 3-spheres with eight vertices
- On the finding of final polynomials
- Counting \(d\)-polytopes with \(d+3\) vertices
- Abstract order type extension and new results on the rectilinear crossing number
- Nonrealizability proofs in computational geometry
- The Holt-Klee condition for oriented matroids
- Simplicial cells in arrangements and mutations of oriented matroids
- The number of faces of a simplicial convex polytope
- On the combinatorial classification of nondegenerate configurations in the plane
- Proof of Grünbaum's conjecture on the stretchability of certain arrangements of pseudolines
- The classification of simplicial 3-spheres with nine vertices into polytopes and nonpolytopes
- A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes
- Oriented matroids
- Isolating points by lines in the plane
- Generation of oriented matroids --- a graph theoretical approach
- On the coordinatization of oriented matroids
- Enumerating order types for small point sets with applications
- Two interesting oriented matroids
- Realization spaces of polytopes
- On the Topology and Geometric Construction of Oriented Matroids and Convex Polytopes
- Lectures on Polytopes
- Convex Polytopes
- Oriented Matroids
- An enumeration of simplicial 4-polytopes with 8 vertices
- The number of d ‐polytopes with d +3 vertices