InnerCornerCount

The cells that can be added to the inner partition, within the rows of the shape.

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

InnerCornerCount(shape)The cells that can be added to the inner partition, within the rows of the shape.

Typed signatures

Type	Package	Applies
(skew_partition) -> number	combinatorics	always

Domain: Skew partition statistics

Details

• Defined over SkewPartition as an expression in _x, evaluated by compute-engine — the definition IS the implementation.
• Takes a SkewPartition 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.
• FindStat's St001487, the outside corners of the inner partition; a reduced shape has no row past the last of the outer partition. The empty shape gives 0.

Definition

Epsil, as the implementation runs it.

on SkewPartition, over _x

0 if Length(_x[1]) == 0 else Apply((lam: list<integer>) => Apply((raw: list<integer>) => Apply(
                                                                                                (mu: list<integer>) => Max(Sum(Map(
                                                                                                                                    Function(1 if i == 1 else 1 if mu[i - 1] >
                                                                                                                                                                   mu[i] else 0, i),
                                                                                                                                    Range(1, Length(lam)),
                                                                                                                                  )), 0),
                                                                                                Map(
                                                                                                     Function(raw[i] if i <= Length(raw) else 0, i),
                                                                                                     Range(1, Length(lam)),
                                                                                                   ),
                                                                                              ), _x[2]), _x[1])

Examples

Basic #

the skew partition $[[3,1],[1]]$

live ↗

In$\mathrm{InnerCornerCount}({\operatorname{SkewPartition}}([[3, 1], [1]]))$Out$2$

Properties #

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

live ↗

In$\mathrm{CombinatorialStat}({\operatorname{SkewPartition}}([[1], []]), \text{InnerCornerCount})$Out$1$

Known value · FindStat St001487

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

live ↗

In$\mathrm{CombinatorialStat}({\operatorname{SkewPartition}}([[2], []]), \text{InnerCornerCount})$Out$1$

Known value · FindStat St001487

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

live ↗

In$\mathrm{CombinatorialStat}({\operatorname{SkewPartition}}([[3], []]), \text{InnerCornerCount})$Out$1$

Known value · FindStat St001487

About

Examples	4
Crosswalk	FindStat