Periodic dynamics of coupled cell networks I: rigid patterns of synchrony and phase relations

It has recently been proved by Golubitsky and coworkers that in any network of coupled dynamical systems, the possible 'rigid' patterns of synchrony of hyperbolic equilibria are determined by purely combinatorial properties of the network, known as 'balanced equivalence relations'. A pattern is 'rigid' if it persists under small 'admissible' perturbations of the differential equation - ones that respect the network structure. We discuss a natural generalisation of these ideas to time-periodic states, and motivate two basic conjectures, the Rigid Synchrony Conjecture and the Rigid Phase Conjecture. These conjectures state that for rigid hyperbolic time-periodic patterns, cells with synchronous dynamics must have synchronous input cells, and cells with phase-related dynamics must have input cells that have the same phase relations. We provide evidence supporting the two conjectures, by proving them for a special class of periodic orbits, which we call 'tame', under strong assumptions on the network architecture and the symmetries of the periodic state. The discussion takes place in the formal setting of coupled cell networks. We prove that rigid patterns of synchrony are balanced, together with the analogous result for rigid patterns of phase relations. The assumption on the network architecture simplifies the geometry of admissible vector fields, while tameness rules out patterns with non-trivial local or multilocal symmetry. The main idea is to perturb an admissible vector field in a way that retains sufficient control over the associated perturbed periodic orbit. We present two techniques for constructing these perturbations, both using a general theorem on groupoid-symmetrisation of vector fields, which has independent interest. In particular we introduce a method of 'patching' that makes local changes to an admissible vector field. Having established these results for all-to-all coupled networks and tame periodic orbits we prove more general versions that require these assumptions only on a suitable quotient network. These conditions are weaker and encompass a larger class of networks and periodic orbits. We give an example to show that rigidity cannot be relaxed to hyperbolicity. We also prove, without any technical assumptions, that rigidly synchronous or phase-related cells must be input-isomorphic, a necessary precondition for the two conjectures to hold