On the synthetic factorization of projectively invariant polynomials
From MaRDI portal
Publication:1176388
DOI10.1016/S0747-7171(08)80114-9zbMath0763.51011OpenAlexW2014707122MaRDI QIDQ1176388
Bernd Sturmfels, Walter J. Whiteley
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)80114-9
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Exterior algebra, Grassmann algebras (15A75) Projective analytic geometry (51N15)
Related Items
Geometry of configuration spaces of tensegrities ⋮ Straightening Euclidean invariants ⋮ Mechanical theorem proving in projective geometry ⋮ Cayley factorization and a straightening algorithm ⋮ 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. ⋮ Multilinear Cayley factorization ⋮ Invariant computations for analytic projective geometry ⋮ Cayley factorization and the area principle ⋮ Definable relations in finite dimensional subspace lattices with involution. II. Quantifier-free and homogeneous descriptions ⋮ On the Cayley factorization of calotte conditions ⋮ A Pascal's theorem for rational normal curves
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the exterior calculus of invariant theory
- On the application of Buchberger's algorithm to automated geometry theorem proving
- Using Gröbner bases to reason about geometry problems
- Multilinear Cayley factorization
- Invariant computations for analytic projective geometry
- Computational synthetic geometry
- The Algebraic Geometry of Stresses in Frameworks
- On the Foundations of Combinatorial Theory: IX Combinatorial Methods in Invariant Theory