Monomial ideals of weighted oriented graphs
Let I=I(D) be the edge ideal of a weighted oriented graph D. We determine the irredundant irreducible decomposition of I. Also, we characterize the associated primes and the unmixed property of I. Furthermore, we give a combinatorial characterization for the unmixed property of I, when D is bipartit...
Gespeichert in:
Veröffentlicht in: | arXiv.org 2017-10 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | arXiv.org |
container_volume | |
creator | Pitones, Yuriko Reyes, Enrique Toledo, Jonathan |
description | Let I=I(D) be the edge ideal of a weighted oriented graph D. We determine the irredundant irreducible decomposition of I. Also, we characterize the associated primes and the unmixed property of I. Furthermore, we give a combinatorial characterization for the unmixed property of I, when D is bipartite, D is a whisker or D is a cycle. Finally, we study the Cohen-Macaulay property of I. |
doi_str_mv | 10.48550/arxiv.1710.03785 |
format | Article |
fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_1710_03785</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2076904714</sourcerecordid><originalsourceid>FETCH-LOGICAL-a524-aad7a0b545dd27c75f117b730ed5143277b9a7b030e39b55948878b3221f88303</originalsourceid><addsrcrecordid>eNotj01PAjEQhhsTEwnyAzi5iUezOP0Ypns0RMUEw4X7prVdKIHt2gU__r0FPM3kzZN35mFszGGiNCI8mvQTviaccgCSNF6xgZCSl1oJccNGfb8FADElgSgH7OE9tnEfzK4IzptdX8Sm-PZhvTl4V8QUfHta1sl0m_6WXTcZ8aP_OWSrl-fVbF4ulq9vs6dFaVCo0hhHBiwqdE7QB2HDOVmS4B1yJQWRrQxZyIGsLGKltCZtpRC80VqCHLK7S-3ZpO5S2Jv0W5-M6rNRJu4vRJfi59H3h3obj6nNP9UCaFqBonzpD7NTS_M</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2076904714</pqid></control><display><type>article</type><title>Monomial ideals of weighted oriented graphs</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Pitones, Yuriko ; Reyes, Enrique ; Toledo, Jonathan</creator><creatorcontrib>Pitones, Yuriko ; Reyes, Enrique ; Toledo, Jonathan</creatorcontrib><description>Let I=I(D) be the edge ideal of a weighted oriented graph D. We determine the irredundant irreducible decomposition of I. Also, we characterize the associated primes and the unmixed property of I. Furthermore, we give a combinatorial characterization for the unmixed property of I, when D is bipartite, D is a whisker or D is a cycle. Finally, we study the Cohen-Macaulay property of I.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.1710.03785</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Combinatorial analysis ; Mathematics - Commutative Algebra</subject><ispartof>arXiv.org, 2017-10</ispartof><rights>2017. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,784,885,27925</link.rule.ids><backlink>$$Uhttps://doi.org/10.37236/8479$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.1710.03785$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Pitones, Yuriko</creatorcontrib><creatorcontrib>Reyes, Enrique</creatorcontrib><creatorcontrib>Toledo, Jonathan</creatorcontrib><title>Monomial ideals of weighted oriented graphs</title><title>arXiv.org</title><description>Let I=I(D) be the edge ideal of a weighted oriented graph D. We determine the irredundant irreducible decomposition of I. Also, we characterize the associated primes and the unmixed property of I. Furthermore, we give a combinatorial characterization for the unmixed property of I, when D is bipartite, D is a whisker or D is a cycle. Finally, we study the Cohen-Macaulay property of I.</description><subject>Combinatorial analysis</subject><subject>Mathematics - Commutative Algebra</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNotj01PAjEQhhsTEwnyAzi5iUezOP0Ypns0RMUEw4X7prVdKIHt2gU__r0FPM3kzZN35mFszGGiNCI8mvQTviaccgCSNF6xgZCSl1oJccNGfb8FADElgSgH7OE9tnEfzK4IzptdX8Sm-PZhvTl4V8QUfHta1sl0m_6WXTcZ8aP_OWSrl-fVbF4ulq9vs6dFaVCo0hhHBiwqdE7QB2HDOVmS4B1yJQWRrQxZyIGsLGKltCZtpRC80VqCHLK7S-3ZpO5S2Jv0W5-M6rNRJu4vRJfi59H3h3obj6nNP9UCaFqBonzpD7NTS_M</recordid><startdate>20171010</startdate><enddate>20171010</enddate><creator>Pitones, Yuriko</creator><creator>Reyes, Enrique</creator><creator>Toledo, Jonathan</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20171010</creationdate><title>Monomial ideals of weighted oriented graphs</title><author>Pitones, Yuriko ; Reyes, Enrique ; Toledo, Jonathan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a524-aad7a0b545dd27c75f117b730ed5143277b9a7b030e39b55948878b3221f88303</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Combinatorial analysis</topic><topic>Mathematics - Commutative Algebra</topic><toplevel>online_resources</toplevel><creatorcontrib>Pitones, Yuriko</creatorcontrib><creatorcontrib>Reyes, Enrique</creatorcontrib><creatorcontrib>Toledo, Jonathan</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Access via ProQuest (Open Access)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Pitones, Yuriko</au><au>Reyes, Enrique</au><au>Toledo, Jonathan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Monomial ideals of weighted oriented graphs</atitle><jtitle>arXiv.org</jtitle><date>2017-10-10</date><risdate>2017</risdate><eissn>2331-8422</eissn><abstract>Let I=I(D) be the edge ideal of a weighted oriented graph D. We determine the irredundant irreducible decomposition of I. Also, we characterize the associated primes and the unmixed property of I. Furthermore, we give a combinatorial characterization for the unmixed property of I, when D is bipartite, D is a whisker or D is a cycle. Finally, we study the Cohen-Macaulay property of I.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.1710.03785</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | EISSN: 2331-8422 |
ispartof | arXiv.org, 2017-10 |
issn | 2331-8422 |
language | eng |
recordid | cdi_arxiv_primary_1710_03785 |
source | arXiv.org; Free E- Journals |
subjects | Combinatorial analysis Mathematics - Commutative Algebra |
title | Monomial ideals of weighted oriented graphs |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T07%3A45%3A19IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Monomial%20ideals%20of%20weighted%20oriented%20graphs&rft.jtitle=arXiv.org&rft.au=Pitones,%20Yuriko&rft.date=2017-10-10&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.1710.03785&rft_dat=%3Cproquest_arxiv%3E2076904714%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2076904714&rft_id=info:pmid/&rfr_iscdi=true |