Related papers: On Periodic Solutions Of Lienard Equations

This paper studies the family of piecewise linear differential systems in the plane with two pieces separated by a cubic curve. By analyzing the obtained first order Melnikov function, we give an upper bound of the number of limit cycles…

Analytical methods are used to prove the existence of a periodic, symmetric solution with singularities in the planar 4-body problem. A numerical calculation and simulation are used to generate the orbit. The analytical method easily…

This paper studies the family of piecewise linear differential systems in the plane with two pieces separated by a switching curve $y=x^{m}$, where $m>1$ is an arbitrary positive. By analysing the first order Melnikov function, we give an…

This paper is concerned with the limit cycles for planar semi-quasi-homogeneous polynomial systems. We give some explicit criteria for the nonexistence and existence of periodic orbits. Let $N=N(p,q,m,n)$ be the maximum number of limit…

We study the following combinatorial problem. Given a planar graph $G=(V,E)$ and a set of simple cycles $\mathcal C$ in $G$, find a planar embedding $\mathcal E$ of $G$ such that the number of cycles in $\mathcal C$ that bound a face in…

We show that the number of integer solutions for a pair of bilinear equations in at least 2*6 variables has (up to logarithms) the expected upper bound unless there is a structural reason why it is not the case.

Hakimi, Schmeichel, and Thomassen in 1979 conjectured that every $4$-connected planar triangulation $G$ on $n$ vertices has at least $2(n-2)(n-4)$ Hamiltonian cycles, with equality if and only if $G$ is a double wheel. In this paper, we…

For planar polynomials systems the existence of an invariant algebraic curve limits the number of limit cycles not contained in this curve. We present a general approach to prove non existence of periodic orbits not contained in this given…

In this note we give a family of planar polynomial differential systems with a prescribed hyperbolic limit cycle. This family constitutes a corrected and wider version of an example given in the work of M.A. Abdelkader entitled ``Relaxation…

Tutte proved that every 4-connected planar graph contains a Hamilton cycle, but there are 3-connected $n$-vertex planar graphs whose longest cycles have length $\Theta(n^{\log_32})$. On the other hand, Jackson and Wormald in 1992 proved…

We use a recently found method to characterise all the invertible fourth-order difference equations linear in the extremal values based on the existence of a discrete Lagrangian. We also give some result on the integrability properties of…

In this paper, we study the existence of limit cycles in continuous and discontinuous planar piecewise linear Hamiltonian differential systems with two or three zones separated by straight lines and such that the linear systems that define…

In recent decades, piecewise linear differential systems have attracted considerable attention due to their ability to describe a wide range of phenomena. A central problem, as in the theory of general planar differential systems, is to…

This paper shows the existence of a periodic orbit with singularity in the symmetric collinear four body problem. In each period of the orbit, there is a binary collision (BC) between the inner two bodies and a simultaneous binary collision…

For $1\le d\le \ell< k$, we give a new lower bound for the minimum $d$-degree threshold that guarantees a Hamilton $\ell$-cycle in $k$-uniform hypergraphs. When $k\ge 4$ and $d< \ell=k-1$, this bound is larger than the conjectured minimum…

We study the function $H_n(C_{2k})$, the maximum number of Hamilton paths such that the union of any pair of them contains $C_{2k}$ as a subgraph. We give upper bounds on this quantity for $k\ge 3$, improving results of Harcos and…

Counting the number of Hamiltonian cycles that are contained in a geometric graph is {\bf \#P}-complete even if the graph is known to be planar \cite{lot:refer}. A relaxation for problems in plane geometric graphs is to allow the geometric…

Hakimi and Schmeichel determined a sharp lower bound for the number of cycles of length 4 in a maximal planar graph with $n$ vertices, $n\geq 5$. It has been shown that the bound is sharp for $n = 5,12$ and $n\geq 14$ vertices. However, the…

In this paper, we extend the slow divergence-integral from slow-fast systems, due to De Maesschalck, Dumortier and Roussarie, to smooth systems that limit onto piecewise smooth ones as $\epsilon\rightarrow 0$. In slow-fast systems, the slow…

We give an explicit upper bound for the number of equivalence classes of binary forms with rational integral coefficients of given degree and given discriminant, and with given splitting field. Further, we give an explicit upper bound for…