CommutativePositiveRootCount
The commutative positive roots: those whose upper ideal in the root poset is abelian.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St001173via CartanType✓CommutativePositiveRootCount(cartanType)The commutative positive roots: those whose upper ideal in the root poset is abelian.Typed signatures
| Type | Package | Applies |
|---|---|---|
(cartan_type) -> number | combinatorics | always |
Details
- Defined over
CartanTypeas an expression in_x, evaluated by compute-engine — the definition IS the implementation. - Takes a
CartanTypeand nothing else — it reads values against their positions, or walks the orbits, so it needs the bijection. Applying it to a bare list is a type error, not a wrong answer.
Definition
Epsil, as the implementation runs it.
on CartanType, over _x
_x[2] * (_x[2] + 1) / 2 if _x[1] == "A" else _x[2] * (_x[2] + 1) / 2 if _x[1] ==
"B" else _x[2] *
(_x[2] +
1) /
2 if _x[1] == "C" else _x[2] *
(_x[2] + 1) /
2 +
(_x[2] - 3) if _x[1] == "D" else (25 if _x[2] == 6 else 34 if _x[2] == 7 else 44) if _x[1] == "E" else 10 if _x[1] == "F" else 3Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | FindStat |