<?xml version="1.0"?><TEI xmlns="http://www.tei-c.org/ns/1.0"><teiHeader><fileDesc><titleStmt><title>Episciences.org TEI export of hal-00959006 - dmtcs:312 - Discrete Mathematics &amp; Theoretical Computer Science, 2004-01-01, Vol. 6 no. 2</title></titleStmt><publicationStmt><distributor>CCSD</distributor><availability status="restricted"><licence target="https://about.hal.science/hal-authorisation-v1">https://about.hal.science/hal-authorisation-v1</licence></availability><date when="2004-01-01"/></publicationStmt><sourceDesc><p>Episciences.org API platform</p></sourceDesc></fileDesc></teiHeader><text><body><listBibl><biblFull><titleStmt><title xml:lang="fr">Coxeter-like complexes</title><author role="aut"><persName><forename type="first">Eric</forename><surname>Babson</surname></persName><email/><affiliation ref="#struct-0"/></author><author role="aut"><persName><forename type="first">Victor</forename><surname>Reiner</surname></persName><email/><affiliation ref="#struct-1"/></author></titleStmt><editionStmt><edition><date type="whenSubmitted">2015-03-26 16:18:10</date><date type="whenProduced">2004-01-01 08:00:00</date><ref type="file" target="https://dmtcs.episciences.org/312/pdf"/></edition><respStmt><resp>contributor</resp><name key="102239"><persName><forename>Alain</forename><surname>Monteil</surname></persName><email>alain.monteil@inria.fr</email></name></respStmt></editionStmt><publicationStmt><distributor>CCSD</distributor><idno type="id">dmtcs:312</idno><idno type="url">https://dmtcs.episciences.org/312</idno><idno type="ref">dmtcs:312 - Discrete Mathematics &amp; Theoretical Computer Science, 2004-01-01, Vol. 6 no. 2</idno><licence target="https://about.hal.science/hal-authorisation-v1">https://about.hal.science/hal-authorisation-v1</licence></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="fr">Coxeter-like complexes</title><author role="aut"><persName><forename type="first">Eric</forename><surname>Babson</surname></persName><email/><affiliation ref="#struct-0"/></author><author role="aut"><persName><forename type="first">Victor</forename><surname>Reiner</surname></persName><email/><affiliation ref="#struct-1"/></author></analytic><monogr><idno type="HAL">hal-00959006</idno><idno type="issn">1365-8050</idno><title level="j">Discrete Mathematics &amp; Theoretical Computer Science</title><imprint><publisher/><biblScope unit="volume">Vol. 6 no. 2</biblScope><date type="datePub">2004-01-01T08:00:00+01:00</date></imprint></monogr><idno type="doi">10.46298/dmtcs.312</idno></biblStruct></sourceDesc><profileDesc><langUsage><language ident="en">English</language></langUsage><textClass><keywords scheme="author"><term>Coxeter complex</term><term>simplicial poset</term><term>Boolean complex</term><term>chessboard complex</term><term>Shephard group</term><term>unitary reflection group</term><term>simplex of groups</term><term>homology representation</term><term>[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]</term></keywords></textClass><abstract><p>International audience</p></abstract><abstract xml:lang="en"><p>Motivated by the Coxeter complex associated to a Coxeter system (W,S), we introduce a simplicial regular cell complex &#x394; (G,S) with a G-action associated to any pair (G,S) where G is a group and S is a finite set of generators for G which is minimal with respect to inclusion. We examine the topology of &#x394; (G,S), and in particular the representations of G on its homology groups. We look closely at the case of the symmetric group S_n minimally generated by (not necessarily adjacent) transpositions, and their type-selected subcomplexes. These include not only the Coxeter complexes of type A, but also the well-studied chessboard complexes.</p></abstract></profileDesc></biblFull></listBibl></body><back><listOrg><org xml:id="struct-0"><orgName>Department of Mathematics [Seattle]</orgName></org><org xml:id="struct-1"><orgName>School of Mathematics</orgName></org></listOrg></back></text></TEI>