Order, lattices, ordered algebraic structures Combinatorics of posets Concept
Eulerian poset
Summary
An Eulerian poset is a finite graded poset with a least and a greatest element. In it, every interval of positive length has as many elements of even rank as of odd rank. Equivalently, its Möbius function is , where is the rank. Face lattices of convex polytopes are Eulerian, and the condition encodes the Euler–Poincaré relation for their face numbers.
Further reading
About this page
| Tag | N1Q0BJAEFX |
|---|---|
| URI | m2://N1Q0BJAEFX |
| Kind | concept |
| Writing | W0 stub |
| MSC | 06A07, 52B05 |
| Specializes | Graded poset |
| Same as | |
| Changed | 2 November 2026 |
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.