state 001100 (bits v=0..5) |U|=5 U= [0, 2, 3, 4, 5] {(4, 0): '-1/6'}
state 101100 (bits v=0..5) |U|=5 U= [1, 2, 3, 4, 5] {(4, 0): '1/18'}
state 011100 (bits v=0..5) |U|=6 U= [0, 1, 2, 3, 4, 5] {(4, 0): '-1/6', (6, 0): '-58/225'}
state 111100 (bits v=0..5) |U|=4 U= [2, 3, 4, 5] {(4, 0): '1/18'}
state 100010 (bits v=0..5) |U|=5 U= [0, 1, 2, 3, 4] {(4, 0): '1/9'}
state 110010 (bits v=0..5) |U|=4 U= [0, 2, 3, 4] {(4, 0): '1/9'}
state 001110 (bits v=0..5) |U|=4 U= [0, 2, 3, 5] {(4, 0): '-1/9'}
state 011110 (bits v=0..5) |U|=5 U= [0, 1, 2, 3, 5] {(4, 0): '-1/9'}
state 100001 (bits v=0..5) |U|=5 U= [0, 1, 2, 3, 5] {(4, 0): '1/9'}
state 110001 (bits v=0..5) |U|=4 U= [0, 2, 3, 5] {(4, 0): '1/9'}
state 001101 (bits v=0..5) |U|=4 U= [0, 2, 3, 4] {(4, 0): '-1/9'}
state 011101 (bits v=0..5) |U|=5 U= [0, 1, 2, 3, 4] {(4, 0): '-1/9'}
state 000011 (bits v=0..5) |U|=4 U= [2, 3, 4, 5] {(4, 0): '-1/18'}
state 100011 (bits v=0..5) |U|=6 U= [0, 1, 2, 3, 4, 5] {(4, 0): '1/6', (6, 0): '58/225'}
state 010011 (bits v=0..5) |U|=5 U= [1, 2, 3, 4, 5] {(4, 0): '-1/18'}
state 110011 (bits v=0..5) |U|=5 U= [0, 2, 3, 4, 5] {(4, 0): '1/6'}
max |g_s(t) - expm| over 64 states and 6 times: 6.66e-16
popcount sums of the coefficient of t^0 e^{-4t}: ['0', '0', '0', '0', '0', '0', '0']
popcount sums of the coefficient of t^0 e^{-6t}: ['0', '0', '0', '0', '0', '0', '0']
A per-state union (E basis): [(0, 1), (1, 1), (1, 2), (1, 3), (3, 1), (4, 1), (5, 1), (5, 2)]
A pairs whose popcount sums vanish for every j: [(3, 1)]
B per-state union (E basis): [(0, 1), (1, 1), (1, 2), (3, 1), (4, 1), (5, 1), (5, 2), (6, 1)]
B pairs whose popcount sums vanish for every j: [(4, 1), (6, 1)]
C10 per-state union (E basis): [(0, 1), (1, 1), (1, 2), (2, 1), (2, 2), (3, 1), (4, 1), (4, 2), (4, 3), (5, 1), (5, 2), (6, 1), (6, 2), (7, 1), (8, 1), (8, 2), (8, 3), (9, 1), (9, 2), (10, 1)]
C10 pairs whose popcount sums vanish for every j: [(8, 3)]
