<?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-22T08:37:01Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/10735" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/10735</identifier><datestamp>2026-05-14T13:51:39Z</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">Schweig, Jay</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2008-04-21T19:54:00Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2008-04-21T19:54:00Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2008-04-21T19:54:00Z</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/10735</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">6397051</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Possibly the most fundamental combinatorial invariant associated to a finite simplicial complex is its f-vector, the integral sequence expressing the number of faces of the complex in each dimension.  The h-vector of a complex is obtained by applying a simple invertible transformation to its f-vector, and thus the two contain the same information.  Because some properties of the f-vector are easier expressed after applying this transformation, the h-vector has been the subject of much study in geometric and algebraic combinatorics.  A convex-ear decomposition, first introduced by Chari, is a way of writing a simplicial complex as a union of subcomplexes of simplicial polytope boundaries.  When a $(d-1)$-dimensional complex admits such a decomposition, its h-vector satisfies, for $i &lt; d/2$, $h_i \leq h_{i+1}$ and $h_i \leq h_{d-i}$.  Furthermore, its g-vector is an M-vector.  &#xd;
&#xd;
We give convex-ear decompositions for the order complexes of rank-selected subposets of supersolvable lattices with nowhere-zero M\"obius functions, rank-selected subposets of geometric lattices, and rank-selected face posets of shellable complexes (when the rank-selection does not include the maximal rank).  Using these decompositions, we are able to show inequalities for the flag h-vectors of supersolvable lattices and face posets of Cohen-Macaulay complexes.  &#xd;
&#xd;
Finally, we turn our attention to the h-vectors of lattice path matroids.  A lattice path matroid is a certain type of transversal matroid whose bases correspond to planar lattice paths.  We verify a conjecture of Stanley in the special case of lattice path matroids and, in doing so, introduce an interesting new class of monomial order ideals.</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">Mathematics</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Combinatorics</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Partially ordered sets</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">h-vector</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Poset Convex-Ear Decompositions and Applications to the Flag h-Vector</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="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">Schweig, Jay</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="4acb34c1-9515-4d89-89ba-1c24286615d2">
	&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>Poset Convex-Ear Decompositions and Applications to the Flag h-Vector&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2008-04-21T19:54:00Z&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Schweig, Jay&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>Mathematics&lt;/Keyword>
    &lt;Keyword>Combinatorics&lt;/Keyword>
    &lt;Keyword>Partially ordered sets&lt;/Keyword>
    &lt;Keyword>h-vector&lt;/Keyword>
   	&lt;Abstract>Possibly the most fundamental combinatorial invariant associated to a finite simplicial complex is its f-vector, the integral sequence expressing the number of faces of the complex in each dimension.  The h-vector of a complex is obtained by applying a simple invertible transformation to its f-vector, and thus the two contain the same information.  Because some properties of the f-vector are easier expressed after applying this transformation, the h-vector has been the subject of much study in geometric and algebraic combinatorics.  A convex-ear decomposition, first introduced by Chari, is a way of writing a simplicial complex as a union of subcomplexes of simplicial polytope boundaries.  When a $(d-1)$-dimensional complex admits such a decomposition, its h-vector satisfies, for $i &amp;lt; d/2$, $h_i \leq h_{i+1}$ and $h_i \leq h_{d-i}$.  Furthermore, its g-vector is an M-vector.  &#xd;
&#xd;
We give convex-ear decompositions for the order complexes of rank-selected subposets of supersolvable lattices with nowhere-zero M\&amp;quot;obius functions, rank-selected subposets of geometric lattices, and rank-selected face posets of shellable complexes (when the rank-selection does not include the maximal rank).  Using these decompositions, we are able to show inequalities for the flag h-vectors of supersolvable lattices and face posets of Cohen-Macaulay complexes.  &#xd;
&#xd;
Finally, we turn our attention to the h-vectors of lattice path matroids.  A lattice path matroid is a certain type of transversal matroid whose bases correspond to planar lattice paths.  We verify a conjecture of Stanley in the special case of lattice path matroids and, in doing so, introduce an interesting new class of monomial order ideals.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>