- The paper confirms the lower bounds (n for fold points, 2n for jump points, and n+m for mixed) of the maximum number of limit cycles of piecewise linear Liénard systems, as predicted by Tonnelier's conjecture (2002).
- The authors provide explicit constructions verifying these lower bounds, and a classification of all possible dynamics near infinity on the Poincaré disc, crucial for bounding the number of limit cycles.
- For configurations where $F(x)$ is symmetric but only outside a switching line, or where parameters shift the slopes, boundedness near infinity and accordingly cycle stability remain unresolved.
Overview
The paper studies the planar Liénard system x˙=F(x)−y, y˙=x, where F(x) is piecewise linear on n+1 intervals, written in the unified form
F(x)=ax+b+i=1∑nai∣x−xi∣+i=1∑nbisgn(x−xi),
with switching lines Li:x=xi. A point on a switching line is a fold point when F is continuous but its one-sided derivatives differ (bi=0, ai=0), and a jump point when F is discontinuous (y˙=x0). Tonnelier conjectured in 2002 that the maximum number of limit cycles is y˙=x1 when y˙=x2 has only fold points and y˙=x3 when it has only jump points. Prior to this work the conjecture was verified only for y˙=x4 in the fold case (2608.19542) and for y˙=x5 in the jump case; all other cases were open. The paper establishes two main contributions: (i) confirmation of the lower bound part of Tonnelier's conjecture for all y˙=x6, via explicit constructions, and (ii) a complete classification of the dynamics near infinity of these systems on the Poincaré disc.
Dynamics near infinity
The authors first settle the qualitative behavior near infinity using Poincaré compactification. Under the transformations y˙=x7 with y˙=x8, equilibria at infinity correspond to real roots of y˙=x9 (right half-plane) and F(x)0 type equations (left half-plane), where
F(x)1
are the outermost slopes of F(x)2. The resulting classification is sharp: if F(x)3 there are no equilibria at infinity in the right half-plane, if F(x)4 exactly one (a saddle-node), and if F(x)5 two (a stable node and a saddle); analogously for F(x)6 in the left half-plane. This partitions the parameter space of outermost slope pairs into 15 cases, each associated with an explicitly drawn phase portrait near infinity.
A key structural finding is that, away from a degenerate situation, the behavior at infinity is governed entirely by the pair F(x)7. In case (3c) (F(x)8, F(x)9) there are no equilibria at infinity, and the paper proves that infinity is a center if n+10 for n+11, and otherwise a focus whose stability is determined by the sign of n+12 (and, when n+13, by comparing n+14 and n+15): orbits sufficiently close to infinity are positively bounded if n+16 and negatively bounded if n+17. The proof is by direct comparison of integral curves of n+18 using variation-of-constants estimates.
One limitation is stated plainly: when n+19 holds only for F(x)=ax+b+i=1∑nai∣x−xi∣+i=1∑nbisgn(x−xi),0 but not globally for F(x)=ax+b+i=1∑nai∣x−xi∣+i=1∑nbisgn(x−xi),1, the comparison integral degenerates to a pure exponential whose sign cannot be determined, so boundedness near infinity remains unresolved in that scenario — an open center–focus problem at infinity.
This classification is not merely descriptive: it supplies the outer boundary of Poincaré–Bendixson annular regions used throughout the constructive proofs, since stability at infinity depends only on F(x)=ax+b+i=1∑nai∣x−xi∣+i=1∑nbisgn(x−xi),2 regardless of whether F(x)=ax+b+i=1∑nai∣x−xi∣+i=1∑nbisgn(x−xi),3 lies in cases (3c) or elsewhere.
Lower bounds for the maximum number of limit cycles
The central results are three existence theorems, proved by induction:
- Fold points only (F(x)=ax+b+i=1∑nai∣x−xi∣+i=1∑nbisgn(x−xi),4): a lower bound for the maximum number of limit cycles is F(x)=ax+b+i=1∑nai∣x−xi∣+i=1∑nbisgn(x−xi),5, confirming the lower bound of part (i) of Tonnelier's conjecture.
- Jump points only (F(x)=ax+b+i=1∑nai∣x−xi∣+i=1∑nbisgn(x−xi),6): a lower bound is F(x)=ax+b+i=1∑nai∣x−xi∣+i=1∑nbisgn(x−xi),7, confirming part (ii).
- Mixed case (F(x)=ax+b+i=1∑nai∣x−xi∣+i=1∑nbisgn(x−xi),8 jump points, F(x)=ax+b+i=1∑nai∣x−xi∣+i=1∑nbisgn(x−xi),9 fold points): a lower bound is Li:x=xi0, supporting the authors' proposed Conjecture that this is also the upper bound — a generalization of Tonnelier's conjecture that was previously completely open.
All constructed systems satisfy restrictive structural properties: all switching lines lie in Li:x=xi1, the outermost slope pair belongs to case (3c), and the outermost limit cycle crosses every region. The induction proceeds by appending a new switching line strictly to the right of the current outermost limit cycle, so that the modification leaves all previously constructed cycles untouched.
For a new fold point, the parameter Li:x=xi2 shifts the rightmost slope Li:x=xi3 without changing Li:x=xi4, allowing the authors to flip the sign of Li:x=xi5 and hence reverse the stability of infinity. Together with an inner boundary built from an orbit arc through the point where the new segment meets Li:x=xi6 — across which the vector field has fixed transversality because Li:x=xi7 there — this produces a Poincaré–Bendixson annulus containing a new crossing or grazing cycle. Each fold point thus contributes exactly one additional cycle.
For a new jump point, two cycles arise per step. First, choosing the jump height Li:x=xi8 so that the left and right limits of Li:x=xi9 straddle the orbit arc creates a Filippov sliding segment on F0; closing this arc with the sliding segment yields a sliding limit cycle, shown to be unstable by evaluating F1 along the segment. Second, the annular region between this sliding cycle and the equator (with infinity an unstable focus under property (V)) contains a further crossing cycle. Hence each jump point contributes two additional limit cycles.
The mixed-case theorem combines both mechanisms: starting from a system with F2 jump points and F3 cycles, fold points are appended one at a time, each adding one crossing/grazing cycle while preserving prior ones, yielding F4 cycles. The classification into crossing, sliding, grazing, and composite limit cycles is essential here, since sliding sets exist precisely at jump points.
It should be emphasized that the constructed systems realize the lower bound only; matching upper bounds remain unproved except for F5 (fold) and F6 (jump). Moreover, the authors concede that the imposed arrangement — jump points first, then fold points, all at positive abscissas, with F7 in case (3c) — is sufficient rather than necessary, and that more general arrangements can be handled by their method.
Limitations and open questions
Three gaps are acknowledged within the paper itself. First, the center–focus dichotomy at infinity in case (3c) is incomplete when F8 coincides with its even reflection only outside the outermost switching line; distinguishing center from focus there requires further analysis. Second, the paper establishes lower bounds only; whether the maxima equal F9 (fold-only), bi=00 (jump-only), or bi=01 (mixed) remains unproved for bi=02 and mixed configurations, respectively. Third, the constructions rely on placing every new switch point outside all existing limit cycles and on tuning the stability of infinity via the outermost slopes; whether the same counts are attainable without these structural restrictions is not addressed.
Conclusion
The paper confirms the lower-bound half of Tonnelier's conjecture for piecewise linear Liénard systems with arbitrary numbers of fold and jump points, and extends it to a mixed regime via the sharper statement that bi=03 jump points plus bi=04 fold points yield at least bi=05 limit cycles. Its complete Poincaré-disc classification of the dynamics at infinity — showing that, generically, everything near infinity is dictated by the outermost slopes bi=06 and bi=07 — provides the technical backbone for the constructions. The remaining challenge, left open here, is proving matching upper bounds, i.e., that no system of this class exceeds bi=08 limit cycles.