Stability Problem of Canard-Cycles on a Finite Interval

2010 ◽  
Author(s):  
Gennadii A. Chumakov ◽  
Nataliya A. Chumakova ◽  
Elena A. Lashina ◽  
Theodore E. Simos ◽  
George Psihoyios ◽  
...  

In the first part of this paper opportunity has been taken to make some adjustments in certain general formulae of previous papers, the necessity for which appeared in discussions with other workers on this subject. The general results thus amended are then applied to a general discussion of the stability problem including the effect of the trailing wake which was deliberately excluded in the previous paper. The general conclusion is that to a first approximation the wake, as usually assumed, has little or no effect on the reality of the roots of the period equation, but that it may introduce instability of the oscillations, if the centre of gravity of the element is not sufficiently far forward. During the discussion contact is made with certain partial results recently obtained by von Karman and Sears, which are shown to be particular cases of the general formulae. An Appendix is also added containing certain results on the motion of a vortex behind a moving cylinder, which were obtained to justify certain of the assumptions underlying the trail theory.


2021 ◽  
Vol 6 (1) ◽  
Author(s):  
Kyung-Su Kim ◽  
Steven A. Kivelson

AbstractIt is widely held that disorder is essential to the existence of a finite interval of magnetic field in which the Hall conductance is quantized, i.e., for the existence of “plateaus” in the quantum Hall effect. Here, we show that the existence of a quasi-particle Wigner crystal (QPWC) results in the persistence of plateaus of finite extent even in the limit of vanishing disorder. Several experimentally detectable features that characterize the behavior in the zero disorder limit are also explored.


1989 ◽  
Vol 12 (4) ◽  
pp. 571-585
Author(s):  
E. Fachini ◽  
A. Maggiolo Schettini ◽  
G. Resta ◽  
D. Sangiorgi

We prove that the classes of languages accepted by systolic automata over t-ary trees (t-STA) are always either equal or incomparable if one varies t. We introduce systolic tree automata with base (T(b)-STA), a subclass of STA with interesting properties of modularity, and we give a necessary and sufficient condition for the equivalence between a T(b)-STA and a t-STA, for a given base b. Finally, we show that the stability problem for T(b)-ST A is decidible.


Sign in / Sign up

Export Citation Format

Share Document