IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-319-96827-8_17.html

The Greedy Algorithm and the Cohen-Macaulay Property of Rings, Graphs and Toric Projective Curves

In: Singularities, Algebraic Geometry, Commutative Algebra, and Related Topics

Author

Listed:
  • Argimiro Arratia

    (Universitat Politècnica de Catalunya, Department of Computer Science and Barcelona Graduate School of Mathematics)

Abstract

It is shown in this paper how a solution for a combinatorial problem obtained from applying the greedy algorithm is guaranteed to be optimal for those instances of the problem that, under an appropriate algebraic representation, satisfy the Cohen-Macaulay property known for rings and modules in Commutative Algebra. The choice of representation for the instances of a given combinatorial problem is fundamental for recognizing the Cohen-Macaulay property. Departing from an exposition of the general framework of simplicial complexes and their associated Stanley-Reisner ideals, wherein the Cohen-Macaulay property is formally defined, a review of other equivalent frameworks more suitable for graphs or arithmetical problems will follow. In the case of graph problems a better framework to use is the edge ideal of Rafael Villarreal. For arithmetic problems it is appropriate to work within the semigroup viewpoint of toric geometry developed by Antonio Campillo and collaborators.

Suggested Citation

  • Argimiro Arratia, 2018. "The Greedy Algorithm and the Cohen-Macaulay Property of Rings, Graphs and Toric Projective Curves," Springer Books, in: Gert-Martin Greuel & Luis Narváez Macarro & Sebastià Xambó-Descamps (ed.), Singularities, Algebraic Geometry, Commutative Algebra, and Related Topics, pages 411-428, Springer.
    • Handle: RePEc:spr:sprchp:978-3-319-96827-8_17
    DOI: 10.1007/978-3-319-96827-8_17
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-319-96827-8_17. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.