On the decidability of Diophantine problems in combinatorial geometry

DOI10.1090/S0273-0979-1987-15532-7zbMath0643.03008MaRDI QIDQ3784042

Bernd Sturmfels

Publication date: 1987

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

rational convex polytopesrational arrangements

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Decidability of theories and sets of sentences (03B25) Other problems of combinatorial convexity (52A37) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items

Oriented matroids and combinatorial neural codes, Algebraic matroids and Frobenius flocks, Representability of matroids by \(c\)-arrangements is undecidable, On the Complexity of the Planar Slope Number Problem, Nonrealizability proofs in computational geometry, All \(11_ 3\) and \(12_ 3\)-configurations are rational, Computational algebraic geometry of projective configurations, Quadratic forms over \(C[t_ 1,t_ 2\)], On the Topology and Geometric Construction of Oriented Matroids and Convex Polytopes, Diophantine undecidability of \({\mathbb{C}{}}(t_ 1,t_ 2)\), Recognition and complexity of point visibility graphs, On the matroid stratification of Grassmann varieties, specialization of coordinates, and a problem of N. White, Unnamed Item, Matroid Theory for Algebraic Geometers, Self-polar polytopes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polarity and inner products in oriented matroids
• Polytopal and nonpolytopal spheres. An algorithmic approach
• Oriented matroids
• On the coordinatization of oriented matroids
• Boundary Complexes of Convex Polytopes cannot Be Characterized Locally
• Arithmetic on curves
• Theory of Matroids