Skip to main content
Log in

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

  • Published:
Acta Applicandae Mathematica Aims and scope Submit manuscript

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

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

    Google Scholar 

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

    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.

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

    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.

    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.

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

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

    Google Scholar 

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

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

  • 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.

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

    Google Scholar 

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

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

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

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

    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.

    Google Scholar 

  • Whiteley, W. (1990). The geometry of bivariate C 2 1-splines, preprint.

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

White, N.L. Cayley factorization and a straightening algorithm. Acta Appl Math 21, 163–184 (1990). https://doi.org/10.1007/BF00053296

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00053296

AMS subject classifications (1980)

Key words

Navigation