Related papers: Invariant synchrony subspaces of sets of matrices
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…
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…
We consider coupled cell networks with asymmetric inputs and study their lattice of synchrony subspaces. For the particular case of 1-input regular coupled cell networks we describe the join-irreducible synchrony subspaces for their lattice…
We define a graph network to be a coupled cell network where there are only one type of cell and one type of symmetric coupling between the cells. For a difference-coupled vector field on a graph network system, all the cells have the same…
Here, the structural symmetries of a hypergraph are represented through equivalence relations on the vertex set of the hypergraph. A matrix associated with the hypergraph may not reflect a specific structural symmetry. In the context of a…
In this article, we consider the problem of approximating a finite set of data (usually huge in applications) by invariant subspaces generated through a small set of smooth functions. The invariance is either by translations under a…
The internal state of a cell in a coupled cell network is often described by an element of a vector space. Synchrony or anti-synchrony occurs when some of the cells are in the same or the opposite state. Subspaces of the state space…
A shift-invariant space is a space of functions that is invariant under integer translations. Such spaces are often used as models for spaces of signals and images in mathematical and engineering applications. This paper characterizes those…
The Grassmannian model represents harmonic maps from Riemann surfaces by families of shift-invariant subspaces of a Hilbert space. We impose a natural symmetry condition on the shift-invariant subspaces that corresponds to considering an…
This paper studies systems of linear difference equations on the lattice $\Z^n$ that are invariant under a finite group of symmetries, and shows that there exist solutions to such systems that are also invariant under this group of…
We consider weighted coupled cell networks, that is networks where the interactions between any two cells have an associated weight that is a real valued number. Weighted networks are ubiquitous in real-world applications. We consider a…
This paper addresses the problem of synchronizing orthogonal matrices over directed graphs. For synchronized transformations (or matrices), composite transformations over loops equal the identity. We formulate the synchronization problem as…
Methods for the computation of invariants and symmetries of nonlinear evolution, wave, and lattice equations are presented. The algorithms are based on dimensional analysis, and can be implemented in any symbolic language, such as…
The method of compatible sequences is introduced in order to produce non-trivial (closed) invariant subspaces of (bounded linear) operators. Also a topological tool is used which is new in the search of invariant subspaces: the extraction…
Following Beurling's theorem and a study of the topology of invariant subspaces by R. Douglas and C. Pearcy description of path connected components of invariant subspace lattice for shift of multiplicity one has been given by R.Yang. This…
We provide an introduction to recent lattice formulations of supersymmetric theories which are invariant under one or more real supersymmetries at nonzero lattice spacing. These include the especially interesting case of ${\cal N}=4$ SYM in…
Synchronization of chaotic units coupled by their time delayed variables are investigated analytically. A new type of cooperative behavior is found: sublattice synchronization. Although the units of one sublattice are not directly coupled…
The structure of the coincidence symmetry group of an arbitrary $n$-dimensional lattice in the $n$-dimensional Euclidean space is considered by describing a set of generators. Particular attention is given to the coincidence isometry…
We consider the coincidence problem for the square lattice that is translated by an arbitrary vector. General results are obtained about the set of coincidence isometries and the coincidence site lattices of a shifted square lattice by…
Synchrony patterns describe network states in which nodes of a coupled dynamical system are grouped into clusters based on synchronization between nodes. Beyond simple synchrony, synchronized clusters may also exhibit active or inactive…