Related papers: On Periodic Solutions Of Lienard Equations

We prove an exponential upper bound for the number $f(m,n)$ of all maximal triangulations of the $m\times n$ grid: \[ f(m,n) < 2^{3mn}. \] In particular, this improves a result of S. Yu. Orevkov (1999).

We analyze the stopping-time and cycle structure of the normalized Collatz iteration. Using a recursive description of admissible binary sequences, we show that every integer $m \equiv 3 \pmod{4}$ arises uniquely and derive new bounds for…

We consider two extremal problems for set systems without long Berge cycles. First we give Dirac-type minimum degree conditions that force long Berge cycles. Next we give an upper bound for the number of hyperedges in a hypergraph with…

The restricted version of the Hilbert 16th problem for quadratic vector fields requires an upper estimate of the number of limit cycles through a vector parameter that characterizes the vector fields considered and the limit cycles to be…

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…

A common problem to all applications of linear finite dynamical systems is analyzing the dynamics without enumerating every possible state transition. Of particular interest is the long term dynamical behaviour. In this paper, we study the…

The standard procedure for computing scalar multi-loop Feynman integrals consists in reducing them to a basis of so-called master integrals, derive differential equations in the external invariants satisfied by the latter and, finally, try…

In this paper, we prove existence results of a one-dimensional periodic solution to equations with the fractional Laplacian of order $s\in(1/2,1)$, singular nonlinearity, and gradient term under various situations, including nonlocal…

Let $G$ be a finite connected simple graph with $n$ vertices and $m$ edges. We show that, when $G$ is not bipartite, the number of $4$-cycles contained in $G$ is at most $\binom{m-n+1}{2}$. We further provide a short combinatorial proof of…

For any even integer $k\ge 6$, integer $d$ such that $k/2\le d\le k-1$, and sufficiently large $n\in (k/2)\mathbb N$, we find a tight minimum $d$-degree condition that guarantees the existence of a Hamilton $(k/2)$-cycle in every…

There is considered the problem of describing up to linear conformal equivalence those harmonic cubic homogeneous polynomials for which the squared-norm of the Hessian is a nonzero multiple of the quadratic form defining the Euclidean…

We examine a Gelfand type system and show the extremal solutions are bounded provided we are close enough to the scalar case.

This article presents a variety of algebraic proofs of Steiner's $1$-Cycle Theorem. It also demonstrates that, under an exponential upper-bound on the iterates, the only $1$-cycles in the (accelerated) $3x-1$ dynamical system are $(1)$ and…

We provide a new upper bound on the number of conjugacy classes in the group $U_n(q)$ of unitriangular matrices over a finite field. We also compute a similar upper bound for every group in the lower central series of $U_n(q)$.

We give a simplified proof and an improvement of a recent theorem by A. Grigoriev, placing an upper bound for the number of roots of linear combinations of solutions to systems of linear equations with polynomial or rational coefficients.

In this paper, we apply the averaging method via Brouwer degree in a class of planar systems given by a linear center perturbed by a sum of continuous homogeneous vector fields, to study lower bounds for their number of limit cycles. Our…

In this paper, we study the bifurcate of limit cycles for Bogdanov-Takens system($\dot{x}=y$, $\dot{y}=-x+x^{2}$) under perturbations of piecewise smooth polynomials of degree $2$ and $n$ respectively. We bound the number of zeros of first…

We study the existence of periodic solutions of the non--autonomous periodic Lyness' recurrence u_{n+2}=(a_n+u_{n+1})/u_n, where {a_n} is a cycle with positive values a,b and with positive initial conditions. It is known that for a=b=1 all…

We first prove a one-to-one correspondence between finding Hamiltonian cycles in a cubic planar graphs and finding trees with specific properties in dual graphs. Using this information, we construct an exact algorithm for finding…

This paper is concerned with the bifurcation of limit cycles in general quadratic perturbations of quadratic codimension-four centers $Q_4$. Gavrilov and Iliev set an upper bound of {\it eight} for the number of limit cycles produced from…