TOWARDS A CLASSIFICATION OF STEADY-STATE BIFURCATIONS FOR NETWORKS WITH ASYMMETRIC INPUTS

. We consider homogeneous coupled cell networks with asymmetric inputs. We obtain general results concerning codimension-one steady-state bifurcations for networks with any number of cells and any number of asymmetric inputs. These results rely solely on the network adjacency matrices eigenvalue structure and the existence, or not, of network synchrony subspaces. For networks with three-cells, we describe the possible lattices of synchrony subspaces annotated with the eigenvalues on each synchrony subspace. Applying the previous results, we classify the synchrony-breaking steady-state bifurcations that can occur for three-cell minimal networks with one, two or six asymmetric inputs.


Introduction
In this paper we consider coupled cell systems, that is, continuous dynamical systems whose structure can be schematized through a network.We follow the formalisms of Stewart, Golubitsky and co-workers [33,15] and Field [12], where a coupled cell network is a directed graph with nodes and edges representing, respectively, the cells (sets of dynamical systems, here, systems of ordinary differential equations) and the couplings between the cells.One of the key properties of coupled cell systems is the existence of synchrony spaces -spaces defined in terms of equalities of cell coordinates and that are left invariant under any coupled cell system consistent with a given network.Remarkably, the existence of such spaces depends solely on the network structure and not on the given admissible vector field.
We concentrate our work on networks with k asymmetric inputs -there are k ∈ N different input types and each cell receives exactly one input of each type.The corresponding coupled cell systems have all the cells with the same internal phase space (identical cells) and the cells are all input equivalent as every cell receives exactly k couplings of the k different types.These networks are formally defined by k adjacency matrices, one for each type of coupling.Any coupled cell system associated to a network with asymmetric inputs admits the full-synchrony subspace where all cells are synchronized.It is also known that the set of synchrony spaces of a given network is a lattice where the bottom is the full-synchrony subspace and the top is the network phase space, see Stewart [31].Moreover, coupled cell systems restricted to any network synchrony subspace correspond to coupled cell systems consistent with a smaller network determined by the original network and the synchrony space, [33,15].
Consider a network with k asymmetric inputs.Take a one-parameter family of coupled cell systems associated with that network and possessing an equilibrium in the full-synchrony subspace.One important observation we make is that the Jacobian matrix at that equilibrium is a linear combination of the adjacency matrices of the network, and its eigenvalues are functions of the first order derivatives of the associated coupled cell systems.Assume that one of these eigenvalues crosses 0 as the parameter changes.In any neighborhood of the full synchrony equilibrium, new equilibria may appear forming a steady-state bifurcation branch.Such bifurcation branch can have less synchrony and, in this case, we say that a synchrony-breaking steady-state bifurcation has occurred.The synchrony of a bifurcation branch is the smallest synchrony subspace that contains it.In this work, we describe the synchrony subspaces that might robustly support a steady-state bifurcation branch for networks with three cells and two asymmetric inputs.Together with the characterization given in Leite and Golubitsky [21] for the 34 networks with three cells and two symmetric inputs, it gives a complete characterization of the patterns of synchrony-breaking steady-state bifurcations for networks with three cells and two inputs.
To obtain a complete synchrony-breaking steady-state bifurcation characterization, even for networks with three cells and two inputs, it is not feasible to study every possible network as the number of possible networks is large.Moreover, there are networks that have different topologies but the same type of generic dynamics.When two different networks support the same space of coupled cell systems, they are said to be ODE-equivalent.In previous work, Aguiar, Dias and Soares [7] describe the ODE-classes of networks with three cells and two asymmetric inputs.This reduces the number of networks to be considered to 48.
As coupled cell systems restricted to any network synchrony subspace correspond to coupled cell systems consistent with a smaller network, the lattice of the network synchrony spaces can have its elements (synchrony subspaces) annotated by the eigenvalues of the smaller networks determined by those synchrony subspaces.For networks with three cells, there are seven possible annotated lattices of synchrony spaces.We show that the seven cases can be studied using three bifurcation results about the synchrony spaces that support a bifurcating branch.In this work, we first prove these bifurcation results for networks independently of the number of cells.The non-degeneracy conditions described in the bifurcation results generically depend solely on the network.Finally, we apply the results to the 48 ODE-classes of networks with three cells and two asymmetric inputs, according to its annotated lattice and checking the non-degeneracy conditions.This provides a complete characterization of the synchrony spaces that support a (codimension-one) steady-state bifurcating branch for networks with three cells and two asymmetric inputs.
Further motivation.The analysis of small networks, Milo et al. [23], that are part of complex networks modelling real-world problems can help understand the dynamical properties of those big networks.One important perspective in science is precisely to find the small building blocks, usually called motifs, that are often occurring in biological networks, study their dynamics and then understand how cellular function emerges from the interactions between the motifs.See Morone, Leifer and Makse [24] and Leifer et al. [20].Some examples of applied studies about small networks are given next.
Jia et al. [18] consider two common two node motifs that are often found in many cell-fate decisions during embryonic development.One motif, the toggle switch (TS), it is comprised of two transcription factors that mutually inhibit each other; a TS where each transcription factor self-activate is a self-activating toggle switch.Their work is focus into answering two questions.What are the types of co-existing stable equilibria (phenotypes) and how the coupling between two such TS influences the state-space of each other.Mangan and Alon [22] consider feed-forward loops (FFLs) structures with three genes (nodes) corresponding to biochemical wiring patterns (network motifs) which recur throughout in transcription networks.There are eight possible FFLs to be considered, as each of the three interactions in the FFL can be activating or repressing.The authors showed that four of them act as sign-sensitive accelerators, while the other four types act as sign-sensitive delays.They also remarked that some of these FFLs appear more often probably due to the reduced functionality of the rare ones.In [19] a theoretical study is made considering the coupling between miR-200/ZEB (the decision-making feedback loop for Epithelial-Mesenchymal Transition) and LIN28/let-7 (the decision-making feedback loop for tumour-initiation potential) showing the ability to disseminated primary tumour cells to form metastases at other organs.In [17], Hernandez et al. break the complex network into smaller independent subnetworks to describe the steadystates of complex networks arising from biochemical systems, which often describe their long-term behaviours.The steady-state solutions of each subnetworks are then stitch together to lead to the analytic steady-states of the original network.Prill et al. [27] carry out computational analysis about the robust stability in biological networks to small-scale perturbations in biological entities, motifs with three or four nodes.By analysing the responses to small perturbations from a steady-state, under different assumptions on the parameters, their results suggest that robust stability of networks motifs is an important determinant of biological network structure.
The dynamics associated with networks of just two or three-cells can already be complex.See, for example, Pasemann [26] for the discrete-time case and Aguiar et al. [4] for the continuous-time case.
In this work, we study which synchrony-breaking patterns emerge as a bifurcation occurs in three-cell networks.Examples of previous works about this topic are Beer [9], Leite and Golubistky [21] and Golubitsky and Wang [16].
Details on the main results of the paper.In Section 3, we give general results about the synchrony-breaking steady-state bifurcations for networks with asymmetric inputs.More specifically, we show which synchrony spaces support a bifurcating branch of equilibria arising from a codimension-one steady-state bifurcation at a full synchronous equilibrium, for generic coupled cell systems.The results are organized according to the number of synchrony subspaces intersecting, in a non trivial way, the generalized kernel K of the Jacobian matrix at a full synchronous equilibrium.
The first result corresponds to the case where K has dimension one and where it is taken the smallest synchrony subspace containing K. It is usually called the synchrony bifurcation branch, and has been proved for different types of networks, such as networks with symmetric inputs, see Soares [29] and Golubitsky and Lauterbach [13].Using the Lyapunov-Schmidt Reduction Method, see for example Golubitsky and Schaeffer [14], we show in Theorem 3.1 that each such synchrony subspace supports a steady-state bifurcation branch.
In the second result, we consider the case where K has dimension m and the smallest synchrony subspace ∆ which contains K also includes 2 m − 1 synchrony subspaces intersecting K in a one-dimensional space.By Theorem 3.1 mentioned above, we know that those 2 m − 1 synchrony subspaces intersecting K support a bifurcation branch.Using Bézout's Theorem, see for example Blum et al. [10], we prove in Theorem 3.3 that the synchrony subspace ∆, containing K, does not support a bifurcation branch.
The third result considers the case of K being two-dimensional and the kernel of the Jacobian matrix at a full synchronous equilibrium being one-dimensional.We prove in Theorem 3.10 that the smallest synchrony subspace containing K supports a bifurcation branch.
In Section 4, we study the codimension-one steady-state bifurcations from a full synchronous equilibrium for continuous-time dynamical systems associated with threecell networks with any number k of asymmetric inputs.The networks are grouped according to their annotated lattice of synchrony subspaces.We show in Theorem 4.5 that there are seven possible synchrony lattice structures for connected three-cell networks with any number of asymmetric inputs, see Figure 3.Under the assumption of some network non-degeneracy conditions, the results obtained in Section 3 show which synchrony spaces support a steady-state bifurcating branch.Noticeably, we derive that there are eight possible bifurcation diagrams, see Figure 4, where one lattice leads to two distinct bifurcation diagrams and the other six lead to a distinct bifurcation diagram each.
Finally, in Section 5, we apply the methodology developed here, and described above, to the minimal networks with three-cells and one, two and six asymmetric inputs enumerated in [7] which cover every possible dynamics with those numbers of cells and asymmetric inputs.First, the network eigenvalues are obtained in Theorem 5.2 and the annotated lattices of each network in Theorem 5.4.An observation is that only six of the seven possible lattices obtained in Theorem 4.5 occur for the 48 networks under study.Using the results of Section 3, and checking the network non-degeneracy conditions, we prove in Theorem 5.6 which synchrony subspaces support a steady-state bifurcation branch from a full synchronous equilibrium, obtaining then the corresponding bifurcation diagrams, see Table 9.It should be noted that, this characterization is still valid for synchrony subspaces with dimension at most three of a network with one, two or six asymmetric inputs for any number of cells.
Organization of the paper.The paper is organized in the following way.In Section 2 we recall the main definitions and results concerning coupled cell networks, coupled cell systems, synchrony spaces and codimension-one steady-state bifurcations of coupled cell networks.In Section 3 we present general results concerning the codimension-one steady-state bifurcations for coupled cell networks with asymmetric inputs.The main results are Theorems 3.1, 3.3 and 3.10 proving which synchrony subspaces robustly support a steady-state bifurcation branch.In Section 4, we consider networks with three-cells and any number of asymmetric inputs, obtaining the network eigenvalues, the lattices of synchrony subspaces and applying the bifurcation results of Section 3. Finally, in Section 5, we apply the previous methodology to the minimal networks with three-cells and one, two and six asymmetric inputs.The main result is Theorem 5.6 listing the synchrony subspaces supporting a steady-state bifurcation branch.

Steady-state bifurcations for coupled cell networks
We follow the formalisms of Stewart, Golubitsky and Pivato [33], Golubitsky, Stewart and Török [15] and Field [12] on coupled cell networks and the associated coupled cell systems.
2.1.Coupled cell networks.In this paper, we consider n-cell coupled cell networks with k asymmetric inputs which can be represented by directed graphs, where the cells are placed at vertices (nodes) and the couplings are depicted by directed arrows.
Any cell receives k inputs, one from each type.The description of any such network can be given by k adjacency matrices, of order n, if n is the network number of cells and the rows and columns are indexed by the network cells.If A 1 , . . ., A k are the adjacency matrices, the entry ij of the matrix A l is 1 if there is a directed edge from cell j to cell i of type l, or 0 otherwise, where l = 1, . . ., k and i, j = 1, 2, . . ., n.Thus, each row of A l has exactly one entry equal to 1 and 0 elsewhere.
We recall that a network is connected if there is an undirected path between any two cells.All networks considered here are connected.
Example 2.1.In Figure 1 we have two three-cell and one two-cell coupled networks with asymmetric inputs.As an example, the network in the middle has two asymmetric inputs which can be described by the following two adjacency matrices Figure 1.Examples of coupled cell networks with asymmetric inputs.

Coupled cell systems.
Let N be an n-cell network with k asymmetric inputs, say of types 1, . . ., k.We take a cell to be a system of ordinary differential equations and we consider the class of coupled cell systems consistent with the structure of the network N .As every cell of the network receives k inputs, one from each type, we say that the network is homogeneous.It follows that we consider that all the cells are identical, that is, they have the same phase space V assumed here to be V = R.Moreover, the dynamics of each cell i is governed by the same smooth function f : V k+1 → V , evaluated at cell i and at the k cells belonging to its input set.Thus, for i = 1, . . ., n, the evolution of cell i is given by the set of ordinary differential equations where i j is the start cell of the edge with type j and heading to cell i.The coupled cell systems with cells governed by equations of the form (2.1) are N -admissible and f N denotes the coupled cell system defined by f .
Example 2.2.Consider the network in the middle of Figure 1 and any smooth function f : R 3 → R. Coupled cell systems associated with this network are of the form (2.2) .

✸
Given two networks, the set of coupled cell systems associated to them can coincide, up to renumbering of the cells.In this case, we say that those networks are ODE-equivalent.This defines an equivalence relation between networks whose equivalence classes are called ODE-classes.Inside each ODE-class, the networks having a minimal number of inputs are called minimal networks.See Dias and Stewart [11] and Aguiar and Dias [5] for details.
2.3.Synchrony subspaces.One of the most remarkable and first observed property of coupled cell systems, which only depends on the network structure and not on the particular coupled cell system, is the existence of flow-invariant subspaces.Those subspaces are called synchrony subspaces and are defined by some equalities of cell's coordinates, x i = x j .More precisely, one such polydiagonal subspace ∆ is said to be a network synchrony subspace if it is invariant for any admissible vector field of that network.By [33,Theorem 6.5], a polydiagonal space is a network synchrony subspace if and only if it is left invariant by every network's adjacency matrix, Example 2.3.Consider the network G in the middle of Figure 1 and the associated coupled cell systems in (2.2).The polydiagonal space ∆ = {(x 1 , x 2 , x 3 ) : x 2 = x 3 } is flow-invariant for any such coupled cell system.In fact, looking at the form of the coupled systems in (2.2), we see that, given an initial condition where the values for x 2 and x 3 coincide, then the equations for the two variables are the same and thus they stay synchronized for forward time.Moreover, this property does not depend on the particular choice of the function f nor the choice of the cell phase spaces.The space ∆ is a synchrony space for the network G.Note that ∆ is left invariant under the network adjacency matrices, A 1 and A 2 in Example 2.1.✸ The restriction of a coupled cell system associated with a network N to a synchrony subspace ∆ corresponds to a coupled cell system consistent with a smaller network Q, the quotient network of N determined by ∆, see [15,Theorem 5.2].We can define an equivalence relation ⊲⊳ on the network set of cells in the following way: if x i = x j is one of the equalities defining ∆ then i ⊲⊳ j.We write ∆ = ∆ ⊲⊳ .The cells of Q are so the ⊲⊳-equivalence classes and, for each edge-type l, an edge [j] → l [i] corresponds to the edges j → l i in N where j ∈ [j] and i ∈ [i].Thus, edge types are preserved and both networks have the same number of asymmetric inputs.That is, if N has k asymmetric inputs, the quotient network Q has also k asymmetric inputs.
✸ Stewart [31] showed that the set of synchrony subspaces of a network together with the partial order of inclusion is a finite lattice.Thus the join and meet of any two synchrony subspaces ∆ 1 and ∆ 2 are well-defined in the set of synchrony subspaces.The join of ∆ 1 and ∆ 2 is the smallest synchrony subspace containing ∆ 1 and ∆ 2 .Analogously, the meet of ∆ 1 and ∆ 2 is the largest synchrony subspace contained in ∆ 1 and ∆ 2 (the intersection of the two synchrony subspaces).
For the networks with asymmetric inputs considered here, the bottom of the lattice, the smallest synchrony subspace or the meet of all synchrony subspaces, is the fullsynchronized subspace ∆ 0 .The top of the lattice, the biggest synchrony subspace, or the join of all synchrony subspaces, is the network phase space R n , if n is the number of cells in the network.
Example 2.5.The lattice of the synchrony spaces of the network G in the middle of Figure 1 is formed by the full-synchronized subspace ∆ 0 = {(x 1 , x 2 , x 3 ) : and the network phase space R 3 .✸ 2.4.Steady-state bifurcations for networks.Let N be a network with k asymmetric inputs.We address in this paper the possible codimension-one local steadystate bifurcations of coupled cell systems from a full synchrony equilibrium solution x 0 and their spontaneous synchrony breaking.Let f : R × R k × R → R be a family of smooth functions defining a family of coupled cell systems f N on N parametrized by a real parameter λ: We assume, without loss of generality, that the solution x 0 and the bifurcation point λ 0 are the origin.In the following, we will assume that the origin is an equilibrium point for every λ, f (0, λ) ≡ 0 .We consider that the family of coupled cell systems f N has a local steady-state bifurcation at (x 0 , λ 0 ) = (0, 0) if the number of steady-state solutions of (2.3) in any neighbourhood of x 0 changes when the parameter λ crosses λ 0 = 0. Recall that a necessary condition for the existence of local steady-state bifurcations at (0, 0) is that the Jacobian matrix of f N (x, 0) at the origin has a zero eigenvalue.Throughout, we denote by J N f the Jacobian matrix of f N (x, 0) at the origin.
Using the k network adjacency matrices, say A 1 , . . ., A k , we have that J N f has the following form: (2.4) where f j , for j = 0, . . ., k, denotes the derivative of f at the origin with respect to the variable j + 1.Since the Jacobian matrix depends linearly on the first derivatives of f , there are continuous functions µ 1 , . . ., µ s : R k+1 → C such that µ 1 (f 0 , f 1 , . . ., f k ), . . ., µ s (f 0 , f 1 , . . ., f k ) are the distinct eigenvalues of J N f .We call these functions the network eigenvalues.Moreover, as every matrix A j has row sum one, we have that one of the network eigenvalues is the network valency eigenvalue.
A steady-state bifurcation condition (at λ = 0) for the family f N is given by the equality of one of those network eigenvalues of J N f to zero, µ i (f 0 , . . ., f k ) = 0.
Example 2.6.Let N be the network with three-cells and one asymmetric input forming a 3-cycle.Then the network eigenvalues of N are Note that µ 2 = 0 implies that f 0 = f 1 = 0 and thus µ 1 = µ 3 = 0. ✸ Since we are interested in steady-state bifurcations, we consider network eigenvalues which are real on some open set of R k+1 , i.e., the interior of µ −1 i (R) is nonempty.Next, we define the space of functions with a bifurcation condition given by a network eigenvalue.Definition 2.7.Let N be a network with k asymmetric inputs and µ a network eigenvalue.The space of one-parameter families of coupled cell systems with a bifurcation condition given by µ is denoted by V µ (N ), where Remark 2.8.Given a network N with a synchrony space ∆ and Q the quotient network of N determined by ∆, as the restriction of a coupled cell system associated with N to ∆ corresponds to a coupled cell system consistent with Q, we have that any eigenvalue of Q is also an eigenvalue of N .Moreover, the spaces of functions with a bifurcation condition given by an eigenvalue µ of Q is equal for the networks N and Q: 9. An eigenvalue of a network N which is also an eigenvalue of the quotient network Q of N determined by a synchrony space ∆ is called an eigenvalue of ∆. ✸ Following usual conventions in bifurcation theory, we consider generic functions satisfying a bifurcation condition.A function is generic if it satisfies a finite number of non-degenerated conditions.A non-degenerated condition is a non-trivial inequality on the derivatives of the function f at the origin which does not contradict the bifurcation condition.Trivially, from (2.4), we see that a bifurcation condition µ(f 0 , . . ., f k ) = 0 determines the value of f 0 based on the other first derivatives of f .Thus, we consider non-degenerated conditions given by inequalities in the derivatives of the function f not including the derivative f 0 .Definition 2.10.Given a bifurcation problem determined by ✸ Definition 2.11.A synchrony subspace ∆ supports a steady-state synchrony-breaking bifurcation if there is a generic bifurcation problem V µ (N ) where some bifurcation branch has synchrony ∆, for a generic family of functions f ∈ V µ (N ).✸ We use the following terminology: Definition 2.12.Let N be a network with k asymmetric inputs and µ : R k+1 → C an eigenvalue of N .We say that µ is: f with geometric multiplicity m and algebraic multiplicity n, for f generic.✸ The next definition relates eigenspaces and synchrony subspaces.
Definition 2.13.Let N be a network with k asymmetric inputs, ∆ a synchrony subspace of N and µ : R k+1 → C a network eigenvalue of ∆.We say that ∆ is: (i) µ-maximal when µ is not an eigenvalue of ∆ for any synchrony subspace ∆ ∆.
(ii) µ-submaximal of order j ≥ 1, if there are j simple and maximal synchrony subspaces ∆ 1 , . . ., ∆ j ∆ and, for any generic f ∈ V µ (N ) and ∆ ∆, In the first case of the above definition, the synchrony subspace is one of the lowest in the lattice of synchrony subspaces to have that network eigenvalue.In the second case, the synchrony subspace is not one of the lowest in the lattice, but the eigenspace increases as we move up in the lattice at such synchrony subspace.
Example 2.14.Consider the networks N 1 , N 2 , N 3 in the left, middle and right, respectively, in Figure 1 and take the adjacency matrices Note that A 1 is the adjacency matrix of N 1 and A 1 , A 2 (A 3 , A 4 ) are the adjacency matrices of the network with two asymmetric inputs N 2 (N 3 , respectively).The eigenvalues of The synchrony space {x : is not an eigenvalue in the full-synchrony subspace.✸

Steady-state bifurcations for networks with asymmetric inputs: general results
Let N be a network with k asymmetric inputs and consider an one-parameter family of coupled cell systems for N as in (2.3).Let µ be an eigenvalue of N and f ∈ V µ (N ).We address three general cases concerning the relation between the network synchrony spaces and the eigenspace associated with the eingenvalue µ, namely, when the synchrony subspace is (i) µ-simple and maximal, (ii) µ-semisimple with multiplicity m and it is submaximal of order 2 m − 1, and (iii) µ-defective with multiplicity (2,1) and submaximal of order 1.We point out that these three cases cover the study of minimal networks with three-cells and two asymmetric inputs presented in the next two sections.
3.1.Simple eigenvalue and maximal synchrony space.We start by addressing the simplest case where µ is simple and the synchrony space ∆ is maximal, which is a common case, specially when the synchrony subspace ∆ has a low dimension.Similar cases have been studied in [32,29] for regular networks and our approach is similar.The idea is to apply Lyapunov-Schmidt Reduction [14], reducing the steady-state bifurcation problem to a one-dimensional steady-state bifurcation problem, since the eigenvalue µ is simple.Moreover, the reduced problem is finitely determined and we can find at least one bifurcation branch.Since the synchrony subspace ∆ is maximal, the bifurcation branch must have that synchrony.Next, we state this result and sketch its proof for completeness.We note that the details can be filled using well-known techniques of bifurcation theory which can be found in many references including the references mention above.
Theorem 3.1.Let N be a network with k asymmetric inputs and µ a network eigenvalue.Assume that f ∈ V µ (N ) is generic, µ is simple and that ∆ is a µmaximal synchrony subspace of N .Then, besides the trivial branch, there exists a bifurcation branch of f N with the synchrony ∆.
Proof.Note that µ is assumed to be a simple eigenvalue of the quotient network of N determined by ∆.Thus, we look for steady-state bifurcation branches with synchrony ∆ which corresponds to solve the following equation in a neighbourhood of (0, 0): Assume ∆ is (isomorphic to) R n .In order to study the equation f N (x, λ) = 0 in a neighbourhood of (0, 0), we use Lyapunov-Schmidt Reduction, [14, Chapter I, Section 3; There exists a function g : R × R → R such that the solutions of g = 0 are in one-to-one correspondence with the solutions of f = 0.Moreover, the derivatives of g at the origin can be computed using the derivatives of f at the origin.In particular, Next, we see that there exists r > 1 such that the r-derivative of g with respect to x, g x r , is different from zero.Using the formulas for the derivative of g, presented in [14], and the form of the admissible vector fields we know that where f 0 r is the r derivative of f with respect to the first variable, v [r] = (v r 1 , . . ., v r n ) and h r (f ) is a polynomial function where its variables are the derivatives of f with order less or equal to r excluding f 0 r .By [32, Theorem 6.1.],we know that there exists r such that u, v [r] = 0. Since f is generic, we can assume that Let r be the minimum integer such that g x r = 0 for f generic.
Thus the function g has the following Taylor expansion around the origin: where • • • includes the terms which are higher order in x and may depend at the bifurcation parameter λ.Factoring out the variable x, we can apply the Implicit Function Theorem and conclude that there exists a nontrivial solution β :] − ǫ, ǫ[→ R such that g(x, β(x)) = 0.This proves the existence of a bifurcation branch.It follows from the maximality of the synchrony subspace that the bifurcation branch cannot be contained in any smaller synchrony subspace.
In the previous proof, we defined r as the minimum integer such that g x r = 0.In this case, we say that the bifurcation problem is r-determined.

3.2.
Semisimple eigenvalue and submaximal synchrony spaces.We consider now two cases of synchrony-breaking steady-state bifurcations where the network eigenvalue µ is semisimple, f ∈ V µ (N ) and ∆ is a µ-submaximal synchrony subspace.In the first, we suppose that the eigenvalue has multiplicity m and the submaximal synchrony subspace has order 2 m − 1.In the second case, the network eigenvalue is the network valency.The second case have been studied in Aguiar, Dias and Soares [6] and we recall known results in the end of this section.We note that the results we obtain can be applied independently of the network number of cells.
Suppose µ has multiplicity m and ∆ has order 2 m − 1.Let ∆ 1 , . . ., ∆ 2 m −1 be the µ-maximal synchrony subspaces.It follows from Theorem 3.1 that each µ-maximal synchrony subspaces generically supports a bifurcation branch when f ∈ V µ (N ).We prove in Theorem 3.3 below that, under certain conditions strictly depending on the network, there are no more bifurcation branches.Using the terminology of Definition 2.11, we have then that ∆ does not generically support a bifurcation branch when f ∈ V µ (N ).
In the proof of Theorem 3.3 below, we use the Lyapunov-Schmidt Reduction method to obtain a function g : R m × R → R m such that the solutions of g = 0 (near the origin) are in one-to-one correspondence with the solutions of f N = 0 (near the origin).Since f (0, λ) ≡ 0 and each ∆ 1 , . . ., ∆ 2 m −1 supports a bifurcation branch, we know that the reduced problem g = 0 has at least 2 m zeros.Supposing that the study of g = 0 is equivalent to its quadratic approximation, we apply then Bézout's Theorem [10, Section 10.5] to conclude that there are exactly those 2 m zeros.Thus every bifurcation branch belongs to the µ-maximal synchrony subspaces and ∆ does not generically support a bifurcation branch.The result holds under the following assumptions: Assumptions 3.2.Let h be the second-order Taylor expansion at zero of the reduced function g.Assume that: 1. D (y,λ) h(ỹ, 1) has rank m, for each solution of h(ỹλ, λ) = 0 with ỹ = 0. 2. The homogeneous quadratic polynomial components h i , for i = 1, . . ., m, of h do not share a common factor.
Depending on the network, these assumptions lead to non-degeneracy conditions of the bifurcation problem.It follows from the first assumption that we can focus on the quadratic approximation of g = 0. Bézout's Theorem can be applied when the second assumption holds.First we state and prove the result, then we return to the previous assumptions and see how they depend on the network structure.
Theorem 3.3.Let N be a network with k asymmetric inputs, µ a network eigenvalue, f ∈ V µ (N ) generic and ∆ a synchrony subspace of N which is µ-semisimple with multiplicity m and µ-submaximal with order 2 m −1.Suppose that the bifurcation problem on each µ-maximal synchrony subspace of N contained in ∆ is 2-determined and that Assumptions 3.2 hold.Then there is no bifurcation branch of f N with synchrony ∆.
Proof.Looking for steady-state bifurcation branches with synchrony ∆ corresponds to solve the following equation in a neighbourhood of (0, 0), As before, assume ∆ is (isomorphic to) R n .
Let µ be a semisimple network eigenvalue with geometric multiplicity m and f ∈ V µ (N ) generic.Suppose that R n is µ-submaximal with order 2 m − 1 and that Assumptions 3.2 hold.Let ∆ 1 , . . ., ∆ 2 m −1 be the µ-maximal synchrony subspaces such that the bifurcation problem is 2-determined on ∆ i for i = 1, . . ., 2 m − 1. Take By the Lyapunov-Schmidt Reduction Method, there exists a function g : R m ×R → R m such that the solutions of g = 0 (near the origin) are in one-to-one correspondence with the solutions of f N = 0 (near the origin).Moreover, we have the following derivatives of g at the origin where i, j = 1, . . ., m and j = i.Since f is generic we assume that µ(f 0λ , . . ., f kλ ) = 0. Expanding g in its Taylor series around the origin, we have that where Q = (q 1 , . . ., q n ) has quadratic homogeneous polynomials components in x.Denote by h the second-order Taylor expansion truncation of g, which satisfies Since ∆ 1 , . . ., ∆ 2 m −1 are µ-maximal synchrony subspaces, it follows from Theorem 3.1 that ∆ i supports a bifurcation branch for each i = 1, . . ., 2 m − 1. Adapting [29, Proposition 3.5], we know for each i = 1, . . ., 2 m − 1 that the bifurcation branch on ∆ i leads to a non-trivial solution ỹi = (ỹ i 1 , . . ., ỹi m ) of h(x 1 , . . ., x m , 1) = 0, since the bifurcation problem is 2-determined on ∆ i .Moreover, we have that ỹi and the solutions ỹ1 , . . ., ỹ2 m −1 are distinct.Using Assumption 3.2.1 and adapting [29, Proposition 3.6], we see that each of these solutions corresponds to an unique solution of g = 0 and a unique bifurcation branch of f N .From Bézout's Theorem [10, Section 10.5] and Assumption 3.2.2, the system has at most 2 m solutions as the polynomials h 1 , . . ., h m are homogeneous of degree 2. Counting the solutions ỹ1 , . . ., ỹ2 m −1 together with the trivial solution ỹ = 0, there are 2 m solutions of h(x 1 , . . ., x m , 1) = 0.So there is no more solutions of h(x 1 , . . ., x m , 1) = 0 and there are exactly the 2 m − 1 bifurcation branches.Thus the µ-submaximal synchrony subspace does not support a bifurcation branch.
Remark 3.4.Note that the valency eigenvalue of a network with n cells has multiplicity n if and only if every cell of the network is isolated from the others.Thus any network eigenvalue of a connected network with n cells has multiplicity less or equal than n − 1.Moreover, R n has 2 n−1 − 1 polydiagonal subspaces with dimension 2 since each polydiagonal subspace with dimension 2 defines a partition of the set {1, . . ., n} into two complementary subsets.Thus there are at most 2 n−1 − 1 synchrony subspaces with dimension 2. ✸ Remark 3.5.In Theorem 3.3, we assume that the bifurcation condition is given by a semisimple network eigenvalue µ with multiplicity m and the submaximal subspace has order 2 m −1.From the previous remark, we see that this condition is not expected to occur frequently for coupled cell systems.Nevertheless, we show in the three-cell networks steady-state bifurcations classification done in the following two sections that there is one network for which the bifurcation condition assumed in Theorem 3.3 holds.Namely, network C 1 &D 1 in Table 6 has the eigenvalue f 0 with multiplicity 2, the network phase space R 3 is f 0 -submaximal with order 3 (see Figure 3b) and Theorem 3.3 holds.✸ We see now that Assumptions 3.2 depend solely on the network structure.More precisely, the dependence is on the second derivatives of the function g at the origin, which in their turn are computed using only the second derivatives of the function f at the origin, and the vectors v 1 , . . ., v m , v * 1 , . . ., v * m .In order to calculate the second derivatives of g and h at the origin, we use the formulas provided in [14, Chapter I, Section 3; Chapter VII].
The function f N has the following second-order Taylor expansion around the origin and the second order directional derivative of f N in the directions v a and v b is where a, b = 1, . . ., m and f j 1 j 2 is the second derivative of f with respect to x j 1 and x j 2 at the origin for j 1 , j 2 = 0, . . ., k.Here, * denotes the componentwise product.The vectors v 1 , . . ., v m usually depend on the first order derivatives of f and the expressions above cannot be further simplified.Note that the bifurcation condition may be seen as a restriction on the value of f 0 .The functions g and h have the same second order derivatives at the origin where i, a, b = 1, . . ., m.
The first assumption in Assumptions 3.2 may be expressed as a set of inequalities using the previous derivatives, excluding f 0 .Thus, if those inequalities are nontrivial, they lead to non-degeneracy conditions on the function f .The fact that those inequalities are trivial or not depends only on the network structure.Hence, if the first assumption in Assumptions 3.2 holds for some function, then they must hold for any generic function f .
For the second assumption in Assumptions 3.2, we have the following lemma about the common factors of the components h 1 , . . ., h m of the function h given in (3.6).Lemma 3.6.Let h 1 , . . ., h m : R m+1 → R be polynomial functions with the following form h i (x 1 , . . ., x m , λ) = µx i λ + q i (x 1 , . . ., x m ), where i = 1, . . ., m and q i are homogeneous quadratic polynomials.If i = j and h i and h j have a common factor, then where (h a ) bc denotes the second order derivative of h a with respect to the variables x b and x c at the origin and a, b, c = 1, . . ., m.
Proof.Let h 1 , . . ., h m be the functions with the given form.Suppose that h i and h j have a common factor.Since there is only one term of h i which includes the variable λ and it is equal to µx i λ, we know that the common factor of h i and h j must be linear.That is, h i and h j have the following form: for constants c 1 , . . ., c m ∈ R. Thus We have then the equalities (3.7).
It follows from Lemma 3.6 and the expression for the second derivatives of h given above that the second assumption in Assumptions 3.2 leads to a set of inequalities that may be expressed using the derivative of f , excluding f 0 .If those inequalities are nontrivial, then they form a set of non-degeneracy conditions on the function f .Thus if both Assumptions 3.2 are satisfied by one function f for a given network N , then every generic coupled cell system of N satisfies Assumptions 3.2.
We finish this section with the bifurcation problem when the bifurcation condition is given by the valency, υ.We point out that this case has been studied in [6].
We recall the definition of a source of a network: Definition 3.7.Let N be a network.We say that a subset of cells S is a source if every edge targeting a cell in S starts in a cell of S, there exists a directed path between any two cells of that subset and S is the maximal subset that satisfy the previous two conditions.The number of source components of a network is denoted by s(N ).✸ Example 3.8.The network E 6 &E 4 in Table 6 of Section 5 has two source components S 1 = {1} and S 2 = {3}.✸ Note that there exists at least one source, i.e., s(N ) ≥ 1.
In a network with k asymmetric inputs, the polydiagonal where x i = x j for all the cells i, j in one source is a network synchrony space because all the cells inside a source receive k edges, only from cells inside that source.Suppose that s(N ) ≥ 2. Given two source components, the polydiagonal subspace given by x i = x j for all the cells i, j in these two source components is also a synchrony subspace.Repeating this synchronization for more sources, we can find synchrony subspaces such that the corresponding quotient network has exactly two source components.In particular, we can find the smallest synchrony subspace where the corresponding quotient network has only two source components.
In those smallest synchrony subspaces the valency eigenvalue is semisimple with multiplicity 2 and they are υ-submaximal with order 1.We denote those smallest synchrony subspaces by valency synchrony-breaking subspaces and the name is clear by the next result.Proposition 3.9.[6, Proposition 5.7] Let N be a network with asymmetric inputs, ∆ a valency synchrony-breaking subspace of N and f ∈ V υ (N ) generic where υ denotes the valency eigenvalue of N .Then there exists a bifurcation branch of f N with the synchrony associated to ∆.

Defective synchrony spaces.
There are networks with defective network eigenvalues, i.e., the algebraic and geometric multiplicity do not coincide.In this section, we study the case of defective synchrony spaces in networks with any number of cells.We prove that a µ-defective synchrony subspace with multiplicity (1, 2) supports a bifurcation branch.
Consider a network N with asymmetric inputs, a network eigenvalue µ, a generic function f ∈ V µ (N ) and a synchrony subspace ∆ which is µ-defective with multiplicity (1, 2) and µ-submaximal.Note that ∆ must be submaximal with order 1, because µ has geometric multiplicity 1 and algebraic multiplicity 2. Denote by ∆ 1 the µ-maximal synchrony subspace contained in ∆.Note that ker(J To prove the generic existence of bifurcation branches, we adapt the Lyapunov-Schmidt Reduction Method [14] considering vectors in the above conditions.Moreover, we need to impose the following condition: there are (p, q) such that , where A 0 = Id, A 1 ,. . .,A k are the adjacency matrix of N and P is the projection onto range(J N f 2 ) and kernel (range(J N f 2 )) ⊥ .This condition leads to a non-degeneracy condition on the function f .
We can now state the result: Theorem 3.10.Let N be a network with asymmetric inputs, µ be a defective network eigenvalue, f ∈ V µ (N ) generic and ∆ be a µ-submaximal synchrony subspace of N where µ has multiplicity (1,2).Suppose that condition (3.8) holds.Then there exists a bifurcation branch of f N with the synchrony ∆.
Proof.Since we are interested in proving the existence of bifurcation branches with the synchrony ∆, that is, we look for steady-state bifurcation branches with synchrony ∆, the following equation has to be solved in a neighbourhood of (0, 0): Assume ∆ is (isomorphic to) R n .Denote by ∆ 1 the µ-maximal synchrony subspace and let 2 ⊥∆ 1 and we have the following splits of R n : Applying the Lyapunov-Schmidt Reduction Method [14] to f N = 0, we obtain a function g : R 2 × R → R 2 such that the solutions of g = 0 are in one-to-one correspondence with the solutions of f = 0. Note that g 2 (x 1 , 0, λ) = 0 and It follows from the Lyapunov-Schmidt Reduction Method that there exists a function W : where P is the projection onto range(J N f 2 ) and kernel (range(J N f 2 )) ⊥ .The first derivatives of W are We can also calculate the second derivatives of g and we obtain that where j 1 j 2 = 1, 2, f pq are the second order derivative of f at the origin with respect to the variables p + 1 and q + 1 and W j is the derivative of W with respect to x j at the origin.
Since g 2 (x 1 , 0, λ) = 0, there is h In the first case, x 2 = 0, we are looking for bifurcation branches in the synchrony subspace ∆ 1 .By Theorem 3.1, there exists a bifurcation branch of steady-state solutions with synchrony ∆ 1 .We are now interested in solving h 2 (x 1 , x 2 , λ) = 0 providing a bifurcation branch of steady-state solutions having synchrony ∆ but which are not ∆ 1 -synchronous.
In the second case, in order to solve equation h 2 (x 1 , x 2 , λ) = 0, we use condition (3.8) which implies that (g 2 ) 22 = 0 for f generic.It follows from the Implicit Function Theorem that there exists β : R × R → R such that x 2 = β(x 1 , λ) is the unique solution of h 2 (x 1 , x 2 , λ) = 0 in a neighbourhood of the origin.The derivative of β with respect to λ at the origin is: Replacing x 2 by β in the function h 2 of equation h 2 (x 1 , x 2 , λ) = 0, we obtain the function which has the following nonnull derivative at the origin: Again by the Implicit Function Theorem, there exists a continuous function Λ : R → R such that h 1 (x 1 , Λ(x 1 )) = 0. Therefore Since the function f is generic, the origin is an isolated zero of the function f at λ = 0. Thus the function Λ is not constant and we can write, at least part of, the graph (x 1 , Λ(x 1 )) ⊂ R 2 as a graph of a function in λ.We obtain so a nontrivial bifurcation branch of steady-state solutions of f N with synchrony ∆.
Remark 3.11.The previous proof also holds even if the synchrony subspace is µmaximal instead of µ-submaximal.Specifically, if the synchrony subspace ∆ in Theorem 3.10 is µ-maximal instead of µ-submaximal, we can still find a solution of g = 0 with x 2 = 0 and this solution leads to a non-trivial bifurcation branch of steady-state solutions of f N with synchrony ∆, since ∆ is maximal.✸

Steady-state bifurcations for three-cell networks with asymmetric inputs
In this section we address three-cell networks with any number of asymmetric inputs.We obtain the network eigenvalues and lattices of synchrony subspaces which combined with the results of the previous section derive the possible codimensionone steady-state for three-cell networks with asymmetric inputs and corresponding bifurcation diagrams.4.1.Eigenvalue structure.Let N be a three-cell network with asymmetric inputs and f N an admissible coupled cell system for N .Recalling (2.4), we have that the Jacobian matrix of f N at the origin is a 3 × 3 matrix determined by the adjacency matrices of N and the first derivatives of f at the origin.It follows, in particular, that the Jacobian matrix has constant row-sum, say υ, which is an eigenvalue of such matrix and (1, 1, 1) is a corresponding eigenvector.For completeness, we collect in Proposition 4.1 the possible eigenvalue structures of a general 3 × 3 matrix with constant row sum.Proposition 4.1.Let A be a 3 × 3 matrix with real entries and constant row-sum υ = 0. Suppose that and denote by α 0 = det(A)/υ and α 1 = tr(A) − υ.Table 1 lists the possible cases for the eigenvalue structure of the matrix A.
Proof.Suppose A is given by (4.9).As (1, 1, 1) is an eigenvector of A associated with the eigenvalue λ 1 = υ, taking the non-singular matrix P and the 2 × 2 matrix S given by we have that Thus α 0 = det(S) = det(A)/υ, α 1 = tr(S) = tr(A) − υ and the characteristic polynomial of A is given by p Denote by m a (υ) the algebraic multiplicity of the constant row-sum eigenvalue υ.We have the following cases: (i) m a (υ) = 3 if and only if α 0 = υ 2 and α 1 = 2υ.

Eigenvalues of A Conditions Eigenvalues of A Conditions
Eigenvalues λ 1 , λ 2 , λ 3 of a 3×3 matrix A with constant rowsum υ = 0. Here, α 0 = det(A)/υ, α 1 = tr(A) − υ and it is followed the notation (4.9) for the entries of the matrix A. In the top left case m a (v) = 3, in the top right case m a (v) = 2 and in the other cases, m a (v) = 1.
(iii) m a (υ) = 1 and there is an eigenvalue λ 2 = υ with algebraic multiplicity 2 if and only if α 2 1 = 4α 0 and α 1 = 2υ.Moreover, λ 2 = λ 3 = α 1 /2 and the geometric multiplicity of λ 2 is equal to the dimension of the kernel of the matrix P −1 AP − α 1 /2Id 3 .Trivially, the dimension of the kernel of the matrix P −1 AP − α 1 /2Id 3 is equal to the dimension of the kernel of the matrix B = 2 (S − α 1 /2Id 2 ).Note that and so, the dimension of ker(B) is two if and only if (iv) Finally, A has three distinct eigenvalues if and only if υ is not an eigenvalue of S (υ 2 − α 1 υ + a 0 = 0, that is, υ(α 1 − υ) = α 0 ) and S has two distinct roots (α 2 1 = 4α 0 ).The roots of the characteristic polynomial of S are real if and only if α 2  1 > 4α 0 .
Remark 4.2.(i) Note that when the network has one asymmetric input, the Jacobian matrix of f N at the origin is J N f = f 0 Id 3 + f 1 A 1 which has eigenvalues given by f 0 + µf 1 , where µ runs through the eigenvalues of the adjacency matrix A 1 .This is a special case of (2.4).(ii) Among the results obtained in [7], it is remarked that the minimal network in Figure 2 represents the unique ODE-class of minimal three-cell networks with six asymmetric inputs.The Jacobian matrix of f N at the origin for such network has the form J N f = f 0 Id 3 + 6 i=1 f i A i , where A i , for i = 1, . . ., 6 are the network adjacency matrices.It also follows from [7] that the six adjacency matrices A i plus the 3 ×3 identity matrix generate the linear space of the 3 ×3 matrices with constant row sum.Therefore, besides the valency eigenvalue of J N f , the other eigenvalues are generically arbitrary and simple.Thus there exists an open set of generic functions f where the eigenvalues of the Jacobian matrix J N f are distinct and real.✸ Table 2. Three-cell connected networks with one asymmetric input, up to re-enumeration of the cells.Here ψ = e i2π/3 and ∆ l = {x : x j = x k for j, k = l}, where 1 ≤ l ≤ 3. Eigenvalues having algebraic multiplicity two and geometric multiplicity one are marked with a star * .
Example 4.3.Table 2 lists, up to ODE-equivalence, the minimal connected networks with three-cells and one asymmetric input and the eigenvalues and eigenvectors of the associated adjacency matrices.✸ 4.2.Lattice structures.We characterize now, for the three-cell networks with asymmetric inputs, the lattice of synchrony subspaces.Here, the bottom element is the full-synchrony subspace and the top element is the network phase space.Whenever there are synchrony subspaces with dimension two, they correspond to the middle elements.Each lattice element is labelled with the eigenvalues of the corresponding quotient network.So the bottom element is labelled with the valency eigenvalue υ.Consider a connected network N with three-cells and asymmetric inputs, a generic coupled cell system f N and the corresponding Jacobian J N f (at the origin).Denote by m a (υ) the algebraic multiplicity of the eigenvalue υ corresponding to the constant row-sum or valency of J N f .It follows from [6,Proposition 5.6] that υ is a semisimple eigenvalue and m a (υ) is equal to the number of source components in the network.Thus m a (υ) < 3, otherwise the network has three source components and it is disconnected.We have then that there exists at least one more eigenvalue which we denote by µ.In the next result, we refer to the eigenvalues of J N f for generic f as υ, µ in case there are only two distinct eigenvalues, and υ, µ 1 , µ 2 in case there are three distinct eigenvalues.
Remark 4.4.Let N be a network with n cells and µ a semisimple eigenvalue such that R n = ∆ ⊕ E µ for some network synchrony subspace ∆.Given a polydiagonal subspace ∆ ′ containing ∆, i.e., ∆ ⊂ ∆ ′ , trivially, there are v 1 , . . ., v m ∈ E µ such that we have ∆ ′ = ∆⊕ < v 1 , . . ., v m >.Hence, as ∆ ′ is invariant for any J N f and it is a polydiagonal, we conclude that ∆ ′ is also a network synchrony subspace.✸ Theorem 4.5.The possible annotated synchrony lattice structures for connected three-cell networks with asymmetric inputs are presented in Figure 3.
Proof.Consider a connected network N with three-cells, a generic coupled cell system f N and the corresponding Jacobian J N f (at the origin).(i) Suppose that m a (υ) = 2. Then the eigenvalue µ has multiplicity one and the two source components of the network have one cell each.Otherwise, the network will be disconnected.Note that if i, j are the cells of the two source components then the polydiagonal defined by the equality x i = x j is a two-dimensional network synchrony space.Moreover, the two-cell quotient associated to that synchrony subspace with dimension two has the eigenvalues υ and µ, because it is connected.If there were more than one synchrony subspaces with dimension two, then there were at least two linear independent eigenvectors of µ.But, that is not possible, since the algebraic multiplicity of the eigenvalue µ is one.Therefore, there is only one two-dimensional synchrony subspace and the lattice structure must be the one in Figure 3a.(ii) Suppose that υ and µ are the unique eigenvalues of J N f , where m a (υ) = 1 and µ has geometric multiplicity two.Then R 3 = ∆ 0 ⊕ E µ and by Remark 4.4, every polydiagonal subspace of R 3 is a synchrony subspace of N .Thus the lattice structure must be the one in Figure 3b.(iii) Suppose that υ and µ are the unique eigenvalues, m a (υ) = 1 and µ has geometric multiplicity one.Again, we know that any synchrony subspace with dimension two has the eigenvalues υ and µ.If there were two or more synchrony subspace with dimension two, we would obtain at least two linear independent eigenvectors associated with µ, a contradiction.Therefore, the lattice structure must be one of the following two in Figures 3c-3d, where the defective eigenvalue is marked with a star * .(iv) Suppose that the network has three distinct eigenvalues, υ, µ 1 and µ 2 , with m a (υ) = 1 and m a (µ 1 ) = m a (µ 2 ) = 1   Theorem 4.6.Let N be a connected three-cell network with asymmetric inputs and take its associated annotated synchrony lattice structure L which has to be one of the seven lattice structures in Figure 3. Then the structure of the bifurcation diagram of N is the one indicated in Figure 4 for the lattice structure L.
Proof.We start by noticing that the full synchrony subspace ∆ 0 is υ-simple and υ-maximal and any two-dimensional synchrony subspace in Figure 3 is also µ-simple and µ-maximal.Applying Theorem 3.1, we conclude that the full synchrony subspace ∆ 0 and any two-dimensional synchrony subspace support a bifurcation branch for a bifurcation problem given by the condition υ = 0 and µ = 0, respectively.If a synchrony space ∆ is µ-simple and µ-submaximal, then there is no bifurcation branch with synchrony ∆ for any generic f ∈ V µ (N ), as the dimension of the center subspace does not increase from the µ-maximal subspace.(i) For the lattice in Figure 3a, we see that there is one two-dimensional synchrony space and that the space R 3 is valency synchrony-breaking.By Proposition 3.9, the network phase space R 3 supports a bifurcation branch for bifurcation problems given by condition υ = 0. Thus bifurcation problems given by the valency have a bifurcation branch with synchrony ∆ 0 and another with synchrony R 3 .In [6], it is proven that there are two bifurcation branches with synchrony R 3 .However we are only interested in the synchrony of the branches and we only draw one branch with synchrony R 3 in the diagram.For the second condition µ = 0, we know that the two-dimensional synchrony space supports a bifurcation branch for a bifurcation problem given by that condition.This means that there are two and one types of synchrony emerging for bifurcation problems given by the condition υ = 0 and µ = 0, respectively.Hence the diagram bifurcation is given in Figure 4a.(ii) For the lattice structure in Figure 3b, there are three two-dimensional synchrony spaces, and the space R 3 is µ-semisimple with multiplicity 2 and µ-submaximal with order 3.Note that 2 2 − 1 = 3 and so Theorem 3.3 can be applied to R 3 .If the Assumptions 3.2 hold, we conclude that R 3 does not support a bifurcation branch.Since the two-dimensional synchrony spaces support a bifurcation branch, we have bifurcation branches with synchronies ∆ 1 , ∆ 2 and ∆ 3 for bifurcation problems given by the condition µ = 0.Moreover, a bifurcation problem given by the valency, that is, υ = 0, has a bifurcation branch with synchrony ∆ 0 .Thus, there are three (resp.one) types of synchrony branches of steady-state solutions emerging when the For networks with lattice structure Figure 3a.
For networks with lattice structure Figure 3d.
(e) For networks with lattice structure Figure 3e.
(f) For networks with lattice structure Figure 3f.
∆ 0 (g) For networks with lattice structure Figure 3g when (h) For networks with lattice structure Figure 3g when µ 1 , µ 2 are real and distinct.bifurcation condition imposed is µ = 0 (resp.υ = 0) and the bifurcation diagram is given in Figure 4b.
(iii) Taking now the lattice structure in Figure 3c, there is one two-dimensional synchrony space, and the space R 3 is µ-defective with multiplicity (1, 2) and µsubmaximal with order 1.Assuming that condition holds, from Theorem 3.10 follows that R 3 supports a bifurcation branch of steady-state solutions under the bifurcation condition µ = 0.As the two-dimensional synchrony spaces also support a bifurcation branch of steady-state solutions under the bifurcation condition µ = 0, we have that there are two types of synchrony branches of steady-state solutions emerging when µ = 0.Under the valency bifurcation condition υ = 0, there is a bifurcation branch of steady-state solutions with synchrony ∆ 0 and the diagram bifurcation is so given in Figure 4c.(iv) We consider now the synchrony lattice structure given in Figure 3d, where there is no two-dimensional synchrony space, and the space R 3 is µ-defective with multiplicity (1, 2) and µ-maximal.It follows from Remark 3.11 that the space R 3 supports a bifurcation branch of steady-state solutions under the bifurcation condition µ = 0.Moreover, ∆ 0 supports a bifurcation branch of steady-state solutions under the bifurcation condition υ = 0. See the bifurcation diagram in Figure 4d.(v) In the synchrony lattice structure of Figure 3e, there are two two-dimensional synchrony spaces, ∆ 1 which is µ 1 -simple and µ 1 -maximal and ∆ 2 which is µ 2 -simple and µ 2 -maximal and the space R 3 is simple and submaximal.Thus ∆ 0 , ∆ 1 and ∆ 2 support a bifurcation branch for bifurcation problems given by the conditions υ = 0, µ 1 = 0 and µ 2 = 0, respectively.Moreover, the space R 3 does not support a bifurcation branch.We obtain the bifurcation diagram in Figure 4e.(vi) In the synchrony lattice structure of Figure 3f, the two-dimensional synchrony space ∆ 1 is µ 1 -simple and µ 1 -maximal and the space R 3 is µ 2 -simple and µ 2 -maximal.Hence, from Theorem 3.1 applied to the synchrony spaces ∆ 0 , ∆ 1 and R 3 , each synchrony space supports a bifurcation branch of steady-state solutions under the corresponding bifurcation condition and the bifurcation diagram is given in Figure 4f.(vii) Last, we study the annotated lattice given in Figure 3g.In this case, the network eigenvalues can be complex conjugated and this leads to two different bifurcation diagrams.If the network eigenvalues µ 1 and µ 2 are conjugate complex numbers, µ 1 = µ 2 , then only the full synchrony subspace ∆ 0 supports a bifurcation branch of steady-state solutions under bifurcation condition υ = 0 and we get the bifurcation diagram in Figure 4g.If the µ 1 and µ 2 are real and distinct, then the space R 3 is µ 1 -simple and µ 1 -maximal and it is also µ 2 -simple and µ 2 -maximal.Now, we can apply Theorem 3.1 to R 3 for the two bifurcation conditions µ 1 = 0 and µ 2 = 0. Thus the space R 3 supports a bifurcation branch for bifurcation problems given by µ 1 = 0 and µ 2 = 0 and the diagram bifurcation is given in Figure 4h.
Table 3. Minimal three-cell networks with two asymmetric inputs and no 2D synchrony subspaces.
5. Case study: three-cell networks with one, two or six asymmetric inputs The minimal connected three-cell networks with one, two and six asymmetric inputs are enumerated, up to ODE-equivalence, in [7].Moreover, it is proved that any three-cell network with k-asymmetric inputs , k ∈ N, is ODE-equivalent to a minimal three-cell network with at most six asymmetric inputs.In this section, for each such three-cell connected network, we study which synchrony subspaces support a synchrony-breaking bifurcation branch of steady-state solutions.
We start by recalling the classification given in [7] of the minimal connected threecell networks with one, two and six asymmetric inputs.

Theorem 5.1 ([7]
).There are exactly: (i) Four ODE-classes of connected three-cell networks with one asymmetric input, see the minimal representatives in Table 2. (ii) Forty eight ODE-classes of connected three-cell networks with two asymmetric inputs, see the minimal representatives in Tables 3-8.The networks in Tables 3-4 have no two-dimensional synchrony subspaces; the networks in Tables 5-6 have exactly one two-dimensional synchrony subspace; the networks in Table 7 have exactly two two-dimensional synchrony subspaces; the network in Table 8 has three twodimensional synchrony subspaces.(iii) One ODE-class of connected three-cell networks with six asymmetric inputs, with minimal representative in Figure 2 and it has no two-dimensional synchrony spaces.
Table 2 includes the two-dimensional synchrony subspaces of each connected threecell network with one asymmetric input in Table 2.
For each three-cell connected network described in Theorem 5.1, in order to investigate which synchrony subspaces support a synchrony-breaking bifurcation branch of steady-state solutions, the strategy is the following.First, we use Proposition 4.1 to see when the network eigenvalues are simple, semisimple or defective, and conjugate Table 4. Minimal three-cell networks with two asymmetric inputs and no 2D synchrony subspaces.Table 6.Minimal three-cell networks with two asymmetric inputs and one 2D synchrony subspace.
Table 7. Minimal three-cell networks with two asymmetric inputs and two 2D synchrony subspaces.
Table 8.Minimal three-cell network with two asymmetric inputs and three 2D synchrony subspaces.
Section 3 to determine which synchrony subspaces support a synchrony-breaking bifurcation branch of steady-state solutions, assuming a codimension-one steady-state bifurcation occurs determined by a degeneracy condition of the network Jacobian matrix at the origin.In this last part, we remark that for three-cell networks with the synchrony lattice structure in Figure 3b and corresponding bifurcation diagram given in Figure 3b, Assumptions 3.2 have to be verified.For three-cell networks with the synchrony lattice structure given in Figure 3c and corresponding bifurcation diagram in Figure 4c, condition (3.8) has to be verified.Table 9 aggregates the information obtained in the previous steps and the results of this section which are obtained by explicit calculation for each network.
Theorem 5.2.Consider the three-cell networks listed in Theorem 5.1.For each such network N take coupled cell systems f N where f is generic and consider the corresponding Jacobian matrix J N f at the origin.We have the following: (i) For the network E 6 &E 4 in Table 6, J N f has the valency eigenvalue with algebraic and geometric multiplicities 2 and the eigenvalue f 0 with multiplicity 1.
(ii) For the network C in Table 2 and the network C 1 &C 2 in Table 8, J N f has the valency eigenvalue with multiplicity 1 and the eigenvalue f 0 with algebraic and geometric multiplicities 2. (iii) For the network D in Table 2 and networks f has the valency eigenvalue with multiplicity 1 and the eigenvalue f 0 with algebraic multiplicity 2 and geometric multiplicity 1. (iv) For the network F in Table 2, the networks in Tables 5 and 7 and networks f has three distinct real eigenvalues with multiplicity 1. (v) For the networks in Table 4 and the network in Figure 2, J N f has three distinct real eigenvalues with multiplicity 1 on a open set of the generic functions.(vi) For the network A in Table 2 and networks C 1 &A 2 , A 2 &A 1 in Table 3, J N f has three distinct eigenvalues with multiplicity 1 where the two eigenvalues different from the valency have nonzero imaginary parts.
Proof.The proof of this result goes through the direct application of Proposition 4.1 to the networks with three-cells listed in Theorem 5.1, obtaining the fourth column in Table 9.We present details of that in some illustrative examples.Recall the notation of Proposition 4.1.(i) Consider the network N 1 = E 6 &E 4 in Table 6 and f : R 3 → R generic.We have that Now α 0 = υ 2 if and only if f 1 + f 2 = 0. Assuming the non-degeneracy condition f 1 + f 2 = 0, it follows from Proposition 4.1 that the eigenvalue f 0 + f 1 + f 2 has algebraic multiplicity lower that 3. Note that υ(α 1 − υ) = α 0 for every f .Thus the eigenvalue f 0 +f 1 +f 2 has algebraic multiplicity 2 and the eigenvalue f 0 has algebraic multiplicity 1, for f generic.
(ii) Consider the network N 2 = C 1 &C 2 in Table 8 and f : R 3 → R generic and assume the non-degenerated conditions α 1 = 2υ and υ(α 1 − υ) = α 0 .Like in the previous example, we have that α 2 1 = 4α 0 for every f .However, in this case, we also have that c − e = b − f = d − a + e − f = 0 for every f .It follows from Proposition 4.1 that J N 2 f has the eigenvalue Table 9.This table aggregates the results obtained for the networks listed in Theorem 5.1.The third column, # 2D, corresponds to the number of two-dimensional synchrony subspaces for the corresponding network.The fourth column displays the network eigenvalues as obtained in Theorem 5.2.The valency eigenvalue is denoted by υ and other network eigenvalues are denoted by µ or µ 1 , µ 2 .Defective network eigenvalues with algebraic multiplicity two and geometry multiplicity one are marked with a star.There is also information on whether the eigenvalues µ 1 , µ 2 are conjugate complex numbers or not.The fifth column corresponds to the annotated synchrony lattices as given in Theorem 5.4 and the last column displays the bifurcation diagram.
address the cases where the eigenvalues are conjugate complex numbers.We point out that in those cases, Hopf bifurcation can occur.✸ Combining Theorems 5.1-5.2 and Theorem 4.5, we have the following classification on the networks annotated synchrony lattices: Theorem 5.4.The annotated synchrony lattice structures for the three-cell networks listed in Theorem 5.1 are presented in the fifth column of Table 9.
Proof.For completeness, we illustrate how Theorems 5.1-5.2determine the networks annotated synchrony lattices for some of the networks listed in Theorem 5.1.(i) The Jacobian matrix for the network N 1 = E 6 &E 4 in Table 6 has the valency eigenvalue f 0 + f 1 + f 2 with algebraic multiplicity 2 and the eigenvalue f 0 with algebraic multiplicity 1, for f generic.Since the network N 1 has one two-dimensional synchrony subspace, we know that the annotated lattice of N 1 is given in Figure 3a.(ii) The Jacobian matrix for the network N 2 = C 1 &C 2 in Table 8, has the valency eigenvalue f 0 + f 1 + f 2 with algebraic multiplicity 1 and the eigenvalue f 0 with algebraic and geometric multiplicity 2. We also know that the network N 2 has three two-dimensional synchrony subspaces and its lattice is given in Figure 3b.(iii) The Jacobian matrix for the network N 3 = C 1 &D 1 in Table 6 has the valency eigenvalue f 0 + f 1 + f 2 with algebraic multiplicity 1 and the eigenvalue f 0 with algebraic multiplicity 2 and geometric multiplicity 1, for f generic.Moreover, the network N 3 has one two-dimensional synchrony subspace and its lattice is given in Figure 3c.(iv) The Jacobian matrix for the network N 4 = E 6 &B 1 in Table 3 has 3 distinct eigenvalues with algebraic multiplicity 1, for f generic.The network N 4 has no twodimensional synchrony subspace and its annotated lattice is given in Figure 3g.(v) The Jacobian matrix for the network N 5 = D 1 &E 1 in Table 5, has 3 distinct eigenvalues with algebraic multiplicity 1, for f generic.And the network N 5 has one two-dimensional synchrony subspace.Thus its annotated lattice is given in Figure 3f.(vi) The Jacobian matrix for the network N 6 = C 1 &E 6 in Table 7 has 3 distinct eigenvalues with algebraic multiplicity 1, for f generic.Moreover, the network N 6 has two two-dimensional synchrony subspace.Thus its annotated lattice is given in Figure 3e.
Remark 5.5.From the possible lattice structures presented in Theorem 4.5 for connected three-cell networks with asymmetric inputs, we have: (i) Only the lattice structure in Figure 3d does not appear when we restrict to networks with one or two asymmetric inputs.(ii) The lattice structures of Figures 3a and 3f occur for connected three-cell networks with two asymmetric inputs but not for connected three-cell networks with one asymmetric input.✸ Finally, we classify which synchrony subspaces support a steady-state bifurcation branch for generic bifurcation problems on coupled cell systems of the three-cell networks given in Theorem 5.1.This classification appears at the sixth column of Table 9.
Theorem 5.6.For the networks given in Theorem 5.1, we have that every synchrony subspace supports a bifurcation branch of steady-state solutions, for generic bifurcation problems on coupled cell systems respecting the appropriate bifurcation condition, except for the network phase space R 3 in the case of all the networks in Tables 4, 7-8, the networks C 1 &A 2 , A 2 &A 1 in Table 3, networks A, C, F in Table 2 and the network in Figure 2.However, for each of the networks in Table 4 and the network in Figure 2, there exists an open set of generic bifurcation problems, on coupled cell systems respecting the appropriate bifurcation condition, where the network phase space R 3 supports a bifurcation branch.The sixth column of Table 9 contains the bifurcation diagrams for the networks given in Theorem 5.1.
Proof.The proof of Theorem 5.6 follows as in the proof of Theorem 4.6, where the bifurcation diagram is obtained for each possible annotated synchrony lattice structure taking every connected three-cell network given in Theorem 4.5.We include an illustrative example for each case studied in the proof of Theorem 4.6 except case (iv), since the networks given in Theorem 5.1 do not have the synchrony lattice structure given in Figure 3d.If a particular network has the lattice given by Figure 3b or Figure 3c, then we need to check Assumptions 3.2 or condition (3.8), respectively.More specifically, for the examples illustrating cases (ii) and (iii) in the proof of Theorem 4.6, we provide non-degeneracy conditions associated with Assumptions 3.2 and condition (3.8), respectively.(i) The network N 1 = E 6 &E 4 in Table 6 has the annotated lattice given in Figure 3a.The Jacobian matrix at the origin J N 1 f has the eigenvalue υ = f 0 + f 1 + f 2 with algebraic multiplicity 2 and the simple eigenvalue µ = f 0 .So there are two steadystate bifurcation conditions υ = 0 and µ = 0.For the first condition, υ = 0, we consider f ∈ V υ (N 1 ).The synchrony subspace ∆ 0 is υ-simple and υ-maximal, the two-dimensional synchrony subspace ∆ 1 is υ-simple and υ-submaximal and R 3 is valency synchrony-breaking.It follows from Theorem 3.1 and Proposition 3.9 that there are bifurcation branches of f N 1 with the synchrony ∆ 0 and R 3 .Since ∆ 1 is υ-simple and υ-submaximal, we know that the bifurcation problem in ∆ 1 is reduced to a bifurcation problem in ∆ 0 .Thus there is no bifurcation branches of f N 1 with synchrony exactly equal to ∆ 1 .Figure 4a displays the two synchrony subspaces that support a bifurcation branch at υ = 0.For the second condition, µ = 0, we consider f ∈ V µ (N 1 ).As ∆ 0 does not have the eigenvalue µ, the synchrony space ∆ 1 is µsimple and µ-maximal and R 3 is µ-simple and µ-submaximal.Using Theorem 3.1, we see that there is a bifurcation branch of f N 1 with the synchrony ∆ 1 .Moreover, we also know that there is no bifurcation branch of f N 1 with synchrony exactly equal to ∆ 0 or R 3 .Figure 4a displays that ∆ 1 supports a bifurcation branch at µ = 0 and the bifurcation diagram for N 1 is given by Figure 4a.(ii) Consider the network N 2 = C 1 &C 2 in Table 8.The lattice of N 2 is given in Figure 3b and J N 2 f has the eigenvalue υ = f 0 + f 1 + f 2 with algebraic multiplicity 1 and the eigenvalue µ = f 0 with algebraic and geometric multiplicity 2. Thus there are two steady-state bifurcation conditions υ = 0 and µ = 0, and there are three two-dimensional synchrony subspaces ∆ 1 , ∆ 2 and ∆ 3 .For the first condition, υ = 0, we consider f ∈ V υ (N 2 ).The synchrony subspace ∆ 0 is υ-simple and υmaximal, and ∆ 1 , ∆ 2 , ∆ 3 and R 3 are υ-simple and υ-submaximal.Thus there is a bifurcation branch of f N 2 with the synchrony ∆ 0 and no bifurcation branches of f N 2 with synchrony exactly equal to ∆ 1 , ∆ 2 , ∆ 3 or R 3 .Hence the bifurcation diagram at υ = 0 is given in Figure 4b.For the second condition, µ = 0, we consider f ∈ V µ (N 2 ).There is no bifurcation branch of f N 2 with synchrony exactly equal to ∆ 0 , since µ is not an eigenvalue in ∆ 0 .The synchrony subspaces ∆ 1 , ∆ 2 and ∆ 3 are µ-simple and µ-maximal and we apply Theorem 3.1 to each two-dimensional synchrony subspace.So, there are bifurcation branches of f N 2 with the synchronies ∆ 1 , ∆ 2 and ∆ 3 .The network phase space R 3 is µ-semisimple with multiplicity 2 and µ-submaximal with order 3. Using Theorem 3.3, we can conclude that R 3 does not support a bifurcation branch.We need to check that the conditions in Theorem 3.3 are satisfied.The µ-maximal synchrony subspaces ∆ 1 , ∆ 2 and ∆ 3 are 2-determined (see Remark 5.7).Next, we obtain explicit non-degeneracy conditions on the function f such that it satisfies Assumptions 3.2.Using the notation used in the proof of Theorem 3.3, set Following the proof of Theorem 3.3, the reduced function g of f N 2 given by the Lyapunov-Schmidt Reduction has the following second-order Taylor expansion: Consider the following non-degeneracy conditions: Under these conditions, Assumptions 3.2 hold and there is no bifurcation branch of f N 2 with synchrony exactly equal to R 3 .Thus Figure 4b is the bifurcation diagram of N 2 .(iii) Consider the network N 3 = C 1 &D 1 in Table 6 with lattice given in Figure 3c.We know that υ = f 0 + f 1 + f 2 is an eigenvalue of J N 3 f with algebraic multiplicity 1 and that µ = f 0 is an eigenvalue of J N 3 f with algebraic multiplicity 2 and geometric multiplicity 1 for f generic.As the previous case, we know that there is a bifurcation branch of f N 2 with synchrony ∆ 0 when f ∈ V υ (N 3 ) and no bifurcation branches exactly with synchrony ∆ 1 or R 3 .For the bifurcation condition µ = 0, we consider f ∈ V µ (N 3 ).There is no bifurcation branch of f N 3 with synchrony exactly equal to ∆ 0 and there is a bifurcation branch of f N 3 with synchrony ∆ 1 .The network phase space R 3 is µ-defective with multiplicity (1, 2) and µ-submaximal with order 1 and we will use Theorem 3.10 to prove that there is a bifurcation branch of f N 3 with synchrony R 3 .In order to apply Theorem 3.10, we need to check if condition (3.8) holds.Following the proof of Theorem 3.10, we set ).The network N 3 satisfies condition (3.8) for p = q = 0, if the following nondegeneracy condition holds where P is the projection into Im(J N 3 f ) 2 = ∆ 0 .Therefore, by Theorem 3.10, there is a bifurcation branch with synchrony R 3 for every generic f ∈ V υ (N ).The bifurcation diagram has so two branches of steady-state solutions with synchrony ∆ 1 and R 3 at µ = 0 and the bifurcation diagram of N 3 is given in Figure 4c.(iv) Consider the network N 4 = C 1 &E 6 in Table 7 with lattice given in Figure 3e.The Jacobian matrix J N 4 f has the following three simple eigenvalues: υ = f 0 + f 1 + f 2 , µ 1 = f 0 + f 2 and µ 2 = f 0 .The full-synchrony subspace ∆ 0 is υ-simple and υmaximal.Note also that one of the two-dimensional synchrony spaces ∆ 1 is µ 1simple and µ 1 -maximal and the other ∆ 2 is µ 2 -simple and µ 2 -maximal.As before, there is bifurcation branch with synchrony ∆ 0 , ∆ 1 or ∆ 2 for bifurcation problems given by the condition υ = 0, µ 1 = 0 or µ 2 = 0, respectively.In this case, R 3 is µ-simple and µ-submaximal, for any network eigenvalue, υ, µ 1 or µ 2 .Independently of the bifurcation condition, R 3 does not support a bifurcation branch.Then the bifurcation diagram has one branch emerging at each bifurcation condition υ = 0, µ 1 = 0 and µ 2 = 0 with synchrony ∆ 0 , ∆ 1 or ∆ 2 leading to the bifurcation diagram given in Figure 4e.(v) Consider the network N 5 = C 1 &B 1 in Table 5 with the lattice given in Figure 3f.The Jacobian matrix J N 5 f has the following three simple eigenvalues: υ = f 0 +f 1 +f 2 , µ 1 = f 0 +f 2 and µ 2 = f 0 −f 2 .Thus we need to consider three steady-state bifurcation conditions: υ = 0, µ 1 = 0 and µ 2 = 0. Note that the full-synchrony subspace ∆ 0 is υ-simple and υ-maximal, the two-dimensional synchrony subspace ∆ 1 is µ 1 -simple and µ 1 -maximal.The space R 3 is µ 2 -simple and µ 2 -maximal.The study for each bifurcation condition is similar and we can apply Theorem 3.1.Then, we have a bifurcation branch inside each synchrony space for bifurcation problems with the associated bifurcation conditions and the bifurcation diagram is given in Figure 4f.(vi) Consider the network N 6 = C 1 &A 2 in Table 3 with the lattice given in Figure 3g.The Jacobian matrix J N 6 f has the following three simple eigenvalues: 2 .Since the eigenvalues are µ 1 and µ 2 are conjugate complex numbers, they do not lead to a steady-state bifurcation condition.We need to consider only the bifurcation condition υ = 0.In this case, we take f ∈ V υ (N 4 ).The full-synchrony subspace ∆ 0 is υ-simple and υ-maximal and R 3 is υ-simple and υ-submaximal.Thus there is exactly one bifurcation branch with synchrony ∆ 0 and the bifurcation diagram is given in Figure 4g.
(vii) Consider the network N 7 = E 6 &B 1 in Table 3 with lattice given in Figure 3g.The Jacobian matrix J N 7 f has the following three simple eigenvalues: and . Note that f 2 1 +4f 2 2 ≥ 0, then there are three steady-state bifurcation conditions: υ = 0, µ 1 = 0 and µ 2 = 0.As before, there exists a bifurcation branch with synchrony ∆ 0 for any generic f ∈ V υ (N 5 ).The bifurcation diagram for the bifurcation condition υ = 0 has a branch with synchrony ∆ 0 .The total phase space R 3 is µ 1 -simple and µ 1 -maximal.Thus, there exists a bifurcation branch of steady-state solutions with synchrony R 3 for any generic f ∈ V µ 1 (N 5 ) and the bifurcation diagram for the bifurcation condition µ 1 = 0 has a branch with synchrony R 3 .The total phase space R 3 is also µ 2 -simple and µ 2maximal.So the bifurcation diagram at µ 2 = 0 is identical to the previous case and the bifurcation diagram at µ 2 = 0 has a branch with synchrony R 3 .Therefore, the bifurcation diagram for N 7 is given in Figure 4h.(viii) Consider the network N 8 = D 1 &D 2 in Table 4 with lattice given in Figure 3g.The Jacobian matrix J N 8 f has the following eigenvalues: Note that the eigenvalues µ 1 and µ 2 are real or conjugate complex numbers if f 1 f 2 ≥ 0 or f 1 f 2 < 0.Moreover, the space of functions can be divided into two disjoint regions of functions depending if there is one or there are three steady-state bifurcation conditions.In the region given by f 1 f 2 < 0, the analysis is similar to the case (vi) studied above.Therefore, in this region the bifurcation diagram for N 8 is given in Figure 4g.The second region is given by f 1 f 2 > 0 and it is identical to the previous case (vii).Here, the bifurcation diagram is given in Figure 4h.Thus the network N 8 has two different bifurcation diagrams: Figure 4g or Figure 4h.6 satisfy the conditions of Theorem 3.10 for one of their eigenvalues.The steady-state bifurcation branches of the first three of those networks have been studied in [25] and they correspond to the networks A, B and C, respectively, in that work.(ii) It follows from [32,Theorem 6.7] and the considerations about determinacy given in the proof of Theorem 3.1 that the bifurcation problems considered in Theorem 5.6 are at most 3 determined when the bifurcation condition is µ-simple.This means that g x 2 = 0 or g x 3 = 0, where g is the reduced function obtained by the Lyapunov-Schmidt Reduction.By explicit computation for the networks considered here, we have that g x 2 = 0 if and only if the network and the bifurcation condition is one of the following: E 6 &F 5 when f 0 + f 1 − f 2 = 0, C 1 &B 1 when f 0 − f 2 = 0, E 6 &F 6 when f 0 + f 1 − f 2 = 0, E 6 &F 4 when f 0 + f 1 − f 2 = 0, B 1 &F 1 when f 0 + f 1 − f 2 = 0, F 1 &F 2 when f 0 − f 1 − f 2 = 0, F 1 &F 6 when f 0 − f 1 − f 2 = 0, and F when f 0 − f 1 = 0.
The condition g x 2 = 0 is usually associated with a Z 2 -symmetry of the bifurcation problem.However, the authors of [32] noted that this is not always the case for coupled cell systems of regular networks.That occurs, in particular, for the networks E 6 &F 6 and F 1 &F 6 , that we study here, where g x 2 = 0, without the networks or any of their quotient networks having Z 2 -symmetry.✸

Conclusions
This work contributes to the classification of the codimension-one steady-state synchrony-breaking bifurcations for networks with identical cells and asymmetric inputs.In order to achieve this goal, we start by deriving general results regarding the codimension-one steady-state bifurcation problems from a full synchrony equilibrium covering connected networks with any number of identical cells and any number of asymmetric inputs.The results take into account how the network synchrony spaces intersect the eigenspaces of the Jacobian matrix at a full synchrony equilibrium.In particular, they are organized by the type of the eigenvalues, i.e., simple, semisimple or defective, and maximal or submaximal.
These bifurcation results are then applied to the class of networks of three-cells with any number of asymmetric inputs, after we have obtained a classification of their eigenvalues and lattices of synchrony subspaces.A direct application is the steadystate bifurcation analysis for the three-cell quotient networks of a given network with n > 3 cells.We then restrict to three-cell networks with one, two or six asymmetric inputs and, for each such network, we are able to identify the synchrony subspaces that support a synchrony-breaking bifurcation branch of steady-state solutions.We believe that the classification obtained here also holds for the three-cell networks with three, four and five asymmetric inputs, as the eigenvalues of the Jacobian at the full equilibrium tend to be simple as we increase the number of inputs.

1 2 3 Figure 2 .
Figure 2. A representative of the minimal class of the networks with three-cells and six asymmetric inputs.

Figure 3 .
Figure 3. Annotated synchrony lattice structures for connected three-cell networks with asymmetric inputs where υ denotes the valency eigenvalue and µ, µ 1 , µ 2 denote the other network eigenvalues.The defective eigenvalues are marked as µ * . .

4. 3 .
Bifurcation diagrams.The results obtained in Section 3 combined with the possible synchrony lattice structures described in Theorem 4.5 above are now applied to connected networks with three-cells and asymmetric inputs.Concretely, we take each of the synchrony lattice structures and prove which network synchrony subspaces support a bifurcation branch of steady-state solutions when a network eigenvalue crosses zero.This information is collected into a bifurcation diagram.Remarkably, we get that each of the synchrony lattice structures presented in Theorem 4.5 has a distinct bifurcation diagram.

Figure 4 .
Figure 4. Bifurcation diagrams displaying the synchrony of bifurcation branches of steady-state solutions emerging from bifurcation problems with the mention bifurcation condition.Here, ∆ 0 denotes the full-synchrony subspace and ∆ 1 , ∆ 2 , ∆ 3 denote two-dimensional synchrony subspaces.Also, υ is the valency eigenvalue, and µ, µ 1 , µ 2 are other network eigenvalues.It does not display the stability, growth-rate nor the number of branches.

Table 5 .
Minimal three-cell networks with two asymmetric inputs and one 2D synchrony subspace.complex numbers or not.Combining this study about network eigenvalues and the number of two-dimensional network synchrony subspaces given in Theorem 5.1, we list the annotated network synchrony lattices.Finally, we use the results obtained in