Rhombus Criterion and the Chordal Graph Polytope

Rhombus Criterion and the Chordal Graph Polytope

The purpose of this paper is twofold. We investigate a simple necessary condition, called the rhombus criterion, for two vertices in a polytope not to form an edge and show that in many examples of $0/1$-polytopes it is also sufficient. We explain how also when this is not the case, the criterion ca...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Linusson, Svante, Restadh, Petter
Format: Artikel
Sprache:eng
Schlagworte:
Mathematics - Combinatorics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Linusson, Svante
Restadh, Petter
description The purpose of this paper is twofold. We investigate a simple necessary condition, called the rhombus criterion, for two vertices in a polytope not to form an edge and show that in many examples of $0/1$-polytopes it is also sufficient. We explain how also when this is not the case, the criterion can give a good algorithm for determining the edges of high-dimenional polytopes. In particular we study the Chordal graph polytope, which arises in the theory of causality and is an important example of a characteristic imset polytope. We prove that, asymptotically, for almost all pairs of vertices the rhombus criterion holds. We conjecture it to hold for all pairs of vertices.
doi_str_mv 10.48550/arxiv.2305.05275
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2305_05275</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2305_05275</sourcerecordid><originalsourceid>FETCH-LOGICAL-a675-3e31d0bdc56e678608ddea3911605e0999ea1b013fa057ca7e787baa2f1ecfbc3</originalsourceid><addsrcrecordid>eNotzsGKwjAQgOFcPCzqA-zJvEDrpHGS9ihF3QVBEe9l0kxpoZoSu4u-vazr6b_9fEJ8KkhXOSIsKd673zTTgClgZvFDwKkNF_dzk2XsRo5duEq6ejm2LMs2RE-93EUaWnkM_WMMA8_EpKH-xvN3p-K83ZzLr2R_2H2X631CxmKiWSsPztdo2NjcQO49ky6UMoAMRVEwKQdKNwRoa7Jsc-uIskZx3bhaT8Xif_siV0PsLhQf1R-9etH1ExdCPjc</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Rhombus Criterion and the Chordal Graph Polytope</title><source>arXiv.org</source><creator>Linusson, Svante ; Restadh, Petter</creator><creatorcontrib>Linusson, Svante ; Restadh, Petter</creatorcontrib><description>The purpose of this paper is twofold. We investigate a simple necessary condition, called the rhombus criterion, for two vertices in a polytope not to form an edge and show that in many examples of $0/1$-polytopes it is also sufficient. We explain how also when this is not the case, the criterion can give a good algorithm for determining the edges of high-dimenional polytopes. In particular we study the Chordal graph polytope, which arises in the theory of causality and is an important example of a characteristic imset polytope. We prove that, asymptotically, for almost all pairs of vertices the rhombus criterion holds. We conjecture it to hold for all pairs of vertices.</description><identifier>DOI: 10.48550/arxiv.2305.05275</identifier><language>eng</language><subject>Mathematics - Combinatorics</subject><creationdate>2023-05</creationdate><rights>http://creativecommons.org/licenses/by-sa/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,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2305.05275$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2305.05275$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Linusson, Svante</creatorcontrib><creatorcontrib>Restadh, Petter</creatorcontrib><title>Rhombus Criterion and the Chordal Graph Polytope</title><description>The purpose of this paper is twofold. We investigate a simple necessary condition, called the rhombus criterion, for two vertices in a polytope not to form an edge and show that in many examples of $0/1$-polytopes it is also sufficient. We explain how also when this is not the case, the criterion can give a good algorithm for determining the edges of high-dimenional polytopes. In particular we study the Chordal graph polytope, which arises in the theory of causality and is an important example of a characteristic imset polytope. We prove that, asymptotically, for almost all pairs of vertices the rhombus criterion holds. We conjecture it to hold for all pairs of vertices.</description><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzsGKwjAQgOFcPCzqA-zJvEDrpHGS9ihF3QVBEe9l0kxpoZoSu4u-vazr6b_9fEJ8KkhXOSIsKd673zTTgClgZvFDwKkNF_dzk2XsRo5duEq6ejm2LMs2RE-93EUaWnkM_WMMA8_EpKH-xvN3p-K83ZzLr2R_2H2X631CxmKiWSsPztdo2NjcQO49ky6UMoAMRVEwKQdKNwRoa7Jsc-uIskZx3bhaT8Xif_siV0PsLhQf1R-9etH1ExdCPjc</recordid><startdate>20230509</startdate><enddate>20230509</enddate><creator>Linusson, Svante</creator><creator>Restadh, Petter</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20230509</creationdate><title>Rhombus Criterion and the Chordal Graph Polytope</title><author>Linusson, Svante ; Restadh, Petter</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a675-3e31d0bdc56e678608ddea3911605e0999ea1b013fa057ca7e787baa2f1ecfbc3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Linusson, Svante</creatorcontrib><creatorcontrib>Restadh, Petter</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Linusson, Svante</au><au>Restadh, Petter</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Rhombus Criterion and the Chordal Graph Polytope</atitle><date>2023-05-09</date><risdate>2023</risdate><abstract>The purpose of this paper is twofold. We investigate a simple necessary condition, called the rhombus criterion, for two vertices in a polytope not to form an edge and show that in many examples of $0/1$-polytopes it is also sufficient. We explain how also when this is not the case, the criterion can give a good algorithm for determining the edges of high-dimenional polytopes. In particular we study the Chordal graph polytope, which arises in the theory of causality and is an important example of a characteristic imset polytope. We prove that, asymptotically, for almost all pairs of vertices the rhombus criterion holds. We conjecture it to hold for all pairs of vertices.</abstract><doi>10.48550/arxiv.2305.05275</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2305.05275
ispartof
issn
language eng
recordid cdi_arxiv_primary_2305_05275
source arXiv.org
subjects Mathematics - Combinatorics
title Rhombus Criterion and the Chordal Graph Polytope
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T02%3A50%3A14IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Rhombus%20Criterion%20and%20the%20Chordal%20Graph%20Polytope&rft.au=Linusson,%20Svante&rft.date=2023-05-09&rft_id=info:doi/10.48550/arxiv.2305.05275&rft_dat=%3Carxiv_GOX%3E2305_05275%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true