Related papers: Effectiveness of the Bendixson-Dulac theorem
We prove a general multi-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers…
Consider d uniformly random permutation matrices on n labels. Consider the sum of these matrices along with their transposes. The total can be interpreted as the adjacency matrix of a random regular graph of degree 2d on n vertices. We…
A connected digraph in which the in-degree of any vertex equals its out-degree is Eulerian, this baseline result is used as the basis of existence proofs for universal cycles (also known as generalized deBruijn cycles or U-cycles) of…
We propose a method for designing two-dimensional limit-cycle oscillators with prescribed periodic trajectories and phase response properties based on the phase reduction theory, which gives a concise description of weakly-perturbed…
For a family of weight functions invariant under a finite reflection group, the boundedness of a maximal function on the unit sphere is established and used to prove a multiplier theorem for the orthogonal expansions with respect to the…
We have examined a class of Li\'enard--Levinson--Smith (LLS) system having a stable limit cycle which demonstrates the case where the LLS theorem cannot be applied. The problem has been partly raised in a recent communication by Saha et…
A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field was recently presented in [10]. Shortly after this, a generalization for the sufficient numerical conditions of such characterization…
In this paper, we consider a planar dynamical system with a piecewise linear function containing an arbitrary number (but finite) of dropping sections and approximating some continuous nonlinear function. Studying all possible local and…
In recent decades, piecewise linear differential systems have attracted considerable attention due to their ability to describe a wide range of phenomena. A central problem, as in the theory of general planar differential systems, is to…
A compact method for amplitude calculations in theories with Dirac and Majorana effective operators is discussed. Using the renormalizable formalism of Denner et al., [1,2] for propagators, vertices and fermion (number) flow and introducing…
Erd\H{o}s and P\'{o}sa proved in 1965 that there is a duality between the maximum size of a packing of cycles and the minimum size of a vertex set hitting all cycles. Such a duality does not hold if we restrict to odd cycles. However, in…
The renowned theorem of Dirac states that if $G$ is a graph with minimum degree at least $n/2$ then $G$ has a Hamilton cycle. A natural generalisation asks what properties of an edge-colouring of $G$ guarantee the existence of a properly…
The ambiguity involved in the definition of effective-mass Hamiltonians for nonrelativistic models is resolved using the Dirac equation. The multistep approximation is extended for relativistic cases allowing the treatment of arbitrary…
We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…
We prove a `resilience' version of Dirac's theorem in the setting of random regular graphs. More precisely, we show that, whenever $d$ is sufficiently large compared to $\varepsilon>0$, a.a.s. the following holds: let $G'$ be any subgraph…
It is widely acknowledged that function symbols are an important feature in answer set programming, as they make modeling easier, increase the expressive power, and allow us to deal with infinite domains. The main issue with their…
Understanding how the cycles of a graph or digraph behave in general has always been an important point of graph theory. In this paper, we study the question of finding a set of $k$ vertex-disjoint cycles (resp. directed cycles) of distinct…
It has been known for almost $40$ years that general planar quadratic polynomial systems can have four limit cycles. Recently, four limit cycles were also found in near-integrable quadratic polynomial systems. To help more people to…
A novel method for stability and instability study of autonomous dynamical systems using the flow and divergence of the vector field is proposed. A relation between the method of Lyapunov functions and the proposed method is established.…
The dimer model is a classical statistical mechanics model which is exactly solvable in two dimensions, but about which little is known in higher dimensions. In analogy with large $N$ limits in lattice gauge theory, we study a large $N$…