Related papers: Li\'{e}nard's system and Smale's problem

We apply the averaging theory of high order for computing the limit cycles of discontinuous piecewise quadratic and cubic polynomial perturbations of a linear center. These discontinuous piecewise differential systems are formed by two…

In recent papers we have introduced a method for the study of limit cycles of the Lienard system: dot{x}=y-F(x), dot{y}=-x, where F(x) is an odd polynomial. The method gives a sequence of polynomials R_n(x), whose roots are related to the…

This paper contains two parts. In the first part, we shall study the Abelian integrals for Zoladek's example [13], in which it is claimed the existence integrals of 11 small-amplitude limit cycles around a singular point in a particular…

We illustrate with several new applications the power and elegance of the Bendixson Dulac theorem to obtain upper bounds of the number of limit cycles for several families of planar vector fields. In some cases we propose to use a function…

This paper is devoted to study the limit cycle problem of a cubic reversible system with an isochronous center, when it is perturbed inside a class of polynomials. An upper bound of the number of limit cycles is obtained using the Abelian…

This paper deals with the polynomial linear system solving with errors (PLSwE) problem. Specifically, we focus on the evaluation-interpolation technique for solving polynomial linear systems and we assume that errors can occur in the…

In his 1981 Fundamental Theorem of Algebra paper Steve Smale initiated the complexity theory of finding a solution of polynomial equations of one complex variable by a variant of Newton's method. In this paper we reconsider his algorithm in…

The main goal of this paper is to study compactifications of polynomial slow-fast systems. More precisely, the aim is to give conditions in order to guarantee normal hyperbolicity at infinity of the Poincar\'e-Lyapunov sphere for slow-fast…

We consider some combinatorial problems on matrix polynomials over finite fields. Using results from control theory we give a proof of a result of Helmke, Jordan and Lieb on the number of linear unimodular matrix polynomials over a finite…

Limit cycles of planar polynomial vector fields have been an active area of research for decades; the interest in periodic-orbit related dynamics comes from Hilbert's 16th problem and the fact that oscillatory states are often found in…

In this paper, we present a method of higher-order analysis on bifurcation of small limit cycles around an elementary center of integrable systems under perturbations. This method is equivalent to higher-order Melinikov function approach…

Smale's 17th problem asks for an algorithm which finds an approximate zero of polynomial systems in average polynomial time (see Smale 2000). The main progress on Smale's problem is Beltr\'an-Pardo (2011) and B\"urgisser-Cucker (2010). In…

I discuss some recent work linking certain aspects of the second part of Hilbert's 16th problem to the theory of \hbox{o-minimality}. These notes are adapted from a lecture I gave in the Jour fixe seminar series at the Zukunfts\-kolleg of…

In this short paper, we give an upper bound for the number of different basic feasible solutions generated by the simplex method for linear programming problems having optimal solutions. The bound is polynomial of the number of constraints,…

We analyze, mainly using bifurcation methods, an elliptic superlinear problem in one-dimension with periodic boundary conditions. One of the main novelties is that we follow for the first time a bifurcation approach, relying on a…

We generalize the recent invariant polytope algorithm for computing the joint spectral radius and extend it to a wider class of matrix sets. This, in particular, makes the algorithm applicable to sets of matrices that have finitely many…

We present a simpler proof of the existence of an exact number of one or more limit cycles to the Lienard system $\dot{x}=y-F(x) $, $\dot {y}=-g(xt)$, under weaker conditions on the odd functions $F(x) $ and $g(x) $ as compared to those…

We develop the theory of resolvent degree, introduced by Brauer \cite{Br} in order to study the complexity of formulas for roots of polynomials and to give a precise formulation of Hilbert's 13th Problem. We extend the context of this…

Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on the context, solving has different meanings. In order to…

This article presents a numerical illustration of a recently proposed strongly polynomial-time algorithm for the general linear programming (LP) problem. Each iteration of the proposed algorithm consists of two Gauss-Jordan pivoting…