AlmostPositiveRootCount

The number of almost positive roots: the positive roots and the negatives of the simple roots.

✓ checked against that system · ! checked, with disagreements (hover a chip)FindStatSt000853via CartanType✓↗

AlmostPositiveRootCount(cartanType)The number of almost positive roots: the positive roots and the negatives of the simple roots.

Typed signatures

Type	Package	Applies
(cartan_type) -> number	combinatorics	always

Domain: Cartan type statistics

Details

• Defined over CartanType as an expression in _x, evaluated by compute-engine — the definition IS the implementation.
• Takes a CartanType and 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

Apply(
       (ds: list<integer>) => Max(Sum(ds), 0),
       Range(2, _x[2] + 1, 1) if _x[1] == "A" else Map(
                                                        Function(2i, i),
                                                        Range(1, _x[2]),
                                                      ) if _x[1] == "B" else Map(
                                                                                 Function(2i, i),
                                                                                 Range(1, _x[2]),
                                                                               ) if _x[1] == "C" else Join(
                                                                                                           Filter(
                                                                                                                   Map(Function(2i, i), Range(1, _x[2] - 1)),
                                                                                                                   Function(e < _x[2], e),
                                                                                                                 ),
                                                                                                           [_x[2]],
                                                                                                           Filter(
                                                                                                                   Map(Function(2i, i), Range(1, _x[2] - 1)),
                                                                                                                   Function(e >= _x[2], e),
                                                                                                                 ),
                                                                                                         ) if _x[1] == "D" else ([2, 5, 6, 8, 9, 12] if _x[2] == 6 else [2, 6, 8, 10, 12, 14, 18] if _x[2] == 7 else [2, 8, 12, 14, 18, 20, 24, 30]) if _x[1] == "E" else [2, 6, 8, 12] if _x[1] == "F" else [2, 6],
     )

Examples

Basic #

the type $D_5$

live ↗

In$\mathrm{AlmostPositiveRootCount}(\operatorname{CartanType}((\text{D},5)))$Out$25$

the type $E_6$

live ↗

In$\mathrm{AlmostPositiveRootCount}(\operatorname{CartanType}((\text{E},6)))$Out$42$

Properties #

FindStat's value for ['A',1]

live ↗

In$\mathrm{CombinatorialStat}(\operatorname{CartanType}(("A",1)), \text{AlmostPositiveRootCount})$Out$2$

Known value · FindStat St000853

FindStat's value for ['A',2]

live ↗

In$\mathrm{CombinatorialStat}(\operatorname{CartanType}(("A",2)), \text{AlmostPositiveRootCount})$Out$5$

Known value · FindStat St000853

FindStat's value for ['A',3]

live ↗

In$\mathrm{CombinatorialStat}(\operatorname{CartanType}(("A",3)), \text{AlmostPositiveRootCount})$Out$9$

Known value · FindStat St000853

About

Examples	5
Crosswalk	FindStat