Skip to main content

Cayley Factorization and a Straightening Algorithm

Three talks presented to the Computational Algebra Seminar Department of Mathematics, University of Rome “Tor Vergata” May 9–11, 1990

  • Chapter
Topics in Computational Algebra

Abstract

An important problem in computer-aided geometric reasoning is to automatically find geometric interpretations for algebraic expressions. For projective geometry this question can be reduced to the Cayley factorization problem. Before describing this problem, we give a brief introduction to the Cayley algebra for those readers not already familiar with it. The Cayley algebra is essentially the same as the classical Grassmann algebra. This algebra provides projectively invariant algebraic interpretations of synthetic geometric statements. A more thorough exposition may be found in Barnabei et al. (1985), Doubilet et al. (1974), or Rota & Stein (1976).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Barnabei, M., Brini, A., Rota, G.-C. (1985). On the exterior calculus of invariant theory. J. Algebra 96, 120–160.

    Article  MathSciNet  MATH  Google Scholar 

  • Bokowski, J., Sturmfels, B. (1987). Polytopal and nonpolytopal spheres: an algorithmic approach. Israel J. Math. 57, 257–271.

    Article  MathSciNet  MATH  Google Scholar 

  • Chou, S., Schelter, W.F., Yang, J. (1987). Characteristic sets and Gröbner bases in geometry theorem proving. In:(H. Crapo, ed.) Computer-aided geometric reasoning, pp. 29–56. INRIA Rocquencourt, France.

    Google Scholar 

  • Crapo, H. (1991). Invariant-theoretic methods in scene analysis and structural mechanics, J. Symbolic Computation, to appear.

    Google Scholar 

  • Désarménien, J., Kung, J. P. S., Rota, G.-C. (1978). Invariant theory, Young bitableaux, and combinatorics. Advances in Math. 27, 63–92.

    Article  MathSciNet  MATH  Google Scholar 

  • Doubilet, P., Rota, G.-C., Stein, J. (1974). On the foundations of combinatorial theory IX: Combinatorial methods in invariant theory, Studies in Applied Math. 57, 185–216.

    MathSciNet  Google Scholar 

  • Grosshans, F., Rota, G.-C., Stein, J. (1987). Invariant theory and superalgebras, C.B.M.S. Regional Conference Series, No. 69, American Math. Society.

    Google Scholar 

  • Havel, T. (1991). The use of distances as coordinates in computer-aided proofs of theorems in Euclidean geometry, J. Symbolic Computation, to appear.

    Google Scholar 

  • Kutzler, B., Stifter, S. (1986). On the application of Buchberger’s algorithm to automated geometry theorem proving, J. Symbolic Computation 2, 389–398.

    Article  MathSciNet  MATH  Google Scholar 

  • McMillan, T. (1990). Invariants of Antisymmetric Tensors. Ph.D. thesis, University of Florida, Gainesville, FL, in preparation.

    Google Scholar 

  • McMillan, T., White, N. (1991). The dotted straightening algorithm, J. Symbolic Computation, to appear.

    Google Scholar 

  • Rota, G.-C., Stein, J. (1976). Applications of Cayley algebras, Accademia Nazionale dei Lincei atti dei Convegni Lincei 17, Colloquio Internazionale sulle Teorie Combinatoire, Tomo 2, Roma.

    Google Scholar 

  • Rota, G.-C., Stein, J. (1986). Symbolic method in invariant theory, Proc. Nat. Acad. Sci. U.S.A., Mathematics 83, 844–847.

    Article  MathSciNet  MATH  Google Scholar 

  • Rota, G.-C., Stein, J., Wang, R. (to appear). Supersymmetric algebra, supersymmetric spaces, and invariant theory.

    Google Scholar 

  • Sturmfels, B., Whiteley, W. (1991). On the synthetic factorization of projectively invariant polynomials, J. Symbolic Computation, to appear.

    Google Scholar 

  • White, N., (1991). Multilinear Cayley factorization, J. Symbolic Computation, to appear.

    Google Scholar 

  • White, N., Whiteley, W. (1983). The algebraic geometry of stresses in frameworks. S.I.A.M. J. Algebraic and Discrete Methods 4, 481–511.

    Article  MathSciNet  MATH  Google Scholar 

  • White, N., Whiteley, W. (1987). The algebraic geometry of motions of bar-and-body frameworks, S.I.A.M. J. Algebraic and Discrete Methods 8, 1–32.

    Article  MathSciNet  MATH  Google Scholar 

  • Whiteley, W. (1990). The geometry of bivariate C<Stack><Subscript>2</Subscript><Superscript>1</Superscript></Stack>-splines, preprint.

    Google Scholar 

  • Young, A. (1928). On quantitative substitutional analysis, (3rd paper), Proc. London Math Soc., Ser. 2, 28, 255–292.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

White, N.L. (1990). Cayley Factorization and a Straightening Algorithm. In: Cattaneo, G.M.P., Strickland, E. (eds) Topics in Computational Algebra. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-3424-8_7

Download citation

  • DOI: https://doi.org/10.1007/978-94-011-3424-8_7

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-5514-7

  • Online ISBN: 978-94-011-3424-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics