def op(vector):
ans = 0
for mu, coefficient in vector.items():
e = 0
i = abs(index)
row = Partition.find_shifted_inner_corner(mu, i)
while row is not None:
i = i + 1
mu = Partition.remove_inner_corner(mu, row)
ans += Vector({mu: (-beta)**e})
row = Partition.find_shifted_inner_corner(mu, i)
e += 1
return ans
def op(vector):
ans = 0
for mu, coefficient in vector.items():
row = Partition.find_shifted_inner_corner(mu, abs(index))
if row is not None:
ans += Vector({mu: beta * coefficient})
continue
row = Partition.find_shifted_outer_corner(mu, abs(index))
if row is not None:
nu = Partition.add(mu, row)
ans += Vector({nu: coefficient})
return ans