Invariant Polydiagonal Subspaces of Matrices and Constraint Programming
John M. Neuberger, Nándor Sieben, James W. Swift
TL;DR
The paper addresses the challenge of finding all invariant polydiagonal subspaces, which include synchrony and anti-synchrony structures, by introducing a coloring-vector representation of tagged partitions Δ_𝒫. It reduces the problem to a constraint-satisfaction formulation and demonstrates that state-of-the-art solvers can compute these subspaces much faster than prior methods, enabling analysis of large matrices and complex graphs. The authors provide multiple solver implementations, extensive benchmarks, and compelling examples (e.g., Buckminsterfullerene and Petersen graphs), establishing a practical, scalable approach for network dynamics and bifurcation studies. This work significantly broadens the tractable range of invariant subspaces, with direct implications for symmetry-reduced dynamics and BLIS-based bifurcation analysis.
Abstract
In a polydiagonal subspace of the Euclidean space, certain components of the vectors are equal (synchrony) or opposite (anti-synchrony). Polydiagonal subspaces invariant under a matrix have many applications in graph theory and dynamical systems, especially coupled cell networks. We describe invariant polydiagonal subspaces in terms of coloring vectors. This approach gives an easy formulation of a constraint satisfaction problem for finding invariant polydiagonal subspaces. Solving the resulting problem with existing state-of-the-art constraint solvers greatly outperforms the currently known algorithms.
