Identifier
- St001744: Permutations ⟶ ℤ
Values
[1] => 0
[1,2] => 0
[2,1] => 0
[1,2,3] => 0
[1,3,2] => 0
[2,1,3] => 0
[2,3,1] => 0
[3,1,2] => 1
[3,2,1] => 0
[1,2,3,4] => 0
[1,2,4,3] => 0
[1,3,2,4] => 0
[1,3,4,2] => 0
[1,4,2,3] => 1
[1,4,3,2] => 0
[2,1,3,4] => 0
[2,1,4,3] => 0
[2,3,1,4] => 0
[2,3,4,1] => 0
[2,4,1,3] => 1
[2,4,3,1] => 0
[3,1,2,4] => 1
[3,1,4,2] => 0
[3,2,1,4] => 0
[3,2,4,1] => 0
[3,4,1,2] => 1
[3,4,2,1] => 0
[4,1,2,3] => 2
[4,1,3,2] => 1
[4,2,1,3] => 1
[4,2,3,1] => 1
[4,3,1,2] => 1
[4,3,2,1] => 0
[1,2,3,4,5] => 0
[1,2,3,5,4] => 0
[1,2,4,3,5] => 0
[1,2,4,5,3] => 0
[1,2,5,3,4] => 1
[1,2,5,4,3] => 0
[1,3,2,4,5] => 0
[1,3,2,5,4] => 0
[1,3,4,2,5] => 0
[1,3,4,5,2] => 0
[1,3,5,2,4] => 1
[1,3,5,4,2] => 0
[1,4,2,3,5] => 1
[1,4,2,5,3] => 0
[1,4,3,2,5] => 0
[1,4,3,5,2] => 0
[1,4,5,2,3] => 1
[1,4,5,3,2] => 0
[1,5,2,3,4] => 2
[1,5,2,4,3] => 1
[1,5,3,2,4] => 1
[1,5,3,4,2] => 1
[1,5,4,2,3] => 1
[1,5,4,3,2] => 0
[2,1,3,4,5] => 0
[2,1,3,5,4] => 0
[2,1,4,3,5] => 0
[2,1,4,5,3] => 0
[2,1,5,3,4] => 1
[2,1,5,4,3] => 0
[2,3,1,4,5] => 0
[2,3,1,5,4] => 0
[2,3,4,1,5] => 0
[2,3,4,5,1] => 0
[2,3,5,1,4] => 1
[2,3,5,4,1] => 0
[2,4,1,3,5] => 1
[2,4,1,5,3] => 0
[2,4,3,1,5] => 0
[2,4,3,5,1] => 0
[2,4,5,1,3] => 1
[2,4,5,3,1] => 0
[2,5,1,3,4] => 2
[2,5,1,4,3] => 1
[2,5,3,1,4] => 1
[2,5,3,4,1] => 1
[2,5,4,1,3] => 1
[2,5,4,3,1] => 0
[3,1,2,4,5] => 1
[3,1,2,5,4] => 1
[3,1,4,2,5] => 0
[3,1,4,5,2] => 0
[3,1,5,2,4] => 1
[3,1,5,4,2] => 0
[3,2,1,4,5] => 0
[3,2,1,5,4] => 0
[3,2,4,1,5] => 0
[3,2,4,5,1] => 0
[3,2,5,1,4] => 1
[3,2,5,4,1] => 0
[3,4,1,2,5] => 1
[3,4,1,5,2] => 0
[3,4,2,1,5] => 0
[3,4,2,5,1] => 0
[3,4,5,1,2] => 1
[3,4,5,2,1] => 0
[3,5,1,2,4] => 2
[3,5,1,4,2] => 1
>>> Load all 1200 entries. <<<
search for individual values
searching the database for the individual values of this statistic
/
search for generating function
searching the database for statistics with the same generating function
Description
The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation.
Let ν be a (partial) permutation of [k] with m letters together with dashes between some of its letters. An occurrence of ν in a permutation τ is a subsequence τa1,…,τam
such that ai+1=ai+1 whenever there is a dash between the i-th and the (i+1)-st letter of ν, which is order isomorphic to ν.
Thus, ν is a vincular pattern, except that it is not required to be a permutation.
An arrow pattern of size k consists of such a generalized vincular pattern ν and arrows b1→c1,b2→c2,…, such that precisely the numbers 1,…,k appear in the vincular pattern and the arrows.
Let Φ be the map Mp00087inverse first fundamental transformation. Let τ be a permutation and σ=Φ(τ). Then a subsequence w=(xa1,…,xam) of τ is an occurrence of the arrow pattern if w is an occurrence of ν, for each arrow b→c we have σ(xb)=xc and x1<x2<⋯<xk.
Let ν be a (partial) permutation of [k] with m letters together with dashes between some of its letters. An occurrence of ν in a permutation τ is a subsequence τa1,…,τam
such that ai+1=ai+1 whenever there is a dash between the i-th and the (i+1)-st letter of ν, which is order isomorphic to ν.
Thus, ν is a vincular pattern, except that it is not required to be a permutation.
An arrow pattern of size k consists of such a generalized vincular pattern ν and arrows b1→c1,b2→c2,…, such that precisely the numbers 1,…,k appear in the vincular pattern and the arrows.
Let Φ be the map Mp00087inverse first fundamental transformation. Let τ be a permutation and σ=Φ(τ). Then a subsequence w=(xa1,…,xam) of τ is an occurrence of the arrow pattern if w is an occurrence of ν, for each arrow b→c we have σ(xb)=xc and x1<x2<⋯<xk.
References
[1] Berman, Y., Tenner, B. E. Pattern-functions, statistics, and shallow permutations arXiv:2110.11146
Code
def vincular_occurrences_iterator(perm, pat, columns):
perm = Permutation(perm)
for pos in perm.pattern_positions(pat):
if all(pos[i-1]+1 == pos[i] for i in columns):
yield tuple(pos)
from sage.combinat.permutation import to_standard
def arrow_occurrences_iterator(perm, pat, columns, arrows):
perm = Permutation(perm)
s = set(pat + [p for p, _ in arrows] + [q for _, q in arrows])
k = max(s)
assert min(s) == 1 and len(s) == k
nu = to_standard(pat)
sigma = perm.fundamental_transformation_inverse()
for pos in vincular_occurrences_iterator(perm, nu, columns):
x = [None]*k
for i, a in enumerate(pos):
x[pat[i]-1] = perm[a]
for p, q in arrows:
if x[p-1] is None and x[q-1] is None:
raise ValueError("doesn't work for %s %s %s %s" % (perm, pat, columns, arrows))
if x[p-1] is None:
x[p-1] = sigma.inverse()(x[q-1])
elif x[q-1] is None:
x[q-1] = sigma(x[p-1])
if (all(x[i] < x[i+1] for i in range(len(x)-1))
and all(sigma(x[p-1]) == x[q-1] for p, q in arrows)):
yield tuple(pos)
def arrow_occurrences(perm, pat, columns, arrows):
return list(arrow_occurrences_iterator(perm, pat, columns, arrows))
def statistic(pi):
return len(arrow_occurrences(pi, [1,2], [1], [[1,2]]))
Created
Oct 23, 2021 at 00:29 by Martin Rubey
Updated
Oct 23, 2021 at 00:29 by Martin Rubey
searching the database
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!