On the nodal structure of nonlinear stationary waves on star graphs

We consider stationary waves on nonlinear quantum star graphs, i.e. solutions to the stationary (cubic) nonlinear Schr\"odinger equation on a metric star graph with Kirchhoff matching conditions at the centre. We prove the existence of solutions that vanish at the centre of the star and classify them according to the nodal structure on each edge (i.e. the number of nodal domains or nodal points that the solution has on each edge). We discuss the relevance of these solutions in more applied settings as starting points for numerical calculations of spectral curves and put our results into the wider context of nodal counting such as the classic Sturm oscillation theorem.


Introduction
Sturm's oscillation theorem [1] is a classic example for how solutions of linear self-adjoint differential eigenvalue problems Dφ(x) = λφ(x) (where D is a Sturm-Liouville operator) are ordered and classified by the number of nodal points. According to Sturm's oscillation theorem, the n-th eigenfunction, φ n , has n − 1 nodal points, when the eigenfunctions are ordered by increasing order of their corresponding eigenvalues λ 1 < λ 2 < λ 3 < . . . . Equivalently, the number ν n of nodal domains (the connected domains where φ n has the same sign) obeys ν n = n for all n.
In higher dimensions, (e.g., for the free Schrödinger equation −∆φ(x) = λφ(x) on a bounded domain with self-adjoint boundary conditions) the number of nodal domains is bounded from above, ν n ≤ n, by Courant's theorem [2] (see [3] for the case of Schrödinger equation with potential). Furthermore, there is only a finite number of Courant sharp eigenfunctions for which ν n = n, as was shown by Pleijel [4].
In (linear) quantum graph theory one considers the Schrödinger equation with selfadjoint matching conditions at the vertices of a metric graph. Locally, graphs are onedimensional though the connectivity of the graph allows to mimic some features of higher dimensions. Nodal counts for quantum graphs have been considered for more than a decade [5]. For example, it has been shown in [5] that Courant's bound applies to quantum graphs as well. Yet, for graphs there are generically infinitely many Courant sharp eigenfunctions [7,6]. For tree graphs it has been proven that all generic eigenfunctions are Courant sharp, i.e., ν n = n [8,9] . In other words, Sturm's oscillation theorem generalizes to metric trees graphs. It has been proven by one of us that the converse also holds, namely that if the graph's nodal count obeys ν n = n for all n, then this graph is a tree [10]. When a graph is not a tree, its first Betti number, β := E − V + 1 is positive.
Here, E, V are correspondingly the numbers of graph's edges and vertices and β indicates the number of the graphs independent cycles. In addition to Courant's bound, the nodal count of a graph is bounded from below, ν n ≤ n − β as was shown first in [11]. The actual number of nodal domains may be characterized by various variational methods [12,13]. Some statistical properties of the nodal count are also known [6], but to date there is no general explicit formula or a full statistical description of the nodal count.
In the present work we present some related results concerning nodal points and nodal domains for nonlinear star graphs (see Figure 1.1). Nonlinear wave equations on metric graphs (i.e., nonlinear quantum graphs) have recently attracted considerable interest both from the mathematical perspective and the applied regime. They allow the study of intricate interplay between the non-trivial connectivity and the nonlinearity. Among the physical applications of nonlinear wave equations on metric graphs is light transmission through a network of optical fibres or Bose-Einstein condensates in quasi one-dimensional traps. We refer to [14,15] where a detailed overview of the recent literature and some applications is given and just summarise here the relevant work related to the nodal counting. In a previous work some of us have shown that Sturm's oscillation theorem is generically broken for nonlinear quantum stars, apart from the special case of an interval [16]. This is not unexpected as the set of solutions is known to have a far more complex structure. Our main result here is that the nonlinear case of a metric star allows for solutions with any given number of nodal domains on each edge. Namely, for a star with E edges and a certain E-tuple, (n 1 , . . . , n E ) of non-negative integers there are solutions with n e nodal points on the e-th edge for e = 1, . . . , E.
In the remainder of the introduction chapter we define the setting. In Section 2 we state our main results. In Section 3 we present the nonlinear generalization of Sturm's oscillation theorem to an interval, some general background and properties of nonlinear solutions as well as a few motivating numerical results. In Section 4 we prove the main theorems and afterwards in Section 5 we discuss our results and their possible implications in the broader context of nonlinear quantum graphs.
1.1. The Setting-Nonlinear Star Graphs. Metric star graphs are a special class of metric trees with E edges and E + 1 vertices such that all edges are incident to one common vertex (see Figure 1.1). The common vertex will be called the centre of the star and the other vertices will be called the boundary. We assume that each edge has a finite length 0 < e < ∞ (e = 1, . . . , E) and a coordinate x e ∈ [0, e ] such that x e = 0 at the centre and x e = e at the boundary. On each edge e = 1, . . . , E we consider the stationary nonlinear Schrödinger (NLS) equation for φ e : [0, e ] → C. Here g is a nonlinear coupling parameter and µ a spectral parameter. We consider this as a generalized eigenequation with eigenvalues µ. We have assumed here that the nonlinear interaction is homogeneously repulsive (g > 0) or attractive (g < 0) on all edges and will continue to do so throughout this manuscript. One may consider more general graphs where g takes different values (and different signs) on different edges (or even where g → g e (x e ) is a real scalar function on the graph). It is not, however, our aim to be as general as possible. In the following we restrict ourselves to one generic setting in order to keep the notation and discussion as clear and short as possible. We will later discuss some straightforward generalizations of our results. At the centre we prescribe Kirchhoff (a.k.a Neumann) matching conditions and at the boundary we prescribe Dirichlet conditions φ e ( e ) = 0. For the coupling constant g it is sufficient without loss of generality to consider three different cases. For g = 0 one recovers the linear Schrödinger equation and thus standard quantum star graphs. For g = 1 one has a nonlinear quantum star graph with repulsive interaction and for g = −1 one has a nonlinear quantum star with attractive interaction. If g takes any other non-zero value a simple rescaling φ e (x e ) → 1 √ |g| φ e (x e ) of the wavefunction is equivalent to replacing g → g |g| = ±1. Without loss of generality we may focus on real-valued and twice differentiable solutions {φ e (x e )} E e=1 , where twice differentiable refers separately to each φ e : (0, e ) → C. We also assume that the solution is not the constant zero function on the graph, namely that there is an edge e and some pointx e ∈ [0, e ] with φ e (x e ) = 0. Moreover, any complexvalued solution is related to a real-valued solution by a global gauge-transformation (i.e., a change of phase φ e (x e ) → φ e (x e )e iα ) [14].
1.2. The Nodal Structure. We will call a solution {φ e (x e )} N e=1 regular if the wavefunction does not vanish on any edge, that is for each edge e there isx e ∈ (0, e ) with φ e (x e ) = 0. Accordingly, non-regular solutions vanish identically on some edges, in other words there is (at least) one edge e such that φ e (x e ) = 0 for all x e ∈ [0, e ].
A solution with a node at the centre, φ e (0) = 0 (by continuity this is either true for all e or for none) will be called central Dirichlet because it satisfies Dirichlet conditions at the centre (in addition to the Kirchhoff condition). Hence, non-regular solutions are always central Dirichlet. Our main theorem will construct solutions which are regular and central Dirichlet. Note that from a regular central Dirichlet solution on a metric star graph G one can construct non-regular solutions on a larger metric star graph G , if G is a metric subgraph of G : on each edge e ∈ G \ G one may just extend the solution by setting φ e (x e ) = 0 for all x e ∈ [0, e ].
Our main aim is to characterize solutions in terms of their nodal structure. The nodal structure is described in terms of either the number ν of nodal domains (maximal connected subgraphs where φ e (x e ) = 0) or by the number ξ of nodal points. We will include in the count the trivial nodal points at the boundary. Note that regular solutions which are not central Dirichlet obey ν = ξ + 1 − E while regular central Dirichlet solutions obey ν = ξ − 1. We have stated in the introduction that in the linear case, g = 0, such a characterization is very well understood even for the more general tree graphs, which obey a generalized version of Sturm's oscillation theorem.
As we will see, the solutions of nonlinear star graphs have a very rich structure and a classification of solutions in terms of the total numbers ν or ξ of nodal domains or nodal points is far from being unique. We will thus use a more detailed description of the nodal structure of the solutions. To each regular solution {φ e (x e )} E e=1 we associate the E-tuple where n e ≥ 1 is the number of nodal domains of the wavefunction φ e (x e ) on the edge x e ∈ [0, E ]. For solutions which are not central Dirichlet, n e also equals the number of nodal points of φ e (x e ) (including the nodal point at the boundary). We will call n ∈ N E the (regular) nodal edge count structure of the (regular) solution {φ e (x e )} N e=1 . For nonregular solutions one may characterize the nodal structure in a similar way by formally setting n e = ∞ for all edges where the wavefunction is identical zero. In that case we speak of a non-regular nodal edge count structure. Note that we do not claim that the nodal edge count structure, n, leads to a unique characterization of the solutions (which actually come in one-parameter families). Indeed we have numerical counter-examples. With this more detailed description we show that a much larger set of nodal structures is possible in nonlinear quantum star graphs compared to the linear case, as is stated in the next section.

Statement of Main Theorems
Our main results concern the existence of solutions with any given nodal edge structure. We state two theorems: One for repulsive nonlinear interaction g = 1 and one for attractive nonlinear interaction g = −1. The two theorems establish the existence of central Dirichlet solutions with nodal edge structure n = (1, . . . , 1) subject to (achievable) conditions on the edge lengths. As corollaries, we get the existence of central Dirichlet solutions with any prescribed values of n (again subject to some achievable conditions on the lengths). Throughout this section we consider a nonlinear quantum star graph as described in Section 1.1. In order to avoid trivial special cases we will assume E ≥ 3. Indeed, E = 1 is the interval and well understood and E = 2 reduces to an interval (of total length 1 + 2 ) as the Kirchhoff vertex condition in this case just states that the wavefunction is continuous and has a continuous first derivative. We will also assume that all edge lengths are different. Without loss of generality we take them as ordered e < e+1 (e = 1, . . . , E − 1). Theorem 2.1. If g = 1 (repulsive case) and either (1) the number of edges E is odd, or (2) E is even and

1)
where 0 < m − < m + < 1 are implicitly defined in terms of the edge lengths l 1 , lE 2 +1 , lE 2 +2 by → 1 one has m − → 0 and the left-hand side of condition (2.1) grows without any bound). Figure 2.1 shows a graph of the regions where the two length ratios satisfy condition (2.1) for star graphs with E edges. One can see how the condition becomes less restrictive when the number of edges is large. We will present the proof of Theorem 2.1 in Section 4.1. The proof shows that the condition (2.1) is not optimal. Less restrictive conditions that depend on other edge lengths may be stated. Nevertheless, we have chosen to state the condition (2.1), as its form is probably more compactly phrased than other conditions would be.
such that there is exactly one nodal domain on each edge, i.e., the nodal edge structure n satisfies n e = 1 for all edges e.
We will prove this theorem in Section 4.2. One may extend Theorem 2.2 to find negative values of the spectral parameter µ < 0 under appropriate conditions on edge lengths using similar ideas as the ones used in our proof for µ > 0. To keep the paper concise we focus here on µ > 0. then perturbs all edge lengths slightly to make them different then condition (2.5) is satisfied. Note however that, just as in Theorem 2.1, even the condition which is stated in Theorem 2.2 is not optimal and more detailed conditions can be derived from our proof in Section 4.2.
Before discussing some straight-forward implications let us also state here that the assumption that all edge lengths are different that we made for both Theorems 2.1 and 2.2 may be relaxed. This is because any two edges with the same length decouple in a certain way from the remaining graph. If one deletes pairs of edges of equal length from the graph until all edges in the remaining graph are different one may apply the theorems to the remaining graph (if the remaining graph has at least three edges). This will be discussed more in Remark 4.1.
In the remainder of this section we discuss the implications of the two theorems for finding solutions with a given nodal edge structure n ∈ N E . In this case we divide each edge length into n e fractions e = n e˜ e . The n-th fraction˜ e then corresponds to the length of one nodal domain. For the rest of this section we do not assume that the edge lengths { e } are ordered by length and different, rather we now assume that these assumptions apply to the fractions, i.e.,˜ e <˜ e+1 (e = 1, . . . , E −1). By first considering the metrically smaller star graph with edge lengths {˜ e } Theorems 2.1 and 2.2 establish the existence of solutions on this smaller graph subject to conditions on the lengths {˜ e }. These solutions can be extended straight-forwardly to a solution on the full star graph. Indeed, as we explain in more detail in Section 3.1, the solution on each edge is a naturally periodic function given by an elliptic deformation of a sine and shares the same symmetry around nodes and extrema, as the sine function. The main relevant difference to a sine is that the period of the solution depends on the amplitude. In the repulsive case one then obtains the following. Corollary 2.3. Let g = 1 (repulsive case) and n ∈ N E . If either (1) E is odd, or (2) E is even and the fractions˜ e = e /n e (e = 1, . . . , E) satisfy the condition (2.1), then there exists a regular central Dirichlet solution for some positive value of the spectral parameter µ = k 2 > π 2 2 1 'with regular nodal edge count structure n.
Similarly, Theorem 2.2 implies the following.
Corollary 2.4. Let g = −1 (attractive case) and n ∈ N E . If the fractions˜ e = e /n e satisfy condition (2.4) then there exists a regular central Dirichlet solution for some positive value of the spectral parameter µ = k 2 ∈ 0, π 2 2 E with regular nodal edge count structure n.
The corollaries above provide sufficient conditions for the existence of a central Dirichlet solution with a particular given nodal edge count. In addition to that, it is straightforward to apply Theorems 2.1 and 2.2 to show that for any choice of edge lengths there are infinitely many E-tuples which can serve as the graph's regular central Dirichlet nodal structure.
Moreover Theorems 2.1 and 2.2 also imply infinitely many values for non-regular nodal structures, as every non-regular solution is equivalent to a regular solution on a subgraph.
Finally, we note that the proofs of Theorems 2.1 and 2.2 in Section 4 are constructive and they specify the corresponding solution up to a single parameter (which one may take to be k = √ µ) that may easily be found numerically.

General Background on the Solutions of Nonlinear Quantum Star Graphs
Before we turn to the proof of Theorems 2.1 and 2.2 we would like discuss how the implied regular central Dirichlet solutions are related to the complete set of solutions of the nonlinear star graph. Though we are far from having a full understanding of all solutions we can give a heuristic picture.
3.1. The Nonlinear Interval -Solutions and Spectral Curves. Let us start with giving a complete overview of the solutions for the interval (i.e., the star graph with E = 1). While these are well known and understood they play a central part in the construction of central Dirichlet solutions for star graphs in our later proof and serve as a good way to introduce some general background. On the half line x ≥ 0 with a Dirichlet condition φ(0) = 0 at the origin it is straight-forward to check (see also [14]) that the solutions for positive spectral parameters µ = k 2 (where k > 0) are of the form Here sn(y, m) and dn(y, m) are Jacobi elliptic functions with a deformation parameter m. The definition of elliptic functions allows m to take arbitrary values in the interval m ∈ [0, 1] (as there are many conventions for these functions we summarize ours in Appendix A). Note that sn(y, m) is a deformed variant of the sine function and sn(y, 0) = sin(y) and dn(y, 0) = 1. For any spectral parameter µ = k 2 there is a one-parameter family of solutions parameterised by the deformation parameter m. In the repulsive case the deformation parameter may take values m ∈ (0, 1] (as for m = 0 one obtains the trivial solution χ (+) 0,k (x) = 0) and in the attractive case m ∈ 0, 1 2 (the expressions are not well defined for m = 1 2 and for m > 1 2 the expressions are no longer real). Let us now summarise some properties of these solutions in the following proposition for the solutions of the NLS equation on the half line.

2)
where K(m) is the complete elliptic integral of first kind, Equation (2.3).
(2) For m → 0 one regains the standard relation Λ (±) (0, k) = 2π k for the free linear Schrödinger equation. In the repulsive case Λ (+) (m, k) is an increasing function of m (at fixed k) that increases without bound as m → 1. In the attractive case The nodal points are separated by half the nonlinear wavelength. Namely, χ The solutions are anti-symmetric around each nodal point and symmetric around each extremum, i.e., it has the same symmetry properties as a sine function.
is given by As m → 0 + the amplitude of the solutions also decreases to zero A (±) (0, k) = 0 for both the repulsive and the attractive case. In this case the effective strength of the nonlinear interaction becomes weaker and the oscillations are closer. In the repulsive case the amplitude remains bounded as m → 1 with A (+) (1, k) = k. In the attractive case A (−) (m, k) grows without bound as m → 1 2 . All statements in this proposition follow straight-forwardly from the known properties of elliptic integrals and elliptic functions and we thus omit the proof here. Furthermore, some of the statements in the proposition are mentioned explicitly in [16,14,17] and others follow easily from the definitions as given in the Appendix A.
For the NLS equation for φ(x) on an interval x ∈ [0, ] with Dirichlet conditions at both boundaries φ(0) = φ( ) = 0 one obtains a full set of solutions straight-forwardly from the solutions χ (±) m,k (x) on the half-line by requiring that there is a nodal point at x = . Since the distance between two nodal points in χ (±) m,k (x) is Λ (±) (k, m)/2 the length of the interval has to be an integer multiple of half the nonlinear wavelength where the positive integer n is the number of nodal domains. We arrive at the following proposition. n, (k)) as spectral curves. As k n, (m), the spectral curves never cross (see Figure 3.1) and we obtain the first nonlinear generalization of Sturm's oscillation theorem as a corollary (see also Theorem 2.4 in [16]).  While this is mathematically sound, fixing the deformation parameter m is not a very useful approach in an applied setting. A more physical approach (and one that is useful when we consider star graphs) is to fix the L 2 -norm N By direct calculation (see [15]) we express the L 2 -norms in terms of elliptic integrals (see Appendix A) as and use those to implicitly define the spectral curves in the form k A characterization of the spectral curves k (±) n, (N ) may be given as follows. We define the following flow in the k-N -plane (see Figure 3.2).
τ, (m)), (3.8) where N n, (N ) in the order given by the number of nodal domains n. This implies that the spectral curves never cross each other and remain properly ordered. We thus obtain the following second generalization of Sturm's oscillation theorem on the interval.

).
Then there is a discrete set {k n } ∞ n=1 of positive real numbers, increasingly ordered such that is a solution of the NLS equation on the interval with a spectral parameter µ n = k 2 n and L 2 -norm N = 0 φ n (x) 2 dx and n is the number of nodal domains. Furthermore, these are all solutions whose L 2 -norm equals N . each solution may be characterized by a pair (k, N ) and as k is varied one naturally arrives at spectral curves in the k-N -plane, that may be expressed as k(N ) (or N (k)), as we have seen for the interval in the previous section. Nevertheless, the spectral curves of the star graph have a more intricate structure (see Figure 3.3). In non-linear algebraic equations one generally expects that solutions appear or disappear in bifurcations. For any particular example some numerical approach is needed to find the spectral curves.

Nonlinear Quantum Star Graphs. One may use the functions χ
To do so, one first needs to have some approximate solution (either found by analytical approximation or by a numerical search in the parameter space). After that Newton-Raphson methods may be used to find the solution up to the desired numerical accuracy and the spectral curves are found by varying the spectral parameter slowly. Figure 3.3 shows spectral curves that have been found numerically for a star graph with E = 3 and edge lengths e = √ e (e = 1, 2, 3). Most of the curves have been found starting from the corresponding spectrum of the linear problem (g = 0). Yet, one can see an additional curve that does not connect to the linear spectrum as N → 0. This has originally been found in previous work [15] by coincidence, as the the numerical method jumped from one curve to another where they almost touch in the diagram. We stress that in a numerical approach it is very hard to make sure that all solutions of interest are found, even if one restricts the search to a restricted region in parameter space. A full characterization of all solutions (such as given above for the nonlinear interval) will generally be elusive even for basic nonlinear quantum graphs. Theorems 2.1 and 2.2 and the related Corollaries 2.3 and 2.4 establish the existence of a large set of solutions inside the deep nonlinear regime. Each of these solutions may be used as a starting point for a numerical calculation of further solutions along the corresponding spectral curves.

Nodal Edge Counting and Central Dirichlet Solutions.
It is interesting to consider the nodal structure along a spectral curve. Generically the wavefunction does not vanish at the centre and the nodal edge count structure (i.e., the vector n) remains constant along the curve. The existence of central Dirichlet solutions implies that nodal points may move into (and through) the centre along a spectral curve (see also Theorem 2.9, [16, ]). At this instance the nodal edge count structure changes twice; first when the node hits the centre and then again when it has moved through. If n 0 is the nodal edge count structure at a central Dirichlet solution, then generically the value of the function at the centre will change its sign along the spectral curve close to the central Dirichlet solution. If n < and n > are the nodal edge count structures close to the central Dirichlet solution then their entries differ at most by one n >,e − n <,e = ±1 and when the nodal point hits the centre one has n o,e = min(n >,e , n <,e ). This is shown in more detail for a numerical example in Figure 3 For N → 0 one obtains the spectrum of the corresponding linear star graph. Apart from one curve, all shown curves are connected to the linear spectrum this way. In the attractive case one spectral curve (shown in blue) is not connected to the linear spectrum. Such curves can sometimes be found by coincidence, e.g., if one is close to a bifurcation and numerical inaccuracy allows to jump from one solution branch to another (and this is indeed how we found it). In the repulsive case there is one spectral curve that has a sharp cusp. This indicates that there may be a bifurcation nearby that has additional solution branches that have not been found. In general it is a non-trivial numerical task to ensure that a diagram of spectral curves is complete. Here, completeness has not been attempted as the picture serves a mainly illustrative purpose.

Proofs of Main Theorems
We prove the two theorems for repulsive and attractive interaction separately. The main construction is however the same. We start by describing the idea behind the construction and then turn to the actual proofs. Let m (±) 1, e (k) be the functions describing the deformation parameter of solutions on the interval of length with Dirichlet boundary conditions and a single nodal domain (they are given as the inverse of Equation (3.5); see also the lowest curve in Figure 3.1). Those functions are well-defined for k > π e in the repulsive case and for k < π e in the attractive case. Using these, we define for e = 1, . . . , E, and where σ e = ±1 are signs that will be specified later. These are of course just the solutions of the NLS with one nodal domain on the corresponding interval at spectral parameter µ = k 2 . In order to ensure that this function is well defined on all edges at given k we have to choose k ∈ ( π 1 , ∞) in the repulsive case and k ∈ (0, π E ) in the attractive case (recall that we ordered the edge lengths by 1 < . . . < E ).
As φ e (0) = 0 by construction, the set {φ e } E e=1 defines a continuous function on the graph including the centre for all allowed values of k. However, in general, these functions do not satisfy the remaining Kirchhoff condition E e=1 dφe dxe (0) = 0. The idea of the proofs is the following. We consider E e=1 dφe dxe (0) as a function of k and need to show that it vanishes at some k = k 0 . We find a particular set of signs {σ e } for which it is easy to show that E e=1 dφe dxe (0) changes sign as k is varied within its allowed range. Since this function is continuous in k it must vanish somewhere, which establishes the required central Dirichlet solution with exactly one nodal domain on each edge.
As we recognized above the role which the derivative of the solution plays in the proof, let us now directly calculate it. In particular, expressing the derivative as a function of m and k and multiplying by a factor 1 √ 2k 2 , we see that the resulting function θ (±) (m) does not depend explicitly on k, but only via the deformation parameter, m.
Remark 4.1. In the statement of the theorem we have assumed that all edge lengths are different and stated how this may be relaxed in a subsequent remark. We can explain this now in more detail. Assume that we have two edge lengths that coincide. Denote those edges by e 0 , e 1 and follow the construction above. By choosing opposite sign for the two edges σ e 0 = σ e 1 the contribution of the two edges to the sum of derivatives E e=1 dφe dxe (0) cancels exactly for all allowed values of k, that is dφe 0 dxe 0 (0) + dφe 1 dxe 1 (0) = 0. One may then focus on the subgraph where the two edges are deleted and continue to construct a solution on the subgraph. One may also start with a graph with different edge lengths. If one has found any regular central Dirichlet solution on the graph one may add as many pairs of edges of the same length and find a regular non-Dirichlet solution on the larger graph following the above construction.
Proof of Theorem 2.1. Using the construction defined above we have to establish that there is a choice for the signs σ = (σ 1 , . . . , σ E ) and value for the spectral parameter k = √ µ such that the Kirchhoff condition ∞  For an even number of edges E = 2M (M ≥ 2) one needs to do a little bit more work. In this case, there are two strategies for choosing signs, σ = (σ 1 , . . . , σ E ), and showing that f σ (k) vanishes for some k.
(1) One may choose more negative signs than positive signs so that e σ e < 0. Then lim k→∞ f σ (k) = 1 2 E e=1 σ e is trivially negative. The difficulty here is in showing that such a choice is consistent with f σ π 1 > 0. This generally leads to some conditions which the edge lengths should satisfy.
(2) One may choose as many positive as negative signs, which makes it easier to satisfy f σ π 1 > 0 (i.e., the conditions on the edge lengths are less restrictive). Yet, the difficulty here lies in lim k→∞ f σ (k) = 0, which means that one needs to show that this limit is approached from the negative side (i.e., find the conditions on the edge lengths which ensures this).
These two strategies give some indication on how our proof may be generalized beyond the stated length restrictions. Moreover, they also give a practical instruction for how one may search for further solutions numerically.
We continue the proof by following the second strategy and setting σ e = 1 for e = 1 and e ≥ M + 2, −1 for 2 ≤ e ≤ M + 1 (4.10) so that E e=1 σ e = 0. One then has lim k→∞ f σ (k) = 0 and we will show that the leading term in the (convergent) asymptotic expansion of f σ (k) for large k is negative. Using the known asymptotics [17] of the elliptic integral K(m) as m = 1 − δm goes to one (or δm → 0) one may invert Equation (4.4) asymptotically for large k as 1, e (k) 1, e (k) (4.13) This directly leads to the asymptotic expansion which is negative for sufficiently large k because 1 is the shortest edge length. It is left to show f σ Proof of Theorem 2.2. In the attractive case we can start similarly to the previous proof by rewriting the Kirchhoff condition on the sum of derivatives as f σ (k) = 0 for some  and the right inequality of (2.4) directly implies that f σ (0) < 0. In order to prove the existence of the solution stated in Theorem 2.2, it is left to show that f σ π E > 0, which would imply that f σ vanishes for some k ∈ (0, π E ). Using our choice of signs and the identity m

Conclusions
We have established the existence of solutions of the stationary nonlinear Schrödinger equation on metric star graphs with a nodal point at the centre. The existence is subject to certain conditions on the edge lengths that can be satisfied for any numbers of edges E ≥ 3. We stress that some of these solutions are deep in the nonlinear regime where finding any solutions is quite non-trivial. Let us elaborate on that. The non-linear solutions come in one-parameter families, and a possible way to track those families (or curves) is to start from the solutions of the corresponding linear Schrödinger equation. Indeed, since the linear solutions are good approximations for the nonlinear solutions with low intensities they may be used as starting points for finding nonlinear solutions numerically. By slowly changing parameters one may then find some spectral curves that extend into the deep nonlinear regime. However, there may be many solutions on spectral curves that do not extend to arbitrary small intensities and these are are much harder to find numerically. By focusing on solutions which vanish at the centre our work shows how to construct such solutions. These may then be used in a numerical approach to give a more complete picture of spectral curves.
The solutions that we construct are characterised by their nodal count structure. The nodal structure on a spectral curve is constant as long as the corresponding solutions do not vanish at the centre. Our approach thus constructs the solutions where the nodal structure changes along the corresponding spectral curve. In this way we have made some progress in characterizing general solutions on star graphs in terms of their nodal structure.
Many open questions remain. The main one being whether all spectral curves of the NLS equation on a star graph may be found just by combining the linear solutions with the non-linear solutions which vanish at the centre. If not, how many other spectral curves remain and how can they be characterized? Numerically we found that apart from the ground state spectral curve it is generic for a spectral curve to have at least one point where the corresponding solution vanishes at the centre. Of course this leaves open how many spectral curves there are where the corresponding solutions never vanishes at the centre. Another interesting line of future research may be to extend some of our results to tree graphs.