- FindStat

edit this statistic or download as text // json

Identifier

St000678: Dyck paths ⟶ ℤ

Values

[1,0,1,0] => 2

[1,1,0,0] => 1

[1,0,1,0,1,0] => 3

[1,0,1,1,0,0] => 1

[1,1,0,0,1,0] => 2

[1,1,0,1,0,0] => 2

[1,1,1,0,0,0] => 1

[1,0,1,0,1,0,1,0] => 4

[1,0,1,0,1,1,0,0] => 1

[1,0,1,1,0,0,1,0] => 2

[1,0,1,1,0,1,0,0] => 2

[1,0,1,1,1,0,0,0] => 1

[1,1,0,0,1,0,1,0] => 3

[1,1,0,0,1,1,0,0] => 1

[1,1,0,1,0,0,1,0] => 3

[1,1,0,1,0,1,0,0] => 3

[1,1,0,1,1,0,0,0] => 1

[1,1,1,0,0,0,1,0] => 2

[1,1,1,0,0,1,0,0] => 2

[1,1,1,0,1,0,0,0] => 2

[1,1,1,1,0,0,0,0] => 1

[1,0,1,0,1,0,1,0,1,0] => 5

[1,0,1,0,1,0,1,1,0,0] => 1

[1,0,1,0,1,1,0,0,1,0] => 2

[1,0,1,0,1,1,0,1,0,0] => 2

[1,0,1,0,1,1,1,0,0,0] => 1

[1,0,1,1,0,0,1,0,1,0] => 3

[1,0,1,1,0,0,1,1,0,0] => 1

[1,0,1,1,0,1,0,0,1,0] => 3

[1,0,1,1,0,1,0,1,0,0] => 3

[1,0,1,1,0,1,1,0,0,0] => 1

[1,0,1,1,1,0,0,0,1,0] => 2

[1,0,1,1,1,0,0,1,0,0] => 2

[1,0,1,1,1,0,1,0,0,0] => 2

[1,0,1,1,1,1,0,0,0,0] => 1

[1,1,0,0,1,0,1,0,1,0] => 4

[1,1,0,0,1,0,1,1,0,0] => 1

[1,1,0,0,1,1,0,0,1,0] => 2

[1,1,0,0,1,1,0,1,0,0] => 2

[1,1,0,0,1,1,1,0,0,0] => 1

[1,1,0,1,0,0,1,0,1,0] => 4

[1,1,0,1,0,0,1,1,0,0] => 1

[1,1,0,1,0,1,0,0,1,0] => 4

[1,1,0,1,0,1,0,1,0,0] => 4

[1,1,0,1,0,1,1,0,0,0] => 1

[1,1,0,1,1,0,0,0,1,0] => 2

[1,1,0,1,1,0,0,1,0,0] => 2

[1,1,0,1,1,0,1,0,0,0] => 2

[1,1,0,1,1,1,0,0,0,0] => 1

[1,1,1,0,0,0,1,0,1,0] => 3

[1,1,1,0,0,0,1,1,0,0] => 1

[1,1,1,0,0,1,0,0,1,0] => 3

[1,1,1,0,0,1,0,1,0,0] => 3

[1,1,1,0,0,1,1,0,0,0] => 1

[1,1,1,0,1,0,0,0,1,0] => 3

[1,1,1,0,1,0,0,1,0,0] => 3

[1,1,1,0,1,0,1,0,0,0] => 3

[1,1,1,0,1,1,0,0,0,0] => 1

[1,1,1,1,0,0,0,0,1,0] => 2

[1,1,1,1,0,0,0,1,0,0] => 2

[1,1,1,1,0,0,1,0,0,0] => 2

[1,1,1,1,0,1,0,0,0,0] => 2

[1,1,1,1,1,0,0,0,0,0] => 1

[1,0,1,0,1,0,1,0,1,0,1,0] => 6

[1,0,1,0,1,0,1,0,1,1,0,0] => 1

[1,0,1,0,1,0,1,1,0,0,1,0] => 2

[1,0,1,0,1,0,1,1,0,1,0,0] => 2

[1,0,1,0,1,0,1,1,1,0,0,0] => 1

[1,0,1,0,1,1,0,0,1,0,1,0] => 3

[1,0,1,0,1,1,0,0,1,1,0,0] => 1

[1,0,1,0,1,1,0,1,0,0,1,0] => 3

[1,0,1,0,1,1,0,1,0,1,0,0] => 3

[1,0,1,0,1,1,0,1,1,0,0,0] => 1

[1,0,1,0,1,1,1,0,0,0,1,0] => 2

[1,0,1,0,1,1,1,0,0,1,0,0] => 2

[1,0,1,0,1,1,1,0,1,0,0,0] => 2

[1,0,1,0,1,1,1,1,0,0,0,0] => 1

[1,0,1,1,0,0,1,0,1,0,1,0] => 4

[1,0,1,1,0,0,1,0,1,1,0,0] => 1

[1,0,1,1,0,0,1,1,0,0,1,0] => 2

[1,0,1,1,0,0,1,1,0,1,0,0] => 2

[1,0,1,1,0,0,1,1,1,0,0,0] => 1

[1,0,1,1,0,1,0,0,1,0,1,0] => 4

[1,0,1,1,0,1,0,0,1,1,0,0] => 1

[1,0,1,1,0,1,0,1,0,0,1,0] => 4

[1,0,1,1,0,1,0,1,0,1,0,0] => 4

[1,0,1,1,0,1,0,1,1,0,0,0] => 1

[1,0,1,1,0,1,1,0,0,0,1,0] => 2

[1,0,1,1,0,1,1,0,0,1,0,0] => 2

[1,0,1,1,0,1,1,0,1,0,0,0] => 2

[1,0,1,1,0,1,1,1,0,0,0,0] => 1

[1,0,1,1,1,0,0,0,1,0,1,0] => 3

[1,0,1,1,1,0,0,0,1,1,0,0] => 1

[1,0,1,1,1,0,0,1,0,0,1,0] => 3

[1,0,1,1,1,0,0,1,0,1,0,0] => 3

[1,0,1,1,1,0,0,1,1,0,0,0] => 1

[1,0,1,1,1,0,1,0,0,0,1,0] => 3

[1,0,1,1,1,0,1,0,0,1,0,0] => 3

[1,0,1,1,1,0,1,0,1,0,0,0] => 3

[1,0,1,1,1,0,1,1,0,0,0,0] => 1

[1,0,1,1,1,1,0,0,0,0,1,0] => 2

>>> 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

click to show known generating functions

$F_{2} = q + q^{2}$

$F_{3} = 2\ q + 2\ q^{2} + q^{3}$

$F_{4} = 5\ q + 5\ q^{2} + 3\ q^{3} + q^{4}$

$F_{5} = 14\ q + 14\ q^{2} + 9\ q^{3} + 4\ q^{4} + q^{5}$

$F_{6} = 42\ q + 42\ q^{2} + 28\ q^{3} + 14\ q^{4} + 5\ q^{5} + q^{6}$

$F_{7} = 132\ q + 132\ q^{2} + 90\ q^{3} + 48\ q^{4} + 20\ q^{5} + 6\ q^{6} + q^{7}$

Description

The number of up steps after the last double rise of a Dyck path.

References

[1] Adin, R. M., Bagno, E., Roichman, Y. Block decomposition of permutations and Schur-positivity arXiv:1611.06979

Code

def statistic(D):
    i = 0
    j = 0
    for j in range(1,len(D)):
        if D[-j] == 1:
            i += 1
            if D[-j-1] == 1:
                return i
    return i+1

Created

Jan 02, 2017 at 00:13 by Martin Rubey

Updated

Jan 02, 2017 at 00:13 by Martin Rubey