Abstract

In this paper we establish the Cayley expansion theory on factored and shortest expansions of typical Cayley expressions in two- and three-dimensional projective geometry. We set up a group of Cayley factorization formulae based on the classification of Cayley expansions. We continue to establish three powerful simplification techniques in bracket computation. On top of the Cayley expansions and simplifications, together with a set of elimination rules, we design an algorithm that can produce extremely short proofs in two- and three-dimensional projective geometry. The techniques developed here can be immediately applied to other symbolic computation tasks involving brackets.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call