English
Related papers

Related papers: A note on Hilbert 16th Problem

200 papers

Lienard systems are very important mathematical models describing oscillatory processes arising in applied sciences. In this paper, we study polynomial Lienard systems of arbitrary degree on the plane, and develop a new method to obtain a…

Classical Analysis and ODEs · Mathematics 2011-09-30 Maoan Han , Valery G. Romanovski

The present paper is devoted to the study of the maximum number of limit cycles bifurcated from the periodic orbits of the quadratic isochronous center $\dot{x}=-y+\frac{16}{3}x^{2}-\frac{4}{3}y^{2},\dot{y}=x+\frac{8}{3}xy$ by the averaging…

Classical Analysis and ODEs · Mathematics 2016-09-27 Xiuli Cen , Shimin Li , Yulin Zhao

We give an effective method for controlling the maximum number of limit cycles of some planar polynomial systems. It is based on a suitable choice of a Dulac function and the application of the well-known Bendixson-Dulac Criterion for…

Dynamical Systems · Mathematics 2008-03-17 Armengol Gasull , Hector Giacomini

It is well known that linear vector fields defined in $\mathbb{R}^n$ can not have limit cycles, but this is not the case for linear vector fields defined in other manifolds. We study the existence of limit cycles bifurcating from a…

Dynamical Systems · Mathematics 2023-07-26 Clara Cufí-Cabré , Jaume Llibre

We consider a system of the form x'=P_n(x,y)+xR_m(x,y), y'=Q_n(x,y)+yR_m(x,y), where P_n(x,y), Q_n(x,y) and R_m(x,y) are homogeneous polynomials of degrees n, n and m, respectively, with n<=m. We prove that this system has at most one limit…

Classical Analysis and ODEs · Mathematics 2007-05-23 Armengol Gasull , Hector Giacomini , Joan Torregrosa

We extend to the $n$-dimensional ellipsoid contained in $\R^{n+1},$ the Darboux theory of integrability for polynomial vector fields in the $n$-dimensional sphere (Llibre et al., 2018). New results on the maximum number of invariant…

Dynamical Systems · Mathematics 2024-10-30 J. Llibre , Adrian C. Murza

We show that for any set of n distinct points in the complex plane, there exists a polynomial p of degree at most n+1 so that the corresponding Newton map, or even the relaxed Newton map, for p has the given points as a super-attracting…

Dynamical Systems · Mathematics 2012-08-29 James T. Campbell , Jared T. Collins

In this work we consider families of smooth vector fields having a persistent polycycle with $n$ hyperbolic saddles. We derive the asymptotic expansion of the return map associated to the polycycle, determining explicitly its leading terms.…

Dynamical Systems · Mathematics 2025-12-16 Lucas Queiroz Arakaki , Paulo Santana

In the language of hypergraphs, our main result is a Dirac-type bound: we prove that every $3$-connected hypergraph $H$ with $ \delta(H)\geq \max\{|V(H)|, \frac{|E(H)|+10}{4}\}$ has a hamiltonian Berge cycle. This is sharp and refines a…

Combinatorics · Mathematics 2020-04-20 Alexandr Kostochka , Mikhail Lavrov , Ruth Luo , Dara Zirlin

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…

Combinatorics · Mathematics 2020-03-24 Michael Wigal , Xingxing Yu

Finding the maximum number of induced cycles of length $k$ in a graph on $n$ vertices has been one of the most intriguing open problems of Extremal Graph Theory. Recently Balogh, Hu, Lidick\'{y} and Pfender answered the question in the case…

Combinatorics · Mathematics 2021-09-09 Debarun Ghosh , Ervin Győri , Oliver Janzer , Addisu Paulos , Nika Salia , Oscar Zamora

We analyze the dynamics of a class of $\mathbb{Z}_{2n}$-equivariant differential equations on the plane, depending on 4 real parameters. This study is the generalisation to $\mathbb{Z}_{2n}$ of previous works with $\mathbb{Z}_4$ and…

Dynamical Systems · Mathematics 2016-05-13 Isabel S. Labouriau , Adrian C. Murza

We study the number of limit cycles and the bifurcation diagram in the Poincar\'{e} sphere of a one-parameter family of planar differential equations of degree five $\dot {\bf x}=X_b({\bf x})$ which has been already considered in previous…

Dynamical Systems · Mathematics 2012-02-10 J. D. García-Saldaña , A. Gasull , H. Giacomini

${ NP}$-complete problem "Hamiltonian cycle"\ for graph $G=(V,E)$ is extended to the "Hamiltonian Complement of the Graph"\ problem of finding the minimal cardinality set $H$ containing additional edges so that graph $G=(V,E\cup H)$ is…

Computational Complexity · Computer Science 2018-08-27 Anatoly Panyukov

The already proved Lum-Chua's conjecture says that a continuous planar piecewise linear differential system with two zones separated by a straight line has at most one limit cycle. In this paper, we provide a new proof by using a novel…

Dynamical Systems · Mathematics 2021-01-21 Victoriano Carmona , Fernando Fernández-Sánchez , Douglas D. Novaes

Our main goal in this paper is to study the number of small-amplitude isolated periodic orbits, so-called limit cycles, surrounding only one equilibrium point a class of polynomial Kolmogorov systems. We denote by $\mathcal M_{K}(n)$ the…

Dynamical Systems · Mathematics 2023-04-12 Yagor Romano Carvalho , Leonardo P. C. Da Cruz , Luiz F. S. Gouveia

The $\textit{planar Tur\'an number}$ $\textrm{ex}_{\mathcal P}(n,H)$ of a graph $H$ is the maximum number of edges in an $n$-vertex planar graph without $H$ as a subgraph. Let $C_{\ell}$ denote the cycle of length $\ell$. The planar Tur\'an…

Combinatorics · Mathematics 2023-06-26 Ruilin Shi , Zach Walsh , Xingxing Yu

Let $x'=S(t,x)$ be a differential equation in the cylinder, linear piecewise in $x$ and with trigonometric coefficients in $t$. In this paper, we provide an upper bound on the number of limit cycles in terms of the number of regions of the…

Classical Analysis and ODEs · Mathematics 2026-05-08 J. L. Bravo , R. Trinidad-Forte

Fix $k \ge 2$ and let $H$ be a graph with $\chi(H) = k+1$ containing a critical edge. We show that for sufficiently large $n$, the unique $n$-vertex $H$-free graph containing the maximum number of cycles is $T_k(n)$. This resolves both a…

Combinatorics · Mathematics 2020-03-20 Natasha Morrison , Alexander Roberts , Alex Scott

The cycle set of a graph $G$ is the set consisting of all sizes of cycles in $G$. Answering a conjecture of Erd\H{o}s and Faudree, Verstra\"{e}te showed that there are at most $2^{n - n^{1/10}}$ different cycle sets of graphs with $n$…

Combinatorics · Mathematics 2025-09-23 Rajko Nenadov