Related papers: Effectiveness of the Bendixson-Dulac theorem

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…

We investigate here the behaviour of a large typical meandric system, proving a central limit theorem for the number of components of given shape. Our main tool is a theorem of Gao and Wormald, that allows us to deduce a central limit…

Untangling is a process in which some vertices of a planar graph are moved to obtain a straight-line plane drawing. The aim is to move as few vertices as possible. We present an algorithm that untangles the cycle graph C_n while keeping at…

In this paper we extend three results about polycycles (also known as graphs) of planar smooth vector field to planar non-smooth vector fields (also known as piecewise vector fields, or Filippov systems). The polycycles considered here may…

We study the existence of a directed Hamilton cycle in random digraphs with $m$ edges where we condition on minimum in- and out-degree at least one. Denote such a random graph by $D_{n,m}^{(\delta\geq1)}$. We prove that if $m=\tfrac n2(\log…

We obtain sharp bounds for the number of n--cycles in a finite graph as a function of the number of edges, and prove that the complete graph is optimal in more ways than could be imagined. We prove sharp estimates on both the sum of k-th…

Parameterization above (or below) a guarantee is a successful concept in parameterized algorithms. The idea is that many computational problems admit ``natural'' guarantees bringing to algorithmic questions whether a better solution (above…

This paper establishes a new Chebyshev criterion for some family of integrals. By virtue of this criterion we obtain several new Chebyshev families. With the help of these new families we can answer the conjecture posed by Gasull et al in…

A Hamiltonian cycle of a graph is a closed path that visits each site once and only once. I study a field theoretic representation for the number of Hamiltonian cycles for arbitrary graphs. By integrating out quadratic fluctuations around…

It has recently been shown that there are substantial differences in the regularity behavior of the empirical process based on scalar diffusions as compared to the classical empirical process, due to the existence of diffusion local time.…

We show that for every compact domain in a Euclidean space with d.c. (delta-convex) boundary there exists a unique Legendrian cycle such that the associated curvature measures fulfil a local version of the Gauss-Bonnet formula. This was…

We prove a descent theorem of nearby cycle formula for Newton non-degenerate functions at the origin as well as its motivic version (without assuming the convenience condition). This is used in some papers without any proof although its…

We establish the regularity theory for certain critical elliptic systems with an anti-symmetric structure under inhomogeneous Neumann and Dirichlet boundary constraints. As applications, we prove full regularity and smooth estimates at the…

We formulate a refined theory of linear systems, using the methods of a previous paper, "A Theory of Branches for Algebraic Curves", and use it to give a geometric interpretation of the genus of an algebraic curve. Using principles of…

We analyze a real one-parameter family of quasiconformal deformations of a hyperbolic rational map known as {\em spinning}. We show that under fairly general hypotheses, the limit of spinning either exists and is unique, or else converges…

In this paper we study the maximum number $N$ of limit cycles that can exhibit a planar piecewise linear differential system formed by two pieces separated by a straight line. More precisely, we prove that this maximum number satisfies…

The second part of the Hilbert's sixteenth problem consists in determining the upper bound $\mathcal{H}(n)$ for the number of limit cycles that planar polynomial vector fields of degree $n$ can have. For $n\geq2$, it is still unknown…

We show that every directed graph with minimum out-degree at least $18k$ contains at least $k$ vertex disjoint cycles. This is an improvement over the result of Alon who showed this result for digraphs of minimum out-degree at least $64k$.…

In this paper, we study limit cycle bifurcations for a class of general near-Hamiltonian systems near a heteroclinic loop with an elementary saddle and a nilpotent saddle. Firstly, we consider the behaviors of the unperturbed system,…

The polar magnetic field precursor is considered to be the most robust and physics-based method for the prediction of the next solar cycle strength. However, to make a reliable prediction of a cycle, is the polar field at the solar minimum…