Skip to main content
SpringerLink
Log in

Computational aspects of reduction strategies to construct resolutions of monomial ideals

  • Conference paper
  • First Online:
Applied Algebra, Algorithmics and Error-Correcting Codes (AAECC 1984)

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

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D.BAYER The division algorithm and the Hilbert scheme, Ph.D. Thesis, Harvard 1982

    Google Scholar 

  2. B.BUCHBERGER Ein Algorithmus zu auffinden der Basiselemente des Restlassenringe nach einem nulldimensionalen Polynomideal, Ph.D. Thesis, Innsbruck, 1965

    Google Scholar 

  3. B. BUCHBERGER Ein algorithmisches Kriterium für die Losbarkeit eines algebraischen Gleichungssystems, Aeq. Math. 4 (1970) 364–383

    Google Scholar 

  4. B. BUCHBERGER A criterion for detecting unnecessary reductions in the construction of Gröbner bases, Proc. EUROSAM 79, L.N.Comp.Sci. 72 (1979) 3–21

    Google Scholar 

  5. C.DE CONCINI, D.EISENBUD, C.PROCESI Hodge Algebras, Asterisque 91 (1982)

    Google Scholar 

  6. H.M.MOELLER, F.MORA New constructive methods in classical ideal theory, J.Alg. 96 (1986)

    Google Scholar 

  7. H.M. MOELLER, F. MORA The computation of the Hilbert function, Proc. EUROCAL 83, L.N.Comp.Sci. 162 (1983) 157–167

    Google Scholar 

  8. H.M. MOELLER A reduction strategy for the Taylor resolution, Proc. EUROCAL 85 II, L.N.Comp.Sci. 204 (1985) 526–534

    Google Scholar 

  9. G.LYUBEZNIK Ph.D. Thesis, Columbia Univ., 1984

    Google Scholar 

  10. D.TAYLOR Ideals generated by monomials in an R-sequence, Ph.D.Thesis, Chicago 1960

    Google Scholar 

  11. B.MITCHELL Theory of categories, New York, 1965

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fernuniversität, Hagen

    H.Michael Möller

  2. Università, Genova

    Ferdinando Mora

Authors
  1. H.Michael Möller
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ferdinando Mora
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alain Poli

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Möller, H., Mora, F. (1986). Computational aspects of reduction strategies to construct resolutions of monomial ideals. In: Poli, A. (eds) Applied Algebra, Algorithmics and Error-Correcting Codes. AAECC 1984. Lecture Notes in Computer Science, vol 228. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16767-6_64

Download citation

  • DOI: https://doi.org/10.1007/3-540-16767-6_64

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16767-9

  • Online ISBN: 978-3-540-38813-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation