Skip to content

AdjacentSuccessorCount ​

Entries whose successor is the neighbor to their right or directly below them.

✓ checked against that system · ! checked, with disagreements (hover a chip)FindStatSt000743via StandardTableau✓
AdjacentSuccessorCount(tableau)Entries whose successor is the neighbor to their right or directly below them.
Typed signatures
TypePackageApplies
(standard_tableau) -> numbercombinatoricsalways

Domain: Tableau statistics

Details
  • Defined over StandardTableau as an expression in _x, evaluated by compute-engine — the definition IS the implementation.
  • Takes a StandardTableau 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.
  • Consecutive entries of a row or a column are always neighbors, so this counts the entries e with e + 1 in the same row or the same column.

Definition

Epsil, as the implementation runs it.

on StandardTableau, over _x

0 if Length(Flatten(_x)) < 2 else Apply((reading: list<integer>) => Apply(
                                                                           (lengths: list<integer>) => Apply(
                                                                                                              (rowIds: list<integer>) => Apply(
                                                                                                                                                (columnIds: list<integer>) => Max(Sum(Map(Function(1 if rowIds[IndexOf(reading, e + 1)] ==
                                                                                                                                                                                                        rowIds[IndexOf(reading, e)] ||
                                                                                                                                                                                                        columnIds[IndexOf(reading, e + 1)] ==
                                                                                                                                                                                                        columnIds[IndexOf(reading, e)] else 0, e), Range(1, Length(reading) - 1, 1))), 0),
                                                                                                                                                Flatten(Map(Function(Range(1, lengths[i], 1), i), Range(1, Length(_x)))),
                                                                                                                                              ),
                                                                                                              Flatten(Map(
                                                                                                                           Function(Map(Function(i, j), Range(1, lengths[i], 1)), i),
                                                                                                                           Range(1, Length(_x)),
                                                                                                                         )),
                                                                                                            ),
                                                                           Map(
                                                                                Function(Length(r), r),
                                                                                _x,
                                                                              ),
                                                                         ), Flatten(_x))

Examples

Basic #

the standard tableau [[1,2,4],[3,6],[5]][[1,2,4],[3,6],[5]]

live ↗
InAdjacentSuccessorCount(StandardTableau⁡([[1,2,4],[3,6],[5]]))\mathrm{AdjacentSuccessorCount}({\operatorname{StandardTableau}}([[1, 2, 4], [3, 6], [5]]))Out11
Properties #

FindStat's value for [[1]]

live ↗
InCombinatorialStat(StandardTableau⁡([[1]]),AdjacentSuccessorCount)\mathrm{CombinatorialStat}({\operatorname{StandardTableau}}([[1]]), \text{AdjacentSuccessorCount})Out00

Known value · FindStat St000743

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

live ↗
InCombinatorialStat(StandardTableau⁡([[1,2]]),AdjacentSuccessorCount)\mathrm{CombinatorialStat}({\operatorname{StandardTableau}}([[1, 2]]), \text{AdjacentSuccessorCount})Out11

Known value · FindStat St000743

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

live ↗
InCombinatorialStat(StandardTableau⁡([[1,2,3]]),AdjacentSuccessorCount)\mathrm{CombinatorialStat}({\operatorname{StandardTableau}}([[1, 2, 3]]), \text{AdjacentSuccessorCount})Out22

Known value · FindStat St000743

About
Examples4
CrosswalkFindStat