Related papers: Limit cycles of linear vector fields on $(\mathbb{…
We prove that the number of limit cycles, which bifurcate from a two-saddle loop of a planar quadratic Hamiltonian system, under an arbitrary quadratic deformation, is less than or equal to three.
This paper studies the number of limit cycles, known as the Smale-Pugh problem, for the generalized Abel equation \begin{align*} \frac{dx}{d\theta}=A(\theta)x^p+B(\theta)x^q, \end{align*} where $A$ and $B$ are are piecewise trigonometrical…
Minimal Strong Digraphs (MSDs) can be regarded as a generalization of the concept of tree to directed graphs. Their cyclic structure and some spectral properties have been studied in several articles. In this work, we further study some…
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…
Relativistic QFTs are in general defined by a collection of effective actions, describing the dynamics of quantum fields at different energy scales. The consequent natural idea of a space of theories is still a rather imprecise notion,…
We consider uniform random permutations of length $n$ conditioned to have no cycle longer than $n^\beta$ with $0<\beta<1$, in the limit of large $n$. Since in unconstrained uniform random permutations most of the indices are in cycles of…
Consider a sequence of LexBFS vertex orderings {\sigma}1, {\sigma}2, . . . where each ordering {\sigma}i is used to break ties for {\sigma}i+1. Since the total number of vertex orderings of a finite graph is finite, this sequence must end…
We extend the notion of reticular Legendrian unfoldings in order to investigate multi-time bifurcations of wavefronts generated by an r-corner. We give a classification list of generic and stable bifurcations with two time parameter and…
We provide an explicit bound on the number of periodic points of a rational function defined over a number field, where the bound depends only on the number of primes of bad reduction and the degree of the function, and is linear in the…
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)…
Linear-constraint loops are programs whose transition relation is specified by a system of linear inequalities. The termination problem asks, given a loop, whether it admits an infinite computation. Decidability of termination remains open…
The method of periodic projections consists in iterating projections onto $m$ closed convex subsets of a Hilbert space according to a periodic sweeping strategy. In the presence of $m\geq 3$ sets, a long-standing question going back to the…
We find an upper bound for the number of limit cycles, bifurcating from the 8-loop of the Duffing oscillator $x"= x-x^{3}$ under the special cubic perturbation $$ x"= x-x^{3}+\lambda_{1}y+\lambda_{2}x^{2}+\lambda_{3}xy+\lambda_{4}x^{2}y .…
Let $G$ be an $n$-vertex graph obtained by adding chords to a cycle of length $n$. Markstr\"{o}m asked for the maximum number of edges in $G$ if there are no two cycles in $G$ with the same length. A simple counting argument shows that such…
Continuing the investigation for the number of crossing limit cycles of nonsmooth Li\'enard systems in [Nonlinearity 21(2008), 2121-2142] for the case of a unique equilibrium, in this paper we consider the case of any number of equilibria.…
We determine several necessary and sufficient conditions for a closed almost-complex orbifold $Q$ with cyclic local groups to admit a nonvanishing vector field. These conditions are stated separately in terms of the orbifold Euler-Satake…
We establish the existence of a bifurcation from an attractive random equilibrium to shear-induced chaos for a stochastically driven limit cycle, indicated by a change of sign of the first Lyapunov exponent. This addresses an open problem…
In directed graphs, a cycle can be seen as a structure that allows its vertices to loop back to themselves, or as a structure that allows pairs of vertices to reach each other through distinct paths. We extend these concepts to temporal…
In 1975, P. Erd\"{o}s proposed the problem of determining the maximum number $f(n)$ of edges in a graph of $n$ vertices in which any two cycles are of different lengths. In this paper, it is proved that $$f(n)\geq n+32t-1$$ for…
Motivated by the theory of graph limits, we introduce and study the convergence and limits of linear representations of finite groups over finite fields. The limit objects are infinite dimensional representations of free groups in…