Related papers: A restricted version of the Hilbert's 16th problem…
In this paper we are concerned with determining lower bounds of the number of limit cycles for piecewise polynomial holomorphic systems with a straight line of discontinuity. We approach this problem with different points of view: study of…
Phase retrieval in real or complex Hilbert spaces is the task of recovering a vector, up to an overall unimodular multiplicative constant, from magnitudes of linear measurements. In this paper, we assume that the vector is normalized, but…
In this paper, by using Picard-Fuchs equations and Chebyshev criterion, we study the bifurcate of limit cycles for quadratic Hamilton system $S^{(2)}$ and $S^{(3)}$: $\dot{x}= y+2axy+by^2$, $\dot{y}=-x+x^2-ay^2$ with $a\in(-\frac{1}{2},1)$,…
This paper studies the family of piecewise linear differential systems in the plane with two pieces separated by a cubic curve. By analyzing the obtained first order Melnikov function, we give an upper bound of the number of limit cycles…
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…
The orienteering problem is a route optimization problem which consists in finding a simple cycle that maximizes the total collected profit subject to a maximum distance limitation. In the last few decades, the occurrence of this problem in…
In this paper, we study the diagonal restrictions of certain Hilbert theta series for a totally real field $F$, and prove that they span the corresponding space of elliptic modular forms when the $F$ is quadratic or cubic. Furthermore, we…
In the study of the number of limit cycles of near-Hamiltonian systems, the first order Melnikov function plays an important role. This paper aims to establish a development of a known method to estimate the upper bound of the number of…
A new lower bound on the minimum Hamming distance of linear quasi-cyclic codes over finite fields is proposed. It is based on spectral analysis and generalizes the Semenov- Trifonov bound in a similar way as the Hartmann-Tzeng bound extends…
The existence of a uniform upper bound for the maximum number of limit cycles of planar piecewise linear differential systems with two zones separated by a straight line has been subject of interest of hundreds of papers. After more than 30…
We present quadrature schemes to calculate matrices, where the so-called modified Hilbert transformation is involved. These matrices occur as temporal parts of Galerkin finite element discretizations of parabolic or hyperbolic problems when…
We propose an algorithm to find a lower bound for the number of cyclic codes over any finite field with any given exponent. Besides, we give a formula to find the exponent of BCH codes.
In this work a linearly constrained minimization of a positive semidefinite quadratic functional is examined. Our results are concerning infinite dimensional real Hilbert spaces, with a singular positive operator related to the functional,…
Let X be a projective scheme over a finite field. In this paper, we consider the asymptotic behavior of the number of effective cycles on X with bounded degree as it goes to the infinity. By this estimate, we can define a certain kind of…
We study the number of limit cycles and the bifurcation diagram in the Poincar\'{e} sphere of a one-parameter family of planar differential equations of degree five $\dot {\bf x}=X_b({\bf x})$ which has been already considered in previous…
We give an effective method for controlling the maximum number of limit cycles of some planar polynomial systems. It is based on a suitable choice of a Dulac function and the application of the well-known Bendixson-Dulac Criterion for…
In this paper a generalized Rayleigh-Li\'enard oscillator is consider and lower bounds for the number of limit cycles bifurcating from weak focus equilibria and saddle connections are provided. By assuming some open conditions on the…
In his Ph.D. disseration, Feldman and his collaborators define the linear programming decoder for binary linear codes, which is a linear programming relaxation of the maximum-likelihood decoding problem. This decoder does not, in general,…
We give an upper bound on the number of cycles in a simple graph in terms of its degree sequence, and apply this bound to resolve several conjectures of Kir\'aly and Arman and Tsaturian and to improve upper bounds on the maximum number of…
Motivated by the controllability/reachability problems for switched linear control systems and some classes of nonlinear (mechanical) control systems we address a related problem of existence of a cyclic vector for an associative (matrix)…