Order, lattices, ordered algebraic structures Definition
Eulerian poset
Builds on Graded posetBounded posetMöbius function of a poset
Definition
Let be a finite graded poset with rank function . Assume that is bounded, with a least element and a greatest element . For in , let . The poset is Eulerian when for all in , the interval has as many elements of even rank as of odd rank.
Remarks
Equivalently, the Möbius function of is for all .
Example: the lattice of subsets of a finite set , with . Check: for with , the interval has elements of each parity of rank.
Non-example: the chain with is graded and bounded, but the interval has two elements of even rank and one of odd rank.
Every interval of an Eulerian poset is again Eulerian. The face lattice of a convex polytope is Eulerian.
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Bounded poset concept
- Graded poset concept
- Möbius function of a poset concept
- Eulerian poset definition
Further reading
About this page
| Tag | 74JREVZVY3 |
|---|---|
| URI | m2://74JREVZVY3 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06A07, 52B05 |
| Defines | Eulerian poset |
| Uses | Graded poset, Bounded poset, Möbius function of a poset |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.