On The Toric Ideals of the Coloured Graphs of Reduced Words
We study a family \(\mathcal{B}\) of pseudo-multipartite graphs indexed by staircase partitions. They are realised from the reduced words of certain class of permutations. We investigate the vertex proper colouring of these graphs and give the general chromatic polynomial. For each member \(B_{\lamb...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2023-10 |
|---|---|
| 1. Verfasser: | |
| 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 | Adeyemo, Praise |
| description | We study a family \(\mathcal{B}\) of pseudo-multipartite graphs indexed by staircase partitions. They are realised from the reduced words of certain class of permutations. We investigate the vertex proper colouring of these graphs and give the general chromatic polynomial. For each member \(B_{\lambda}\), we construct an affine toric ideal \(\mathcal{I}_{B_{\lambda}}\) associated to vertex proper colouring using partition identity. It turns out that the projective version \(\mathcal{V}(\mathcal{I}_{B_{\lambda}})\) is realised from the cartoon diagram associated with the vertex proper colouring. |
| format | Article |
| fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2882598297</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2882598297</sourcerecordid><originalsourceid>FETCH-proquest_journals_28825982973</originalsourceid><addsrcrecordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mSw9s9TCMlIVQjJL8pMVvBMSU3MKVbIT1MoAYo55-fklxalpii4FyUWZICFg1JTSpOBIuH5RSnFPAysaUDlqbxQmptB2c01xNlDt6Aov7A0tbgkPguoPw8oFW9kYWFkamlhZGluTJwqAFKJNgE</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2882598297</pqid></control><display><type>article</type><title>On The Toric Ideals of the Coloured Graphs of Reduced Words</title><source>Free E- Journals</source><creator>Adeyemo, Praise</creator><creatorcontrib>Adeyemo, Praise</creatorcontrib><description>We study a family \(\mathcal{B}\) of pseudo-multipartite graphs indexed by staircase partitions. They are realised from the reduced words of certain class of permutations. We investigate the vertex proper colouring of these graphs and give the general chromatic polynomial. For each member \(B_{\lambda}\), we construct an affine toric ideal \(\mathcal{I}_{B_{\lambda}}\) associated to vertex proper colouring using partition identity. It turns out that the projective version \(\mathcal{V}(\mathcal{I}_{B_{\lambda}})\) is realised from the cartoon diagram associated with the vertex proper colouring.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Coloring ; Graphs ; Permutations ; Polynomials</subject><ispartof>arXiv.org, 2023-10</ispartof><rights>2023. 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><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>776,780</link.rule.ids></links><search><creatorcontrib>Adeyemo, Praise</creatorcontrib><title>On The Toric Ideals of the Coloured Graphs of Reduced Words</title><title>arXiv.org</title><description>We study a family \(\mathcal{B}\) of pseudo-multipartite graphs indexed by staircase partitions. They are realised from the reduced words of certain class of permutations. We investigate the vertex proper colouring of these graphs and give the general chromatic polynomial. For each member \(B_{\lambda}\), we construct an affine toric ideal \(\mathcal{I}_{B_{\lambda}}\) associated to vertex proper colouring using partition identity. It turns out that the projective version \(\mathcal{V}(\mathcal{I}_{B_{\lambda}})\) is realised from the cartoon diagram associated with the vertex proper colouring.</description><subject>Coloring</subject><subject>Graphs</subject><subject>Permutations</subject><subject>Polynomials</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mSw9s9TCMlIVQjJL8pMVvBMSU3MKVbIT1MoAYo55-fklxalpii4FyUWZICFg1JTSpOBIuH5RSnFPAysaUDlqbxQmptB2c01xNlDt6Aov7A0tbgkPguoPw8oFW9kYWFkamlhZGluTJwqAFKJNgE</recordid><startdate>20231026</startdate><enddate>20231026</enddate><creator>Adeyemo, Praise</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></search><sort><creationdate>20231026</creationdate><title>On The Toric Ideals of the Coloured Graphs of Reduced Words</title><author>Adeyemo, Praise</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_28825982973</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Coloring</topic><topic>Graphs</topic><topic>Permutations</topic><topic>Polynomials</topic><toplevel>online_resources</toplevel><creatorcontrib>Adeyemo, Praise</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 (ProQuest)</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>Publicly Available Content Database</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></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Adeyemo, Praise</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>On The Toric Ideals of the Coloured Graphs of Reduced Words</atitle><jtitle>arXiv.org</jtitle><date>2023-10-26</date><risdate>2023</risdate><eissn>2331-8422</eissn><abstract>We study a family \(\mathcal{B}\) of pseudo-multipartite graphs indexed by staircase partitions. They are realised from the reduced words of certain class of permutations. We investigate the vertex proper colouring of these graphs and give the general chromatic polynomial. For each member \(B_{\lambda}\), we construct an affine toric ideal \(\mathcal{I}_{B_{\lambda}}\) associated to vertex proper colouring using partition identity. It turns out that the projective version \(\mathcal{V}(\mathcal{I}_{B_{\lambda}})\) is realised from the cartoon diagram associated with the vertex proper colouring.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2023-10 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_proquest_journals_2882598297 |
| source | Free E- Journals |
| subjects | Coloring Graphs Permutations Polynomials |
| title | On The Toric Ideals of the Coloured Graphs of Reduced Words |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-31T18%3A40%3A36IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=On%20The%20Toric%20Ideals%20of%20the%20Coloured%20Graphs%20of%20Reduced%20Words&rft.jtitle=arXiv.org&rft.au=Adeyemo,%20Praise&rft.date=2023-10-26&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2882598297%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2882598297&rft_id=info:pmid/&rfr_iscdi=true |