scholarly journals A classification of explosions in dimension one

2009 ◽  
Vol 29 (2) ◽  
pp. 715-731 ◽  
Author(s):  
E. SANDER ◽  
J. A. YORKE

AbstractA discontinuous change in the size of an attractor is the most easily observed type of global bifurcation. More generally, anexplosionis a discontinuous change in the set of recurrent points. An explosion often results from heteroclinic and homoclinic tangency bifurcations. We prove that, for one-dimensional maps, explosions are generically the result of either tangency or saddle-node bifurcations. Furthermore, we give necessary and sufficient conditions for generic tangency bifurcations to lead to explosions.

2003 ◽  
Vol 35 (04) ◽  
pp. 1111-1130 ◽  
Author(s):  
Andrew G. Hart ◽  
Servet Martínez ◽  
Jaime San Martín

We study the λ-classification of absorbing birth-and-death processes, giving necessary and sufficient conditions for such processes to be λ-transient, λ-null recurrent and λ-positive recurrent.


2002 ◽  
Vol 12 (04) ◽  
pp. 709-737 ◽  
Author(s):  
A. BARBÉ ◽  
F. VON HAESELER

We generalize the concept of one-dimensional decimation invariant sequences, i.e. sequences which are invariant under a specific rescaling, to dimension N. After discussing the elementary properties of decimation-invariant sequences, we focus our interest on their periodicity. Necessary and sufficient conditions for the existence of periodic decimation invariant sequences are presented.


2004 ◽  
Vol 134 (6) ◽  
pp. 1177-1197 ◽  
Author(s):  
Martin Krupa ◽  
Ian Melbourne

Systems possessing symmetries often admit robust heteroclinic cycles that persist under perturbations that respect the symmetry. In previous work, we began a systematic investigation into the asymptotic stability of such cycles. In particular, we found a sufficient condition for asymptotic stability, and we gave algebraic criteria for deciding when this condition is also necessary. These criteria are satisfied for cycles in R3.Field and Swift, and Hofbauer, considered examples in R4 for which our sufficient condition for stability is not optimal. They obtained necessary and sufficient conditions for asymptotic stability using a transition-matrix technique.In this paper, we combine our previous methods with the transition-matrix technique and obtain necessary and sufficient conditions for asymptotic stability for a larger class of heteroclinic cycles. In particular, we obtain a complete theory for ‘simple’ heteroclinic cycles in R4 (thereby proving and extending results for homoclinic cycles that were stated without proof by Chossat, Krupa, Melbourne and Scheel). A partial classification of simple heteroclinic cycles in R4 is also given. Finally, our stability results generalize naturally to higher dimensions and many of the higher-dimensional examples in the literature are covered by this theory.


2020 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Kalyan Sinha

A matrix is a Q0-matrix if for every k∈{1,2,…,n}, the sum of all k×k principal minors is nonnegative. In this paper, we study some necessary and sufficient conditions for a digraph to have Q0-completion. Later on we discuss the relationship between Q and Q0-matrix completion problem. Finally, a classification of the digraphs of order up to four is done based on Q0-completion.


Mathematics ◽  
2020 ◽  
Vol 8 (5) ◽  
pp. 757
Author(s):  
Yunguang Yue ◽  
Fengchun Lei ◽  
Xingwu Liu ◽  
Jie Wu

In this paper, we establish the asynchronous computability theorem in d-solo system by borrowing concepts from combinatorial topology, in which we state a necessary and sufficient conditions for a task to be wait-free computable in that system. Intuitively, a d-solo system allows as many d processes to access it as if each were running solo, namely, without detecting communication from any peer. As an application, we completely characterize the solvability of the input-less tasks in such systems. This characterization also leads to a hardness classification of these tasks according to whether their output complexes hold a d-nest structure. As a byproduct, we find an alternative way to distinguish the computational power of d-solo objects for different d.


2012 ◽  
Vol 62 (5) ◽  
Author(s):  
Shou-feng Wang ◽  
Di Zhang

AbstractWith the help of a property of completely simple semigroups proved in this paper we give necessary and sufficient conditions for vertex-transitivity of Cayley digraphs of strong semilattices of completely simple semigroups.


Sign in / Sign up

Export Citation Format

Share Document