Related papers: Limit cycles for planar semi-quasi-homogeneous pol…
In this paper, we study a Lienard system of the form dot{x}=y-F(x), dot{y}=-x, where F(x) is an odd polynomial. We introduce a method that gives a sequence of algebraic approximations to the equation of each limit cycle of the system. This…
For a fixed planar graph $H$, let $\operatorname{\mathbf{N}}_{\mathcal{P}}(n,H)$ denote the maximum number of copies of $H$ in an $n$-vertex planar graph. In the case when $H$ is a cycle, the asymptotic value of…
We give a precise example of a polynomial vector field on $\mathbb{R}^2$ whose corresponding singular holomorphic foliation of $\mathbb{C}^2$ possesses a complex limit cycle which does not intersect the real plane $\mathbb{R}^2$.
We estimate the frequency of polynomial iterations which falls in a given multiplicative subgroup of a finite field of $p$ elements. We also give a lower bound on the size of the subgroup which is multiplicatively generated by the first $N$…
We study the impact of forbidding short cycles to the edge density of $k$-planar graphs; a $k$-planar graph is one that can be drawn in the plane with at most $k$ crossings per edge. Specifically, we consider three settings, according to…
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 purpose of this paper is to present the structure of the linear codes over a finite field with q elements that have a permutation automorphism of order m. These codes can be considered as generalized quasi-cyclic codes. Quasi-cyclic…
We solve the center-focus problem in a class of piecewise quadratic polynomial differential systems with an invariant straight line. The separation curve is also a straight line which is not invariant. We provide families having at the…
We Prove That The Uniform Upper Bound for the Number Of Limit Cycles Of The Lienard Equation of Degree 4 Can be equals to 2. Further We Suggest to Embedding Planar Lienard Equations In Higher Dimension and Present question of completly…
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…
Quasi-polycyclic (QP for short) codes over a finite chain ring $R$ are a generalization of quasi-cyclic codes, and these codes can be viewed as an $R[x]$-submodule of $\mathcal{R}_m^{\ell}$, where $\mathcal{R}_m:= R[x]/\langle f\rangle$,…
This paper deals with the problem of location and existence of limit cycles for real planar polynomial differential systems. We provide a method to construct Poincar\'e--Bendixson regions by using transversal curves, that enables us to…
Hakimi and Schmeichel determined a sharp lower bound for the number of cycles of length 4 in a maximal planar graph with $n$ vertices, $n\geq 5$. It has been shown that the bound is sharp for $n = 5,12$ and $n\geq 14$ vertices. However, the…
The second part of Hilbert's 16th problem concerns determining the maximum number $H(m)$ of limit cycles that a planar polynomial vector field of degree $m$ can exhibit. A natural extension to the three-dimensional space is to study the…
This paper considers the equivalence problem for quasi-cyclic codes over finite fields. The results obtained are used to construct isodual quasi-cyclic codes.
In recent decades, several mathematical models describing the pacemaker activity of the rabbit sinoatrial node have been developed. We demonstrate that it is not possible to establish the existence, uniqueness, and stability of a limit…
This paper studies the family of piecewise linear differential systems in the plane with two pieces separated by a switching curve $y=x^{m}$, where $m>1$ is an arbitrary positive. By analysing the first order Melnikov function, we give an…
We propose a program for finding the cyclicity of period annuli of quadratic systems with centers of genus one. As a first step, we classify all such systems and determine the essential one-parameter quadratic perturbations which produce…
The security of multivariate cryptosystems and digital signature schemes relies on the hardness of solving a system of polynomial equations over a finite field. Polynomial system solving is also currently a bottleneck of index-calculus…
We review methods for determination of "quasi-periods" (or "cycle length") of signals of low coherence. Such type of variability was called "cyclic" for semi-regular red variables, or "quasi-periodic oscillations" (QPO) for fast variability…