Related papers: Melnikov analysis for planar piecewise linear vect…

An infinite number of spin chains are solved and it is derived that the ground-state phase transitions belong to the universality classes with central charge c=m/2, where m is an integer. The models are diagonalized by automatically…

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$…

We prove that star-like limit cycles of any planar polynomial system can also be seen either as solutions defined on a given interval of a new associated planar non-autonomous polynomial system or as heteroclinic solutions of a…

An upper bound for the number of Hamiltonian cycles of symmetric diagraphs is established first in this paper, which is tighter than the famous Minc's bound and the Br$\acute{e}$gman's bound. A transformation on graphs is proposed, so that…

We consider the average number of limit cycles that bifurcate from a randomly perturbed linear center where the perturbation consists of random (bivariate) polynomials with independent coefficients. This problem reduces, by way of classical…

In this article, we study a class of fully nonlinear double-divergence systems with free boundaries associated with a minimization problem. The variational structure of Hessian-dependent functional plays a fundamental role in proving the…

This paper is dedicated to clarifying and introducing the correct application of Melnikov method in fractional dynamics. Attention to the complex dynamics of hyperbolic orbits and to fractional calculus can be, respectively, traced back to…

The middle levels problem is to find a Hamilton cycle in the middle levels, M_{2k+1}, of the Hasse diagram of B_{2k+1} (the partially ordered set of subsets of a 2k+1-element set ordered by inclusion). Previously, the best result was that…

In this paper we extend the results on controllability of linear systems obtained in "Controllability of linear systems on solvable Lie groups", from solvable Lie groups to Lie groups with finite semisimple center.

In this paper, we deal with limit cycle bifurcations near a double homoclinic loop with a nilpotent saddle of order 2 by studying expansions of the first order Melnikov functions near the loop and coefficients in these expansions. More…

In this paper, we generalize the Poincar\'e-Lyapunov method for systems with linear type centers to study nilpotent centers in switching polynomial systems and use it to investigate the bi-center problem of planar $Z_2$-equivariant cubic…

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…

In this paper we study planar hybrid systems composed by two stable linear systems, defined by Hurwitz matrices, in addition with a jump that can be a piecewise linear, a polynomial or an analytic function. We provide an explicit analytic…

Let $H$ be obtained from a cyclically $4$-edge-connected cubic planar graph $Y$ other than $K_4$ by deleting two adjacent vertices. We provide a short proof that if $H$ has circumference at least $k$ for some even integer $k \ge 4$, then…

One of the fundamental results in graph minor theory is that for every planar graph $H$, there is a minimum integer $f(H)$ such that graphs with no minor isomorphic to $H$ have treewidth at most $f(H)$. A lower bound for ${f(H)}$ can be…

We show that the existence of algebraic forms of quantum, exactly-solvable, completely-integrable $A-B-C-D$ and $G_2, F_4, E_{6,7,8}$ Olshanetsky-Perelomov Hamiltonians allow to develop the {\it algebraic} perturbation theory, where…

In this paper, using our bifurcational geometric approach, we solve the problem on the maximum number and distribution of limit cycles in the Kukles system representing a planar polynomial dynamical system with arbitrary linear and cubic…

Motivated by a question on the maximal number of vertex disjoint Schrijver graphs in the Kneser graph, we investigate the following function, denoted by $f(n,k)$: the maximal number of Hamiltonian cycles on an $n$ element set, such that no…

Let $m, n$ be positive integers such that $m>1$ divides $n$. In this paper, we introduce a special class of piecewise-affine permutations of the finite set $[1, n]:=\{1, \ldots, n\}$ with the property that the reduction $\pmod m$ of $m$…

If $G$ is a claw-free hamiltonian graph of order $n$ and maximum degree $\Delta$ with $\Delta\geq 24$, then $G$ has cycles of at least $\min\left\{ n,\left\lceil\frac{3}{2}\Delta\right\rceil\right\}-2$ many different lengths.