Computational algebraic geometry of projective configurations

DOI10.1016/S0747-7171(08)80121-6zbMath0766.14043OpenAlexW2083292427MaRDI QIDQ1176393

Bernd Sturmfels

Publication date: 25 June 1992

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(08)80121-6

zbMATH Keywords

configurationDesargues theoremcomputation of minimum degree for final polynomialsGröbner basis of a polynomial ideal

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects of algebraic surfaces (14Q10) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items

Polycyclic configurations ⋮ Line arrangements with the maximal number of triple points ⋮ Matroid Representations and free Arrangements ⋮ Configurations and their realization ⋮ Mechanical theorem proving in projective geometry ⋮ Counting arcs in projective planes via Glynn's algorithm ⋮ Nonrealizability proofs in computational geometry ⋮ A review and prospect of readable machine proofs for geometry theorems ⋮ All \(11_ 3\) and \(12_ 3\)-configurations are rational ⋮ Automated short proof generation for projective geometric theorems with Cayley and bracket algebras. I: Incidence geometry. ⋮ Automated short proof generation for projective geometric theorems with Cayley and bracket algebras. II: Conic geometry. ⋮ Invariant computations for analytic projective geometry ⋮ From Pappus theorem to parameter spaces of some extremal line point configurations and applications ⋮ A note on N_k configurations and theorems in projective space ⋮ On the representation of configurations in projective spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonrealizability proofs in computational geometry
• New constructive methods in classical ideal theory
• Ein neuer Schließungssatz für projektive Ebenen. (A new closure theorem for projective planes)
• On the application of Buchberger's algorithm to automated geometry theorem proving
• Altshuler's sphere \(M^{10}_{425}\) is not polytopal
• Bounds for the degrees in the Nullstellensatz
• Solving systems of polynomial inequalities in subexponential time
• Multilinear Cayley factorization
• Some examples of the use of distances as coordinates for euclidean geometry
• Computational synthetic geometry
• The red book of varieties and schemes
• Arithmetic on curves
• On the real spectrum of a ring and its application to semialgebraic geometry
• On the decidability of Diophantine problems in combinatorial geometry
• Sharp Effective Nullstellensatz
• Die nichtkonstruierbare Konfiguration (10₃)