Related papers: Effectiveness of the Bendixson-Dulac theorem

We review one dimensional matrix theory and its variations, collective field theory and quantum phase space description. In the planar limit, these theories become classical and can be easily analyzed. With these descriptions, one…

A classical result of Dirac says that every $n$-vertex graph with minimum degree at least $\frac{n}{2}$ contains a Hamilton cycle. A `discrepancy' version of Dirac's theorem was shown by Balogh--Csaba--Jing--Pluh\'ar,…

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…

In 1975, Erd\H{o}s asked for the maximum number of edges that an $n$-vertex graph can have if it does not contain two edge-disjoint cycles on the same vertex set. It is known that Tur\'an-type results can be used to prove an upper bound of…

We prove a general multi-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers…

We show that the number of limit cycles of Lienard vector field L is equal to the index of first order linear PDE defined by L.

Li\'{e}nard equations, $\ddot{x}+\epsilon f(x)\dot{x}+x=0$, with $f(x)$ an even continuous function are considered. In the weakly nonlinear regime ($\epsilon\to 0$), the number and an order zero in $\epsilon$ approximation of the amplitude…

We study the existence of powers of Hamiltonian cycles in graphs with large minimum degree to which some additional edges have been added in a random manner. It follows from the theorems of Dirac and of Koml\'os, Sark\"ozy, and Szemer\'edi…

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…

For a $n$-dimensional spin manifold $M$ with a fixed spin structure and a spinor bundle $\Sigma M$, we prove an $\epsilon$-regularity theorem for weak solutions to the nonlinear Dirac equation of cubic nonlinearity. This, in particular,…

We give upper-bounds for the dimension of some linear systems. The theorem improves the differential Horace method introduced by Alexander-Hirschowitz, and was conjectured by Simpson. Possible applications are the calculus of the dimension…

Denoting by ${\mathcal L}_d(m_0,m_1,...,m_r)$ the linear system of plane curves passing through $r+1$ generic points $p_0,p_1,...,p_r$ of the projective plane with multiplicity $m_i$ (or larger) at each $p_i$, we prove the…

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. En route, we prove some sharp estimates on power…

Consider a Dirac operator defined on the whole plane with a mass term of size m supported outside a domain Omega. We give a simple proof for the norm resolvent convergence, as m goes to infinity, of this operator to a Dirac operator defined…

A system of plane curves defined by prescribing n points of multiplicity m in general position is regular if n > (2m)^2. The proof uses computation of limits of linear systems acquiring fixed divisors, an interesting problem in itself.

The Dirac equation for an electron in an external electromagnetic field can be regarded as a singular set of linear equations for the vector potential. Radford's method of algebraically solving for the vector potential is reviewed, with…

This paper applies a recent result determining periodic orbits on the basis of first integrals, for Li\'enard systems. By solving a first order ODE with singularities, a crucial result is proved to locate intervals of single and isolated…

In the first part of the paper we develop a constructive procedure to obtain the Taylor expansion, in terms of the energy, of the period function for a non-degenerated center of any planar analytic Hamiltonian system. We apply it to several…

We study the question of the least number of random edges that need to be added to a P\'osa-Seymour graph, that is, a graph with minimum degree exceeding $\frac k{k+1}n$, to secure the existence of the $m$-th power of a Hamiltonian cycle,…

A theorem due to Seyffarth states that every planar $4$-connected $n$-vertex graph has a cycle double cover (CDC) containing at most $n-1$ cycles (a "small" CDC). We extend this theorem by proving that, in fact, such a graph must contain…