FirstDirectSummandSize

The smallest k with {p(1), ..., p(k)} = {1, ..., k}.

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

FirstDirectSummandSize(p)The smallest k with {p(1), ..., p(k)} = {1, ..., k}.

Typed signatures

Type	Package	Applies
(permutation) -> number	combinatorics	always

Domain: Permutation statistics

Details

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

0 if Length(_x) < 1 else Min(Filter(
                                     Range(1, Length(_x)),
                                     Function(Max(Map(
                                                       Function(_x[j], j),
                                                       Range(1, i),
                                                     )) == i, i),
                                   ))

Examples

Basic #

the one-line word $312$

live ↗

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

the one-line word $2413$

live ↗

In$\mathrm{FirstDirectSummandSize}({\operatorname{Permutation}}([2, 4, 1, 3]))$Out$4$

Properties #

FindStat's value for [1]

live ↗

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

Known value · FindStat St000501

FindStat's value for [1,2]

live ↗

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

Known value · FindStat St000501

FindStat's value for [2,1]

live ↗

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

Known value · FindStat St000501

About

Examples	5
Crosswalk	FindStat