Invariant polydiagonal subspaces of matrices and constraint programming

DOI10.1007/S10601-024-09378-3MaRDI QIDQ7018057zbMATH OpenFDO

Authors John M. Neuberger, Nándor Sieben, James W. Swift

Publication date 5 March 2025

Published in Constraints (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10601-024-09378-3

zbMATH Keywords

anti-synchronyconstraint programmingequitable partitioninvariant polydiagonal subspacesynchrony

Mathematics Subject Classification ID

Applications of graph theory (05C90) Symbolic computation and algebraic computation (68W30) Programming involving graphs or networks (90C35)

Cites work

• A bifurcation lemma for invariant subspaces
• AUTOMATED BIFURCATION ANALYSIS FOR NONLINEAR ELLIPTIC PARTIAL DIFFERENCE EQUATIONS ON GRAPHS
• Computation of balanced equivalence relations and their lattice for a coupled cell network
• Handbook of constraint programming.
• scientific article; zbMATH DE number 3282543 (Why is no real title available?)
• Invariant synchrony and anti-synchrony subspaces of weighted networks
• Invariant synchrony subspaces of sets of matrices
• Newton's method and symmetry for semilinear elliptic PDE on the cube
• Synchronization and equitable partitions in weighted networks
• Synchrony and antisynchrony in weighted networks
• The lattice of synchrony subspaces of a coupled cell network: characterization and computation algorithm

This page was built for publication: Invariant polydiagonal subspaces of matrices and constraint programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7018057)