<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href='static/style.xsl' type='text/xsl'?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T09:06:14Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/29476" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/29476</identifier><datestamp>2026-05-14T13:48:11Z</datestamp><setSpec>com_1813_35</setSpec><setSpec>col_1813_47</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Blanco Rodriguez, Saul</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="chair" lang="en_US">Billera, Louis J.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember" lang="en_US">Tardos, Eva</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember" lang="en_US">Swartz, Edward B.</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2012-06-28T20:57:33Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2017-06-01T06:00:32Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2012-01-31</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/29476</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">7745389</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Let (W, S ) be a Coxeter system, [u, v ] be a Bruhat interval and B (u, v ) be its corresponding Bruhat graph. The combinatorial and topological structures of the longest u-v paths of B (u, v ) have been studied extensively and is well-known. Nevertheless, not much is known of the remaining paths. Here we define the shortest path poset of [u, v ], denoted by SP (u, v ), which arises from the shortest u-v paths of B (u, v ). If W is finite, then SP (e, w0 ) is the union of Boolean posets, where w0 is the longest-length word of W . Furthermore, if SP (u, v ) has a unique rising chain under a reflection order, then SP (u, v ) is EL-shellable. The complete cd-index of a Bruhat interval is a non-homogeneous polynomial that encodes the descent-set distribution, under a reflection order, of paths of B (u, v ). The highest-degree terms of the complete cd-index correspond to the cd-index of [u, v ] (as an Eulerian poset). We study properties of the complete cd-index and compute it for some intervals utilizing an extension of the CL¨ labeling of Bjorner and Wachs that can be defined for dihedral intervals (which we characterize by their complete cd-index) and intervals in a universal Coxeter system. We also describe the lowest-degree terms of the complete cd-index for some intervals.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en_US</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Coxeter group</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Bruhat graph</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">complete cd-index</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Shortest Path Poset Of Bruhat Intervals And The Complete Cd-Index</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="discipline">Mathematics</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="grantor" lang="en_US">Cornell University</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="level">Doctor of Philosophy</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name">Ph. D., Mathematics</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="collection" authority="https://cornell-ecommons.eks.prod.4science.cloud/handle/1813/47" confidence="600">Cornell Theses and Dissertations</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="author" lang="en_US">Blanco Rodriguez, Saul</dim:field>
   <dim:field mdschema="cris" element="virtualsource" qualifier="collection">5893a6ea-7af3-41d7-abc6-04bcd26ab5df</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="1552d06a-f1bc-4793-8ae4-01102449f39c">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>en_US&lt;/Language>
   	&lt;Title>Shortest Path Poset Of Bruhat Intervals And The Complete Cd-Index&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2012-01-31&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Blanco Rodriguez, Saul&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;Keyword>Coxeter group&lt;/Keyword>
    &lt;Keyword>Bruhat graph&lt;/Keyword>
    &lt;Keyword>complete cd-index&lt;/Keyword>
   	&lt;Abstract>Let (W, S ) be a Coxeter system, [u, v ] be a Bruhat interval and B (u, v ) be its corresponding Bruhat graph. The combinatorial and topological structures of the longest u-v paths of B (u, v ) have been studied extensively and is well-known. Nevertheless, not much is known of the remaining paths. Here we define the shortest path poset of [u, v ], denoted by SP (u, v ), which arises from the shortest u-v paths of B (u, v ). If W is finite, then SP (e, w0 ) is the union of Boolean posets, where w0 is the longest-length word of W . Furthermore, if SP (u, v ) has a unique rising chain under a reflection order, then SP (u, v ) is EL-shellable. The complete cd-index of a Bruhat interval is a non-homogeneous polynomial that encodes the descent-set distribution, under a reflection order, of paths of B (u, v ). The highest-degree terms of the complete cd-index correspond to the cd-index of [u, v ] (as an Eulerian poset). We study properties of the complete cd-index and compute it for some intervals utilizing an extension of the CL¨ labeling of Bjorner and Wachs that can be defined for dihedral intervals (which we characterize by their complete cd-index) and intervals in a universal Coxeter system. We also describe the lowest-degree terms of the complete cd-index for some intervals.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>