<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-02343355</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-18T19:00:15+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Compatibility fans for graphical nested complexes</title>
            <author role="aut">
              <persName>
                <forename type="first">Thibault</forename>
                <surname>Manneville</surname>
              </persName>
              <idno type="halauthorid">1000299-0</idno>
              <affiliation ref="#struct-2071"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Vincent</forename>
                <surname>Pilaud</surname>
              </persName>
              <email type="md5">d24772b65066077a2dbf5b9f4d34072d</email>
              <email type="domain">lix.polytechnique.fr</email>
              <idno type="idhal" notation="string">vincent-pilaud</idno>
              <idno type="idhal" notation="numeric">738886</idno>
              <idno type="halauthorid" notation="string">29069-738886</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-2070-9223</idno>
              <orgName ref="#struct-300340"/>
              <affiliation ref="#struct-2071"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Vincent</forename>
                <surname>Pilaud</surname>
              </persName>
              <email type="md5">d24772b65066077a2dbf5b9f4d34072d</email>
              <email type="domain">lix.polytechnique.fr</email>
            </editor>
            <funder ref="#projanr-35784"/>
            <funder ref="#projanr-45835"/>
            <funder>VP was partially supported by the Spanish MICINN grant MTM2011-22792 and by the French ANR grants EGOS (12 JS02 002 01) and SC3A (15 CE40 0004 01).</funder>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2019-11-02 13:38:14</date>
              <date type="whenModified">2025-11-21 08:45:01</date>
              <date type="whenReleased">2019-11-04 16:37:39</date>
              <date type="whenProduced">2017</date>
              <date type="whenEndEmbargoed">2019-11-02</date>
              <ref type="file" target="https://hal.science/hal-02343355v1/document">
                <date notBefore="2019-11-02"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-02343355v1/file/MannevillePilaud_compatibilityFansGraphicalNestedComplexes_JCTA.pdf" id="file-2343355-2251638">
                <date notBefore="2019-11-02"/>
              </ref>
              <ref type="externalLink" target="http://arxiv.org/pdf/1501.07152"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="174300">
                <persName>
                  <forename>Vincent</forename>
                  <surname>Pilaud</surname>
                </persName>
                <email type="md5">d24772b65066077a2dbf5b9f4d34072d</email>
                <email type="domain">lix.polytechnique.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-02343355</idno>
            <idno type="halUri">https://hal.science/hal-02343355</idno>
            <idno type="halBibtex">manneville:hal-02343355</idno>
            <idno type="halRefHtml">&lt;i&gt;Journal of Combinatorial Theory, Series A&lt;/i&gt;, 2017, 150, pp.36-107. &lt;a target="_blank" href="https://dx.doi.org/10.1016/j.jcta.2017.02.004"&gt;&amp;#x27E8;10.1016/j.jcta.2017.02.004&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Journal of Combinatorial Theory, Series A, 2017, 150, pp.36-107. &amp;#x27E8;10.1016/j.jcta.2017.02.004&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-2343355-2251638"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="X">École polytechnique</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="LIX" corresp="X">Laboratoire d'informatique de l'Ecole polytechnique</idno>
            <idno type="stamp" n="X-DEP-INFO">Département d'informatique de l’École polytechnique</idno>
            <idno type="stamp" n="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="X-SACLAY" corresp="UNIV-PARIS-SACLAY">X-SACLAY</idno>
            <idno type="stamp" n="ANR">ANR</idno>
            <idno type="stamp" n="DEPARTEMENT-DE-MATHEMATIQUES">Collection du Département de Mathématiques</idno>
            <idno type="stamp" n="ANR_QUANTIQUE">ANR QUANTIQUE</idno>
            <idno type="stamp" n="ANR_QUANTIQUE_3" corresp="ANR_QUANTIQUE">ANR_QUANTIQUE_3</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Compatibility fans for graphical nested complexes</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Thibault</forename>
                    <surname>Manneville</surname>
                  </persName>
                  <idno type="halauthorid">1000299-0</idno>
                  <affiliation ref="#struct-2071"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Vincent</forename>
                    <surname>Pilaud</surname>
                  </persName>
                  <email type="md5">d24772b65066077a2dbf5b9f4d34072d</email>
                  <email type="domain">lix.polytechnique.fr</email>
                  <idno type="idhal" notation="string">vincent-pilaud</idno>
                  <idno type="idhal" notation="numeric">738886</idno>
                  <idno type="halauthorid" notation="string">29069-738886</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-2070-9223</idno>
                  <orgName ref="#struct-300340"/>
                  <affiliation ref="#struct-2071"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">15252</idno>
                <idno type="issn">0097-3165</idno>
                <idno type="eissn">1096-0899</idno>
                <title level="j">Journal of Combinatorial Theory, Series A</title>
                <imprint>
                  <publisher>Elsevier</publisher>
                  <biblScope unit="volume">150</biblScope>
                  <biblScope unit="pp">36-107</biblScope>
                  <date type="datePub">2017</date>
                </imprint>
              </monogr>
              <idno type="arxiv">1501.07152</idno>
              <idno type="doi">10.1016/j.jcta.2017.02.004</idno>
              <ref type="publisher">https://www.sciencedirect.com/science/article/abs/pii/S009731651730016X</ref>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">compatibility fans</term>
                <term xml:lang="en">compatibility degrees</term>
                <term xml:lang="en">finite type cluster algebras</term>
                <term xml:lang="en">graph associahedra</term>
              </keywords>
              <classCode scheme="classification">52B11, 52B12, 05E45</classCode>
              <classCode scheme="halDomain" n="math.math-co">Mathematics [math]/Combinatorics [math.CO]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>Graph associahedra are natural generalizations of the classical associahedra. They provide polytopal realizations of the nested complex of a graph G, defined as the simplicial complex whose vertices are the tubes (i.e. connected induced subgraphs) of G and whose faces are the tubings (i.e. collections of pairwise nested or non-adjacent tubes) of G. The constructions of M. Carr and S. Devadoss, of A. Postnikov, and of A. Zelevinsky for graph associahedra are all based on the nested fan which coarsens the normal fan of the permutahedron. In view of the combinatorial and geometric variety of simplicial fan realizations of the classical associahedra, it is tempting to search for alternative fans realizing graphical nested complexes. Motivated by the analogy between finite type cluster complexes and graphical nested complexes , we transpose in this paper S. Fomin and A. Zelevinsky's construction of compatibility fans from the former to the latter setting. For this, we define a compatibility degree between two tubes of a graph G. Our main result asserts that the compatibility vectors of all tubes of G with respect to an arbitrary maximal tubing on G support a complete simplicial fan realizing the nested complex of G. In particular, when the graph G is reduced to a path, our compatibility degree lies in {−1, 0, 1} and we recover F. Santos' Catalan many simplicial fan realizations of the associahedron.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-2071" status="VALID">
          <idno type="IdRef">196509955</idno>
          <idno type="ISNI">0000000403673665</idno>
          <idno type="RNSR">200519331V</idno>
          <idno type="ROR">https://ror.org/04afed728</idno>
          <idno type="Wikidata">Q16009025</idno>
          <orgName>Laboratoire d'informatique de l'École polytechnique [Palaiseau]</orgName>
          <orgName type="acronym">LIX</orgName>
          <date type="start">2005-01-01</date>
          <desc>
            <address>
              <addrLine>1 Rue Honoré d’Estienne d’Orves, Bâtiment Alain Turing, 91120 Palaiseau</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.lix.polytechnique.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300340" type="direct"/>
            <relation active="#struct-563936" type="indirect"/>
            <relation name="UMR7161" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300340" status="VALID">
          <idno type="IdRef">027309320</idno>
          <idno type="ISNI">0000000121581279</idno>
          <idno type="ROR">https://ror.org/05hy3tk52</idno>
          <idno type="Wikidata">Q273626</idno>
          <orgName>École polytechnique</orgName>
          <orgName type="acronym">X</orgName>
          <date type="start">1794-03-11</date>
          <desc>
            <address>
              <addrLine>Route de Saclay, 91128 Palaiseau Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.polytechnique.edu/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-563936" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-563936" status="VALID">
          <idno type="IdRef">238327159</idno>
          <idno type="ISNI">0000000502717600</idno>
          <idno type="ROR">https://ror.org/042tfbd02</idno>
          <idno type="Wikidata">Q48759778</idno>
          <orgName>Institut Polytechnique de Paris</orgName>
          <orgName type="acronym">IP Paris</orgName>
          <date type="start">2019-06-02</date>
          <desc>
            <address>
              <addrLine>Route de Saclay, 91120 Palaiseau Cedex, France</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.ip-paris.fr</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-35784" status="VALID">
          <idno type="anr">ANR-12-JS02-0002</idno>
          <idno type="program">Jeunes Chercheuses et Jeunes Chercheurs</idno>
          <orgName>EGOS</orgName>
          <desc>Graphes Plongés et leurs Structures Orientées</desc>
          <date type="start">2012</date>
        </org>
        <org type="anrProject" xml:id="projanr-45835" status="VALID">
          <idno type="anr">ANR-15-CE40-0004</idno>
          <orgName>SC3A</orgName>
          <desc>Surfaces, Catégorification et Combinatoire des Algèbres Amassées</desc>
          <date type="start">2015</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>