Linear equations for the number of intervals which are isomorphic with Boolean lattices and the Dehn-Sommerville equations

From MaRDI portal
Publication:2902252

DOI10.1080/00927872.2010.517587zbMATH Open1254.06003arXiv1002.2049OpenAlexW2962857984MaRDI QIDQ2902252FDOQ2902252


Authors: Gábor Hegedüs Edit this on Wikidata


Publication date: 17 August 2012

Published in: Communications in Algebra (Search for Journal in Brave)

Abstract: Let P be a finite poset. Let L:=J(P) denote the lattice of order ideals of P. Let bi(L) denote the number of Boolean intervals of L of rank i. We construct a simple graph G(P) from our poset P. Denote by fi(P) the number of the cliques Ki+1, contained in the graph G(P). Our main results are some linear equations connecting the numbers fi(P) and bi(L). We reprove the Dehn--Sommerville equations for simplicial polytopes. In our proof we use free resolutions and the theory of Stanley--Reisner rings.


Full work available at URL: https://arxiv.org/abs/1002.2049




Recommendations




Cites Work


Cited In (1)





This page was built for publication: Linear equations for the number of intervals which are isomorphic with Boolean lattices and the Dehn-Sommerville equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2902252)