"""Check the orbifold triangle decomposition of every C_n second-node matrix in a range.""" import argparse from collections import Counter import sys from pathlib import Path sys.path.insert(0, str(Path(__file__).resolve().parents[1] / 'verification')) from kr_matrices import translated_seed from check_bruhat import c_prefix_degrees def c_word(n, r): return [k for h in range(r, n) for k in range(h, h-r, -1)] + list(range(n, -1, -1)) * r def orbifold_matrix(n, labels): arc = {name:i for i, name in enumerate(labels)} A = {1: 'tau', **{i:(i,1) for i in range(2,n)}} B = {1:(1,2), **{i:(i,3) for i in range(2,n-1)}, n-1:(n-1,2)} C = {1:(1,1), **{i:(i,2) for i in range(2,n-1)}} pending = {(0,1),(n,1)} triangles = [(B[1],(0,1),A[1]),(A[n-1],(n,1),B[n-1])] for i in range(1,n-1): triangles.extend([(A[i],A[i+1],C[i]),(C[i],B[i+1],B[i])]) matrix = [[0]*len(labels) for _ in labels] for sides in triangles: for x,y in zip(sides, sides[1:]+sides[:1]): matrix[arc[x]][arc[y]] += 1 + (x in pending) matrix[arc[y]][arc[x]] -= 1 + (y in pending) return matrix def verify(n, r): word = c_word(n,r) seed = translated_seed('C', n, r, word) degrees = [1] * (r*(n-r)) + [2] * (r*(n+1)) assert seed['translated_degrees'] == degrees == c_prefix_degrees(seed) count = Counter() labels = [] for j,i in enumerate(word,1): count[i] += 1 if j in seed['mutable_positions']: labels.append((i,count[i])) labels.append('tau') expected = {} if r == 1 else {(r,1):-1,(1,1):1,(1,2):-1,(0,1):2} column = {name:row[-1] for name,row in zip(labels,seed['principal']) if row[-1]} assert column == expected if r == 2: assert orbifold_matrix(n,labels) == seed['principal'] if __name__ == '__main__': parser = argparse.ArgumentParser(description=__doc__) parser.add_argument('--max-rank',type=int,default=10) args = parser.parse_args() for n in range(2,args.max_rank+1): for r in range(1,n): verify(n,r) print(f'C{n}: all short-node degree lists and tau columns, all second-node triangle entries',flush=True)