Skip to main content

Computer and commutative algebra

  • Invited Contributions
  • Conference paper
  • First Online:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 357))

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Bayer,D. (1982) The division algorithm and the Hilbert scheme. Ph. D. Thesis Harvard

    Google Scholar 

  • Bayer,D. — Morrison, J. (1986) Standard bases and geometric invariant theory I, Initial ideals and state polytopes. Special Volume of JSC on "Computational Aspects of Commutative Algebra To appear

    Google Scholar 

  • Bayer, D. — Stillman, M. (1987, a) A criterion for detecting m-regularity. Invent. Math. 87 1–11

    Google Scholar 

  • Bayer, D. — Stillman, M. (1987, b) A theorem on refining division orders by the reverse lexicographic order. Duke Math. J. 55 321–328

    Google Scholar 

  • Brownawell, W.D. (1987). Bounds for the degrees in Nullstellensatz. Ann. of Math. 126 577–592

    Google Scholar 

  • Brundu, M. — Rossi, F. (1987) On the computation of generalized standard bases. Special Volume of JSC on "Computational Aspects of Commutative Algebra To appear

    Google Scholar 

  • Buchberger, B. (1965) Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideale. Ph.D. Thesis Innsbruck, Math. Inst.

    Google Scholar 

  • Buchberger, B. (1970). Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems. Aeq. Math. 4 374–383

    Google Scholar 

  • Caniglia, L. — Galligo, A. — Heintz, J. Some effectivity bounds in computational geometry Preprint

    Google Scholar 

  • Carrà Ferro, G. (1986) Some upper bounds for the multiplicity of an autoreduced subset of Nm and their applications. Proc. AAECC-3 Springer Lecture Notes in Computer Science 229 306–315

    Google Scholar 

  • Carrà Ferro, G. (1986) Gröbner bases and Hilbert schemes. Special Volume of JSC on "Computational Aspects of Commutative Algebra" To appear

    Google Scholar 

  • Dickson, L.E. (1913). Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. Am. J. of Math. 35 413–426

    Google Scholar 

  • Gebauer, R. — Möller, M. (1987) On an Installation of Buchberger's Algorithm. Special Volume of JSC on "Computational Aspects of Commutative Algebra" To appear

    Google Scholar 

  • Gianni, P. — Trager, B. — Zacharias, G. (1986) Gröbner bases and primary decomposition of polynomial ideals. Special Volume of JSC on "Computational Aspects of Commutative Algebra" To appear

    Google Scholar 

  • Giusti, M. (1988) Combinatorial dimension theory of algebraic varieties. Special Volume of JSC on "Computational Aspects of Commutative Algebra" To appear

    Google Scholar 

  • Hermann, G. (1926). Die Frage der endlischen vielen Schritte in der Theorie der Polynomideale. Math. Ann. 95 736–788

    Google Scholar 

  • Hilbert, D. (1890). Ãœber die Theorie der algebraischen Formen. Math. Ann. 36 473–534

    Google Scholar 

  • Hilbert, D. (1893). Ãœber die vollen Invariantensysteme. Math. Ann. 42 313–373

    Google Scholar 

  • Hironaka, H. (1964) Resolution of singularities of an algebraic variety over a field of characteristic 0. Ann. Math 79 109–326

    Google Scholar 

  • Kollar, J. (1988). Sharp effective Nullstellensatz. Preprint.

    Google Scholar 

  • Kredel, H. — Weisspfenning, V. (1988) Computing dimension and independent sets for polynomial ideals. Special Volume of JSC on "Computational Aspects of Commutative Algebra" To appear

    Google Scholar 

  • Lazard, D. (1984) Ideal bases and primary decomposition: the case of two variables. Preprint, Paris

    Google Scholar 

  • Lazard, D. (1983) Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations. Proc. EUROCAL 83 Springer Lecture Notes in Computer Science 162 146–156

    Google Scholar 

  • Macaulay, F.S. (1927) Some properties of enumeration in the theory of modular systems. Proc. London Math. Soc. 26 531–555

    Google Scholar 

  • Mayr, E.W. — Meyer A.R. (1982) The complexity of the word problems for commutative semigroups and polynomial ideals. Adv. Math. 46 305–329

    Google Scholar 

  • Miola, A. — Mora, T. (1988) Constructive lifting in graded structures; a unified view of Buchberger and Hensel methods. Special Volume of JSC on "Computational Aspects of Commutative Algebra" To appear

    Google Scholar 

  • Mora, T. (1982) An algorithm to compute the equations of tangent cones. Proc. EUROCAM 82 Springer Lecture Notes in Computer Science 144 24–31

    Google Scholar 

  • Mora, T. (1988) Seven variations on standard bases. Preprint

    Google Scholar 

  • Mora, T. — Möller, M. (1986) New constructive methods in classical ideal theory. J. Algebra 100 138–178

    Google Scholar 

  • Mora, T. — Robbiano, L. (1987) The Gröbner fan of an ideal. Special Volume of JSC on "Computational Aspects of Commutative Algebra" To appear

    Google Scholar 

  • Möller, M. (1986) On the construction of Gröbner bases using syzygies. Special Volume of JSC on "Computational Aspects of Commutative Algebra" To appear

    Google Scholar 

  • Robbiano, L. (1988) Introduction to the Theory of Gröbner Bases. To appear on Queen's Papers, Kingston Canada

    Google Scholar 

  • Robbiano, L. (1985) Term Orderings on the Polynomial Ring. Proc. EUROCAL 85, II Springer Lecture Notes in Computer Science 204 513–517

    Google Scholar 

  • Robbiano, L. (1986) On the theory of graded structures. J. Symb. Comp. 2 139–170

    Google Scholar 

  • Robbiano, L. — Valla, G. (1983) On set-theoretic complete intersections in the projective space. Rend. Sem. Mat. Milano Vol LIII 333–346

    Google Scholar 

  • Schwartz, N. (1986) Stability of Gröbner bases. Preprint

    Google Scholar 

  • Seidenberg, S. (1975) S. Construction of the integral closure of a finite integral domain. Proc. Amer. Math. Soc. 74 368–372

    Google Scholar 

  • Shannon, D. — Sweedler, M. (1987) Using Gröbner bases to determine algebra membership, split surjective algebra homomorphisms and to determine birational equivalence. Special Volume of JSC on "Computational Aspects of Commutative Algebra" To appear

    Google Scholar 

  • Stolzenberg, G. (1968) Constructive normalization of an algebraic variety. Bull. Amer. Math. Soc. 74 595–599

    Google Scholar 

  • Traverso, C. (1986) A study on algebraic algorithms: the normalization. Rend. Sem. Mat. Torino Proc. Int. Conf. Torino 1985 111–130

    Google Scholar 

  • Weispfenning, V. (1987) Constructing universal Gröbner bases Proc. AAECC 5

    Google Scholar 

  • Winkler, F. (1987) A p-adic approach to the computation of Gröbner bases. Special Volume of JSC on "Computational Aspects of Commutative Algebra To appear

    Google Scholar 

  • Zacharias, G. (1978) Generalized Gröbner Bases in commutative polynomial Rings. Bachelor Thesis M.I.T.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Teo Mora

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Robbiano, L. (1989). Computer and commutative algebra. In: Mora, T. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1988. Lecture Notes in Computer Science, vol 357. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51083-4_46

Download citation

  • DOI: https://doi.org/10.1007/3-540-51083-4_46

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51083-3

  • Online ISBN: 978-3-540-46152-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics