PositiveEntryCount

The number of positive entries.

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

PositiveEntryCount(p)The number of positive entries.

Typed signatures

Type	Package	Applies
(signed_permutation) -> number	combinatorics	always

Domain: Signed permutation statistics

Details

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

0 if Length(_x) < 1 else Count(Filter(
                                       Range(1, Length(_x)),
                                       Function(_x[i] > 0, i),
                                     ))

Examples

Basic #

the signed word $2\,\bar{1}\,\bar{3}$

live ↗

In$\mathrm{PositiveEntryCount}({\operatorname{SignedPermutation}}([2, -1, -3]))$Out$1$

Properties #

FindStat's value for [1]

live ↗

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

Known value · FindStat St001430

FindStat's value for [-1]

live ↗

In$\mathrm{CombinatorialStat}({\operatorname{SignedPermutation}}([-1]), \text{PositiveEntryCount})$Out$0$

Known value · FindStat St001430

FindStat's value for [1,2]

live ↗

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

Known value · FindStat St001430

About

Examples	4
Crosswalk	FindStat