SignedAlignmentCount
The alignments of p: its nesting alignments, those of type EN and those of type NE.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St001822via SignedPermutation✓SignedAlignmentCount(p)The alignments of p: its nesting alignments, those of type EN and those of type NE.Typed signatures
| Type | Package | Applies |
|---|---|---|
(signed_permutation) -> number | combinatorics | always |
Details
- Defined over
SignedPermutationas an expression in_x, evaluated by compute-engine — the definition IS the implementation. - Takes a
SignedPermutationand 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 St001822 (St001866, St001867, St001868 summed). Not Alignments, which counts the pairs of arcs of an unsigned permutation.
Definition
Epsil, as the implementation runs it.
on SignedPermutation, over _x
0 if Length(_x) < 1 else Max(0 + Sum(Map(
Function(Count(Filter(
Range(
1,
Length(_x),
),
Function(j < i &&
_x[i] <
_x[j] && _x[j] <
j, j),
)), i),
Range(1, Length(_x)),
)) + Sum(Map(
Function(Count(Filter(
Range(1, Length(_x)),
Function(j <= _x[j] &&
_x[j] < -_x[i], j),
)), i),
Range(1, Length(_x)),
)) + Sum(Map(
Function(Count(Filter(
Range(1, Length(_x)),
Function(j > i &&
j <= _x[j] &&
_x[j] < _x[i], j),
)), i),
Range(
1,
Length(_x),
),
)) + Sum(Map(
Function(Count(Filter(
Range(1, Length(_x)),
Function(_x[i] < 0 &&
-_x[i] < _x[j] &&
_x[j] < j, j),
)), i),
Range(1, Length(_x)),
)) +
Sum(Map(
Function(Count(Filter(
Range(
1,
Length(_x),
),
Function(i <= _x[i] &&
_x[i] <
_x[j] && _x[j] <
j, j),
)), i),
Range(1, Length(_x)),
)) + Sum(Map(Function(Count(Filter(
Range(
1,
Length(_x),
),
Function(_x[i] <
i && i <
j &&
j <=
_x[j], j),
)), i), Range(
1,
Length(_x),
))), 0)Examples
Properties #
About
| Examples | 4 |
|---|---|
| Crosswalk | FindStat |