On the decidability of Diophantine problems in combinatorial geometry
From MaRDI portal
Decidability of theories and sets of sentences (03B25) Convex sets in (2) dimensions (including convex curves) (52A10) Other problems of combinatorial convexity (52A37) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Recommendations
- Problems equivalent to rational Diophantine solvability
- Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy
- Questions of decidability and undecidability in Number Theory
- Computational complexities of diophantine equations with parameters
- scientific article; zbMATH DE number 3926284
Cites work
- Arithmetic on curves
- Boundary Complexes of Convex Polytopes cannot Be Characterized Locally
- scientific article; zbMATH DE number 3831953 (Why is no real title available?)
- scientific article; zbMATH DE number 3951434 (Why is no real title available?)
- scientific article; zbMATH DE number 51916 (Why is no real title available?)
- scientific article; zbMATH DE number 3244470 (Why is no real title available?)
- scientific article; zbMATH DE number 3394958 (Why is no real title available?)
- scientific article; zbMATH DE number 3053259 (Why is no real title available?)
- scientific article; zbMATH DE number 3088637 (Why is no real title available?)
- On the coordinatization of oriented matroids
- Oriented matroids
- Polarity and inner products in oriented matroids
- Polytopal and nonpolytopal spheres. An algorithmic approach
- Theory of Matroids
Cited in
(19)- Computational algebraic geometry of projective configurations
- Quadratic forms over \(C[t_ 1,t_ 2]\)
- Diophantine undecidability of \({\mathbb{C}{}}(t_ 1,t_ 2)\)
- A geometrical approach to the K-divisibility problem
- Algebraic matroids and Frobenius flocks
- On the matroid stratification of Grassmann varieties, specialization of coordinates, and a problem of N. White
- Representability of matroids by c-arrangements is undecidable
- Matroid Theory for Algebraic Geometers
- On the complexity of the planar slope number problem
- scientific article; zbMATH DE number 4161543 (Why is no real title available?)
- On the Topology and Geometric Construction of Oriented Matroids and Convex Polytopes
- Self-polar polytopes
- The twist for positroids
- Recognition and complexity of point visibility graphs
- Oriented matroids and combinatorial neural codes
- Some new results on decidability for elementary algebra and geometry
- On entropic and almost multilinear representability of matroids
- Nonrealizability proofs in computational geometry
- All \(11_ 3\) and \(12_ 3\)-configurations are rational
This page was built for publication: On the decidability of Diophantine problems in combinatorial geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3784042)
