Math 2.0

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 μ(x,y)=(−1)ρ(y)−ρ(x)\mu(x, y) = (-1)^{\rho(y) - \rho(x)}, where ρ\rho is the rank. Face lattices of convex polytopes are Eulerian, and the condition encodes the Euler–Poincaré relation for their face numbers.

Further reading

  1. Web https://en.wikipedia.org/wiki/Eulerian_poset
About this page
TagN1Q0BJAEFX
URIm2://N1Q0BJAEFX
Kindconcept
WritingW0 stub
MSC06A07, 52B05
SpecializesGraded poset
Same as
Changed2 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.

What links here

Definitions

Instances