Papers › Reduced Lattices of Synchrony Subspaces and their Indices
Reduced Lattices of Synchrony Subspaces and their Indices
Hiroko Kamei, Haibo Ruan
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
For a regular coupled cell network, synchrony subspaces are the polydiagonal subspaces that are invariant under the network adjacency matrix. The complete lattice of synchrony subspaces of an n-cell regular network can be seen as an intersection of the partition lattice of n elements and a lattice of invariant subspaces of the associated adjacency matrix. We assign integer tuples with synchrony subspaces, and use them for identifying equivalent synchrony subspaces to be merged. Based on this equivalence, the initial lattice of synchrony subspaces can be reduced to a lattice of synchrony subspaces which corresponds to a simple eigenvalue case discussed in our previous work. The result is a reduced lattice of synchrony subspaces, which affords a well-defined non-negative integer index that leads to bifurcation analysis in regular coupled cell networks.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections