NonzeroEntryCount

The number of nonzero entries.

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

NonzeroEntryCount(tableau)The number of nonzero entries.

Typed signatures

Type	Package	Applies
(alternating_sign_matrix) -> number	combinatorics	always

Domain: Alternating sign matrix statistics

Details

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

Definition

Epsil, as the implementation runs it.

on AlternatingSignMatrix, over _x

0 if Length(_x) < 1 else Apply((cells: list<integer>) => Apply(
                                                                (side: integer) => Count(Filter(cells, Function(e != 0, e))),
                                                                Length(_x),
                                                              ), Flatten(_x))

Examples

Basic #

the alternating sign matrix $[[0,1,0],[1,-1,1],[0,1,0]]$

live ↗

In$\mathrm{NonzeroEntryCount}({\operatorname{AlternatingSignMatrix}}([[0, 1, 0], [1, -1, 1], [0, 1, 0]]))$Out$5$

Properties #

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

live ↗

In$\mathrm{CombinatorialStat}({\operatorname{AlternatingSignMatrix}}([[0, 1], [1, 0]]), \text{NonzeroEntryCount})$Out$2$

Known value · FindStat St000890

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

live ↗

In$\mathrm{CombinatorialStat}({\operatorname{AlternatingSignMatrix}}([[1, 0], [0, 1]]), \text{NonzeroEntryCount})$Out$2$

Known value · FindStat St000890

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

live ↗

In$\mathrm{CombinatorialStat}({\operatorname{AlternatingSignMatrix}}([[0, 0, 1], [0, 1, 0], [1, 0, 0]]), \text{NonzeroEntryCount})$Out$3$

Known value · FindStat St000890

About

Examples	4
Crosswalk	FindStat