The algebraic geometry of motions of bar-and-body frameworks
SIAM Journal on Algebraic and Discrete Methods
Multilinear cayley factorization
Journal of Symbolic Computation
Computational algebraic geometry of projective configurations
Journal of Symbolic Computation
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
On the synthetic factorization of projectively invariant polynomials
Journal of Symbolic Computation
Vectorial Equations Solving for Mechanical Geometry Theorem Proving
Journal of Automated Reasoning
Journal of Symbolic Computation
| Hi-index | 0.00 |
This paper focuses on two underlying questions for symbolic computations in projective geometry:IHow should a projective geometric property be written analytically? A first order formula in the language of fields which expresses a ''projective geometric property'' is translated, by an algorithm, into a restricted class of formulas in the analytic geometric language of brackets (or invariants). This special form corresponds to statements in synthetic projective geometry and the algorithm is a basic step towards translation back into synthetic geometry. IIHow are theorems of analytic geometry proven? Axioms for the theorems of analytic projective geometry are given in the invariant language. Identities derived form Hubert's Nullstellensatz then play a central role in the proof. Prom a proof of an open theorem about ''geometric properties'', over all fields, or over ordered fields, an algorithm derives Nullstellensatz identities - giving maximal algebraic simplicity, and maximal information in the proof. The results support the proposal that computational analytic projective geometry should be carried out directly with identities in the invariant language.