Linear equations for the number of intervals which are isomorphic with Boolean lattices and the Dehn-Sommerville equations
From MaRDI portal
Publication:2902252
Abstract: Let be a finite poset. Let denote the lattice of order ideals of . Let denote the number of Boolean intervals of of rank . We construct a simple graph from our poset . Denote by the number of the cliques , contained in the graph . Our main results are some linear equations connecting the numbers and . We reprove the Dehn--Sommerville equations for simplicial polytopes. In our proof we use free resolutions and the theory of Stanley--Reisner rings.
Recommendations
- Generalized Dehn-Sommerville relations for polytopes, spheres and Eulerian partially ordered sets
- Posets that locally resemble distributive lattices. An extension of Stanley's theorem (with connections to buildings and diagram geometries)
- A generalization of Dehn-Sommerville relations to simple stratified spaces
- Two poset polytopes
- Generalized Dehn-Sommerville equations and an upper bound theorem
Cites work
- scientific article; zbMATH DE number 1033382 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- scientific article; zbMATH DE number 2190625 (Why is no real title available?)
- A Combinatorial Analogue of Poincaré's Duality Theorem
- Combinatorics and commutative algebra.
- Distributive lattices, bipartite graphs and Alexander duality
- Generalized Dehn-Sommerville relations for polytopes, spheres and Eulerian partially ordered sets
- Monomial Ideals Arising From Distributive Lattices
- Resolutions of Stanley-Reisner rings and Alexander duality
- The monomial ideal of a finite meet-semilattice
- Using Algebraic Geometry
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)