2 problems
- 0 votes0 replies1 view
Equal tagging conjecture for Laplacian-invariant anti-synchrony subspaces
Equal tagging conjecture. Every -invariant anti-synchrony subspace is evenly tagged, not merely fully tagged.
- 0 votes0 replies0 views
NSS6 equal-state-count conjecture for anti-synchrony subspaces
NSS6 equal-state-count conjecture. The number of cells in the common state must equal the number of cells in the opposite state.