n=5 k=5 C=((5,), 1) real=True: rule disagreements 2; claim's pi bijective True, inside support True; own perfect matching True; |T(C)|=1
n=5 k=5 C=((5,), -1) real=True: rule disagreements 2; claim's pi bijective True, inside support True; own perfect matching True; |T(C)|=1
n=5 Lemma 7.0 (exact values): independent of C True, independent of halves True
n=5 S_n level: 7 x 7 type pairs, disagreements with the rule (l+l'<=n+1, parity): 0  (0.0s)
n=5 done in 0.0s
n=7 k=9 C=((7,), 1) real=False: rule disagreements 0; claim's pi bijective True, inside support True; own perfect matching True; |T(C)|=3
n=7 k=9 C=((7,), -1) real=False: rule disagreements 0; claim's pi bijective True, inside support True; own perfect matching True; |T(C)|=3
n=7 Lemma 7.0 (exact values): independent of C True, independent of halves True
n=7 S_n level: 15 x 15 type pairs, disagreements with the rule (l+l'<=n+1, parity): 0  (0.0s)
n=7 done in 0.0s
n=9 k=18 C=((9,), 1) real=True: rule disagreements 0; claim's pi bijective True, inside support True; own perfect matching True; |T(C)|=3
n=9 k=18 C=((9,), -1) real=True: rule disagreements 0; claim's pi bijective True, inside support True; own perfect matching True; |T(C)|=3
n=9 Lemma 7.0 (exact values): independent of C True, independent of halves True
n=9 S_n level: 30 x 30 type pairs, disagreements with the rule (l+l'<=n+1, parity): 0  (0.0s)
n=9 done in 0.0s
n=11 k=31 C=((11,), 1) real=False: rule disagreements 0; claim's pi bijective True, inside support True; own perfect matching True; |T(C)|=8
n=11 k=31 C=((11,), -1) real=False: rule disagreements 0; claim's pi bijective True, inside support True; own perfect matching True; |T(C)|=8
n=11 Lemma 7.0 (exact values): independent of C True, independent of halves True
n=11 S_n level: 56 x 56 type pairs, disagreements with the rule (l+l'<=n+1, parity): 0  (0.0s)
n=11 done in 0.0s
n=13 k=55 C=((13,), 1) real=True: rule disagreements 0; claim's pi bijective True, inside support True; own perfect matching True; |T(C)|=8
n=13 k=55 C=((13,), -1) real=True: rule disagreements 0; claim's pi bijective True, inside support True; own perfect matching True; |T(C)|=8
n=13 Lemma 7.0 (exact values): independent of C True, independent of halves True
n=13 S_n level: 101 x 101 type pairs, disagreements with the rule (l+l'<=n+1, parity): 0  (0.0s)
n=13 done in 0.0s
n=15 k=94 C=((15,), 1) real=False: rule disagreements 0; claim's pi bijective True, inside support True; own perfect matching True; |T(C)|=19
n=15 k=94 C=((15,), -1) real=False: rule disagreements 0; claim's pi bijective True, inside support True; own perfect matching True; |T(C)|=19
n=15 Lemma 7.0 (exact values): independent of C True, independent of halves True
n=15 S_n level: 176 x 176 type pairs, disagreements with the rule (l+l'<=n+1, parity): 0  (0.0s)
n=15 done in 0.0s
n=17 k=156 C=((17,), 1) real=True: rule disagreements 0; claim's pi bijective True, inside support True; own perfect matching True; |T(C)|=19
n=17 k=156 C=((17,), -1) real=True: rule disagreements 0; claim's pi bijective True, inside support True; own perfect matching True; |T(C)|=19
n=17 Lemma 7.0 (exact values): independent of C True, independent of halves True
n=17 S_n level: 297 x 297 type pairs, disagreements with the rule (l+l'<=n+1, parity): 0  (0.0s)
n=17 done in 0.0s
n=19 k=254 C=((19,), 1) real=False: rule disagreements 0; claim's pi bijective True, inside support True; own perfect matching True; |T(C)|=41
n=19 k=254 C=((19,), -1) real=False: rule disagreements 0; claim's pi bijective True, inside support True; own perfect matching True; |T(C)|=41
n=19 Lemma 7.0 (exact values): independent of C True, independent of halves True
n=19 S_n level: 490 x 490 type pairs, disagreements with the rule (l+l'<=n+1, parity): 0  (0.0s)
n=19 done in 0.1s
n=21 k=408 C=((21,), 1) real=True: rule disagreements 0; claim's pi bijective True, inside support True; own perfect matching True; |T(C)|=41
n=21 k=408 C=((21,), -1) real=True: rule disagreements 0; claim's pi bijective True, inside support True; own perfect matching True; |T(C)|=41
n=21 Lemma 7.0 (exact values): independent of C True, independent of halves True
n=21 S_n level: 792 x 792 type pairs, disagreements with the rule (l+l'<=n+1, parity): 0  (0.1s)
n=21 done in 0.2s
n=23 k=641 C=((23,), 1) real=False: rule disagreements 0; claim's pi bijective True, inside support True; own perfect matching True; |T(C)|=83
n=23 k=641 C=((23,), -1) real=False: rule disagreements 0; claim's pi bijective True, inside support True; own perfect matching True; |T(C)|=83
n=23 Lemma 7.0 (exact values): independent of C True, independent of halves True
n=23 S_n level: 1255 x 1255 type pairs, disagreements with the rule (l+l'<=n+1, parity): 0  (0.2s)
n=23 done in 0.4s
n=25 k=997 C=((25,), 1) real=True: rule disagreements 0; claim's pi bijective True, inside support True; own perfect matching True; |T(C)|=83
n=25 k=997 C=((25,), -1) real=True: rule disagreements 0; claim's pi bijective True, inside support True; own perfect matching True; |T(C)|=83
n=25 Lemma 7.0 (exact values): independent of C True, independent of halves True
n=25 S_n level: 1958 x 1958 type pairs, disagreements with the rule (l+l'<=n+1, parity): 0  (0.6s)
n=25 done in 0.9s
n=27 k=1526 C=((27,), 1) real=False: rule disagreements 0; claim's pi bijective True, inside support True; own perfect matching True; |T(C)|=160
n=27 k=1526 C=((27,), -1) real=False: rule disagreements 0; claim's pi bijective True, inside support True; own perfect matching True; |T(C)|=160
n=27 Lemma 7.0 (exact values): independent of C True, independent of halves True
n=27 S_n level: 3010 x 3010 type pairs, disagreements with the rule (l+l'<=n+1, parity): 0  (1.3s)
n=27 done in 2.2s
n=29 k=2308 C=((29,), 1) real=True: rule disagreements 0; claim's pi bijective True, inside support True; own perfect matching True; |T(C)|=160
n=29 k=2308 C=((29,), -1) real=True: rule disagreements 0; claim's pi bijective True, inside support True; own perfect matching True; |T(C)|=160
n=29 Lemma 7.0 (exact values): independent of C True, independent of halves True
n=29 S_n level: 4565 x 4565 type pairs, disagreements with the rule (l+l'<=n+1, parity): 0  (3.2s)
n=29 done in 5.1s
n=31 k=3451 C=((31,), 1) real=False: rule disagreements 0; claim's pi bijective True, inside support True; own perfect matching True; |T(C)|=295
n=31 k=3451 C=((31,), -1) real=False: rule disagreements 0; claim's pi bijective True, inside support True; own perfect matching True; |T(C)|=295
n=31 Lemma 7.0 (exact values): independent of C True, independent of halves True
n=31 S_n level: 6842 x 6842 type pairs, disagreements with the rule (l+l'<=n+1, parity): 0  (7.2s)
n=31 done in 11.2s
