Invariant Polydiagonal Subspaces of Matrices and Constraint Programming

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Neuberger, John M., Sieben, Nándor, Swift, James W.
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866929628342386688
author Neuberger, John M.
Sieben, Nándor
Swift, James W.
author_facet Neuberger, John M.
Sieben, Nándor
Swift, James W.
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2411_10904
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Invariant Polydiagonal Subspaces of Matrices and Constraint Programming
Neuberger, John M.
Sieben, Nándor
Swift, James W.
Dynamical Systems
Discrete Mathematics
Mathematical Software
90C35, 34C14, 37C80
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.
title Invariant Polydiagonal Subspaces of Matrices and Constraint Programming
topic Dynamical Systems
Discrete Mathematics
Mathematical Software
90C35, 34C14, 37C80
url https://arxiv.org/abs/2411.10904