PositiveBeforeLargerNegativePairCount on SignedPermutation
Pairs i < j with 0 < p(i) < -p(j): the occurrences of the signed pattern 1-2.
FindStat's St001771. A positive entry followed, later, by a negative entry of larger absolute value.
Called as CombinatorialStat(x, "PositiveBeforeLargerNegativePairCount"). The head's page has its examples.
Live
Distribution
Over SignedPermutations at each size, tallied here in your browser; sizes past 6 are not offered.
FindStat St001771
The number of occurrences of the signed pattern 1-2 in a signed permutation.
| Object | Value |
|---|---|
[1] | 0 |
[-1] | 0 |
[1,2] | 0 |
[2,1] | 0 |
[-1,2] | 0 |
[-2,1] | 0 |
[1,-2] | 1 |
[2,-1] | 0 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St001771 has the rest.