Identifier
- St000964: Dyck paths ⟶ ℤ
Values
=>
Cc0005;cc-rep
[1,0]=>1
[1,0,1,0]=>1
[1,1,0,0]=>3
[1,0,1,0,1,0]=>1
[1,0,1,1,0,0]=>1
[1,1,0,0,1,0]=>1
[1,1,0,1,0,0]=>3
[1,1,1,0,0,0]=>6
[1,0,1,0,1,0,1,0]=>1
[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]=>1
[1,1,0,0,1,1,0,0]=>1
[1,1,0,1,0,0,1,0]=>2
[1,1,0,1,0,1,0,0]=>1
[1,1,0,1,1,0,0,0]=>3
[1,1,1,0,0,0,1,0]=>1
[1,1,1,0,0,1,0,0]=>3
[1,1,1,0,1,0,0,0]=>6
[1,1,1,1,0,0,0,0]=>10
[1,0,1,0,1,0,1,0,1,0]=>1
[1,0,1,0,1,0,1,1,0,0]=>1
[1,0,1,0,1,1,0,0,1,0]=>1
[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]=>1
[1,0,1,1,0,0,1,1,0,0]=>2
[1,0,1,1,0,1,0,0,1,0]=>1
[1,0,1,1,0,1,0,1,0,0]=>1
[1,0,1,1,0,1,1,0,0,0]=>2
[1,0,1,1,1,0,0,0,1,0]=>2
[1,0,1,1,1,0,0,1,0,0]=>4
[1,0,1,1,1,0,1,0,0,0]=>3
[1,0,1,1,1,1,0,0,0,0]=>1
[1,1,0,0,1,0,1,0,1,0]=>1
[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]=>2
[1,1,0,1,0,0,1,1,0,0]=>2
[1,1,0,1,0,1,0,0,1,0]=>1
[1,1,0,1,0,1,0,1,0,0]=>3
[1,1,0,1,0,1,1,0,0,0]=>1
[1,1,0,1,1,0,0,0,1,0]=>4
[1,1,0,1,1,0,0,1,0,0]=>4
[1,1,0,1,1,0,1,0,0,0]=>2
[1,1,0,1,1,1,0,0,0,0]=>3
[1,1,1,0,0,0,1,0,1,0]=>1
[1,1,1,0,0,0,1,1,0,0]=>1
[1,1,1,0,0,1,0,0,1,0]=>2
[1,1,1,0,0,1,0,1,0,0]=>1
[1,1,1,0,0,1,1,0,0,0]=>3
[1,1,1,0,1,0,0,0,1,0]=>3
[1,1,1,0,1,0,0,1,0,0]=>2
[1,1,1,0,1,0,1,0,0,0]=>1
[1,1,1,0,1,1,0,0,0,0]=>6
[1,1,1,1,0,0,0,0,1,0]=>1
[1,1,1,1,0,0,0,1,0,0]=>3
[1,1,1,1,0,0,1,0,0,0]=>6
[1,1,1,1,0,1,0,0,0,0]=>10
[1,1,1,1,1,0,0,0,0,0]=>15
[1,0,1,0,1,0,1,0,1,0,1,0]=>1
[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]=>1
[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]=>2
[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]=>1
[1,0,1,0,1,1,0,1,0,1,0,0]=>1
[1,0,1,0,1,1,0,1,1,0,0,0]=>2
[1,0,1,0,1,1,1,0,0,0,1,0]=>1
[1,0,1,0,1,1,1,0,0,1,0,0]=>1
[1,0,1,0,1,1,1,0,1,0,0,0]=>3
[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]=>1
[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]=>3
[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]=>2
[1,0,1,1,0,1,0,0,1,0,1,0]=>1
[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]=>1
[1,0,1,1,0,1,0,1,0,1,0,0]=>1
[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]=>2
[1,0,1,1,1,0,0,0,1,0,1,0]=>1
[1,0,1,1,1,0,0,0,1,1,0,0]=>2
[1,0,1,1,1,0,0,1,0,0,1,0]=>2
[1,0,1,1,1,0,0,1,0,1,0,0]=>1
[1,0,1,1,1,0,0,1,1,0,0,0]=>4
[1,0,1,1,1,0,1,0,0,0,1,0]=>1
[1,0,1,1,1,0,1,0,0,1,0,0]=>1
[1,0,1,1,1,0,1,0,1,0,0,0]=>1
[1,0,1,1,1,0,1,1,0,0,0,0]=>3
[1,0,1,1,1,1,0,0,0,0,1,0]=>2
[1,0,1,1,1,1,0,0,0,1,0,0]=>4
[1,0,1,1,1,1,0,0,1,0,0,0]=>7
[1,0,1,1,1,1,0,1,0,0,0,0]=>4
[1,0,1,1,1,1,1,0,0,0,0,0]=>1
[1,1,0,0,1,0,1,0,1,0,1,0]=>1
[1,1,0,0,1,0,1,0,1,1,0,0]=>1
[1,1,0,0,1,0,1,1,0,0,1,0]=>1
[1,1,0,0,1,0,1,1,0,1,0,0]=>2
[1,1,0,0,1,0,1,1,1,0,0,0]=>1
[1,1,0,0,1,1,0,0,1,0,1,0]=>1
[1,1,0,0,1,1,0,0,1,1,0,0]=>2
[1,1,0,0,1,1,0,1,0,0,1,0]=>1
[1,1,0,0,1,1,0,1,0,1,0,0]=>1
[1,1,0,0,1,1,0,1,1,0,0,0]=>2
[1,1,0,0,1,1,1,0,0,0,1,0]=>2
[1,1,0,0,1,1,1,0,0,1,0,0]=>4
[1,1,0,0,1,1,1,0,1,0,0,0]=>3
[1,1,0,0,1,1,1,1,0,0,0,0]=>1
[1,1,0,1,0,0,1,0,1,0,1,0]=>2
[1,1,0,1,0,0,1,0,1,1,0,0]=>2
[1,1,0,1,0,0,1,1,0,0,1,0]=>2
[1,1,0,1,0,0,1,1,0,1,0,0]=>4
[1,1,0,1,0,0,1,1,1,0,0,0]=>2
[1,1,0,1,0,1,0,0,1,0,1,0]=>1
[1,1,0,1,0,1,0,0,1,1,0,0]=>1
[1,1,0,1,0,1,0,1,0,0,1,0]=>1
[1,1,0,1,0,1,0,1,0,1,0,0]=>3
[1,1,0,1,0,1,0,1,1,0,0,0]=>3
[1,1,0,1,0,1,1,0,0,0,1,0]=>1
[1,1,0,1,0,1,1,0,0,1,0,0]=>2
[1,1,0,1,0,1,1,0,1,0,0,0]=>4
[1,1,0,1,0,1,1,1,0,0,0,0]=>1
[1,1,0,1,1,0,0,0,1,0,1,0]=>1
[1,1,0,1,1,0,0,0,1,1,0,0]=>4
[1,1,0,1,1,0,0,1,0,0,1,0]=>2
[1,1,0,1,1,0,0,1,0,1,0,0]=>2
[1,1,0,1,1,0,0,1,1,0,0,0]=>4
[1,1,0,1,1,0,1,0,0,0,1,0]=>1
[1,1,0,1,1,0,1,0,0,1,0,0]=>1
[1,1,0,1,1,0,1,0,1,0,0,0]=>5
[1,1,0,1,1,0,1,1,0,0,0,0]=>2
[1,1,0,1,1,1,0,0,0,0,1,0]=>4
[1,1,0,1,1,1,0,0,0,1,0,0]=>6
[1,1,0,1,1,1,0,0,1,0,0,0]=>6
[1,1,0,1,1,1,0,1,0,0,0,0]=>3
[1,1,0,1,1,1,1,0,0,0,0,0]=>3
[1,1,1,0,0,0,1,0,1,0,1,0]=>1
[1,1,1,0,0,0,1,0,1,1,0,0]=>1
[1,1,1,0,0,0,1,1,0,0,1,0]=>2
[1,1,1,0,0,0,1,1,0,1,0,0]=>2
[1,1,1,0,0,0,1,1,1,0,0,0]=>1
[1,1,1,0,0,1,0,0,1,0,1,0]=>2
[1,1,1,0,0,1,0,0,1,1,0,0]=>2
[1,1,1,0,0,1,0,1,0,0,1,0]=>1
[1,1,1,0,0,1,0,1,0,1,0,0]=>3
[1,1,1,0,0,1,0,1,1,0,0,0]=>1
[1,1,1,0,0,1,1,0,0,0,1,0]=>4
[1,1,1,0,0,1,1,0,0,1,0,0]=>4
[1,1,1,0,0,1,1,0,1,0,0,0]=>2
[1,1,1,0,0,1,1,1,0,0,0,0]=>3
[1,1,1,0,1,0,0,0,1,0,1,0]=>3
[1,1,1,0,1,0,0,0,1,1,0,0]=>3
[1,1,1,0,1,0,0,1,0,0,1,0]=>2
[1,1,1,0,1,0,0,1,0,1,0,0]=>4
[1,1,1,0,1,0,0,1,1,0,0,0]=>2
[1,1,1,0,1,0,1,0,0,0,1,0]=>1
[1,1,1,0,1,0,1,0,0,1,0,0]=>5
[1,1,1,0,1,0,1,0,1,0,0,0]=>3
[1,1,1,0,1,0,1,1,0,0,0,0]=>1
[1,1,1,0,1,1,0,0,0,0,1,0]=>7
[1,1,1,0,1,1,0,0,0,1,0,0]=>6
[1,1,1,0,1,1,0,0,1,0,0,0]=>4
[1,1,1,0,1,1,0,1,0,0,0,0]=>2
[1,1,1,0,1,1,1,0,0,0,0,0]=>6
[1,1,1,1,0,0,0,0,1,0,1,0]=>1
[1,1,1,1,0,0,0,0,1,1,0,0]=>1
[1,1,1,1,0,0,0,1,0,0,1,0]=>2
[1,1,1,1,0,0,0,1,0,1,0,0]=>1
[1,1,1,1,0,0,0,1,1,0,0,0]=>3
[1,1,1,1,0,0,1,0,0,0,1,0]=>3
[1,1,1,1,0,0,1,0,0,1,0,0]=>2
[1,1,1,1,0,0,1,0,1,0,0,0]=>1
[1,1,1,1,0,0,1,1,0,0,0,0]=>6
[1,1,1,1,0,1,0,0,0,0,1,0]=>4
[1,1,1,1,0,1,0,0,0,1,0,0]=>3
[1,1,1,1,0,1,0,0,1,0,0,0]=>2
[1,1,1,1,0,1,0,1,0,0,0,0]=>1
[1,1,1,1,0,1,1,0,0,0,0,0]=>10
[1,1,1,1,1,0,0,0,0,0,1,0]=>1
[1,1,1,1,1,0,0,0,0,1,0,0]=>3
[1,1,1,1,1,0,0,0,1,0,0,0]=>6
[1,1,1,1,1,0,0,1,0,0,0,0]=>10
[1,1,1,1,1,0,1,0,0,0,0,0]=>15
[1,1,1,1,1,1,0,0,0,0,0,0]=>21
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 dimension of $\operatorname{Ext}^g(D(A),A)$ for the linear Nakayama algebra corresponding to a Dyck path, where $g$ is the global dimension of that algebra.
The correspondence between linear Nakayama algebras and Dyck paths is explained on the Nakayama algebras page.
The correspondence between linear Nakayama algebras and Dyck paths is explained on the Nakayama algebras page.
Code
gap('LoadPackage("QPA");')
def kupisch(D):
DR = D.reverse()
H = DR.heights()
return [1 + H[i] for i, s in enumerate(DR) if s == 0] + [1]
def gldim_from_kupisch(L):
n = len(L)
def f(x, y):
c = (x + y) % n
if c == 0: c = n
z = (x + 1) % n
if z == 0: z = n
return (c, L[z - 1] - y)
temp = [[(i, 1)] for i in range(n)]
for i in range(n):
for _ in range(2 * n + 2):
temp[i].append(f(temp[i][-1][0], temp[i][-1][1]))
temp3 = []
for i in range(n):
zeros = [j + 1 for j in range(len(temp[i])) if temp[i][j][1] == 0]
if zeros:
temp3.append(min(zeros))
else:
return "inf"
return max(temp3) - 2
def statistic(D):
K = kupisch(D)
g = gldim_from_kupisch(K)
if g == "inf":
return Infinity
A = gap.NakayamaAlgebra(K, gap.GF(3))
projA = gap.IndecProjectiveModules(A)
RegA = gap.DirectSumOfQPAModules(projA)
injA = gap.IndecInjectiveModules(A)
CoRegA = gap.DirectSumOfQPAModules(injA)
t = gap.Size(gap.ExtOverAlgebra(gap.NthSyzygy(CoRegA, g - 1), RegA)[2])
return ZZ(t)
Created
Aug 31, 2017 at 11:02 by Rene Marczinzik
Updated
Mar 11, 2026 at 18:22 by Nupur Jain
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!