Your data matches 1 statistic following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000923
(load all 4 compositions to match this statistic)
Mapping
St000923: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => 2
[2,1] => 2
[1,2,3] => 3
[1,3,2] => 2
[2,1,3] => 2
[2,3,1] => 2
[3,1,2] => 2
[3,2,1] => 3
[1,2,3,4] => 4
[1,2,4,3] => 3
[1,3,2,4] => 3
[1,3,4,2] => 3
[1,4,2,3] => 3
[1,4,3,2] => 3
[2,1,3,4] => 3
[2,1,4,3] => 3
[2,3,1,4] => 3
[2,3,4,1] => 3
[2,4,1,3] => 3
[2,4,3,1] => 3
[3,1,2,4] => 3
[3,1,4,2] => 3
[3,2,1,4] => 3
[3,2,4,1] => 3
[3,4,1,2] => 3
[3,4,2,1] => 3
[4,1,2,3] => 3
[4,1,3,2] => 3
[4,2,1,3] => 3
[4,2,3,1] => 3
[4,3,1,2] => 3
[4,3,2,1] => 4
[1,2,3,4,5] => 5
[1,2,3,5,4] => 4
[1,2,4,3,5] => 3
[1,2,4,5,3] => 4
[1,2,5,3,4] => 3
[1,2,5,4,3] => 3
[1,3,2,4,5] => 3
[1,3,2,5,4] => 4
[1,3,4,2,5] => 3
[1,3,4,5,2] => 4
[1,3,5,2,4] => 3
[1,3,5,4,2] => 3
[1,4,2,3,5] => 3
[1,4,2,5,3] => 4
[1,4,3,2,5] => 3
[1,4,3,5,2] => 3
[1,4,5,2,3] => 3
[1,4,5,3,2] => 3
Description
The minimal number with no two order isomorphic substrings of this length in a permutation. For example, the length $3$ substrings of the permutation $12435$ are $124$, $243$ and $435$, whereas its length $2$ substrings are $12$, $24$, $43$ and $35$. No two sequences among $124$, $243$ and $435$ are order isomorphic, but $12$ and $24$ are, so the statistic on $12435$ is $3$. This is inspired by [[St000922]].