MONODROMY AND STABILITY FOR NILPOTENT CRITICAL POINTS

2005 ◽  
Vol 15 (04) ◽  
pp. 1253-1265 ◽  
Author(s):  
M. J. ÁLVAREZ ◽  
A. GASULL
Keyword(s):  
Critical Points ◽  
Limit Cycles ◽  
Stability Problem ◽  
Short Proof ◽  
Sufficient Conditions ◽  
Planar Systems ◽  
The Stability ◽  
Necessary And Sufficient ◽  
Lyapunov Constants

We give a new and short proof of the characterization of monodromic nilpotent critical points. We also calculate the first generalized Lyapunov constants in order to solve the stability problem. We apply the results to several families of planar systems obtaining necessary and sufficient conditions for having a center. Our method also allows us to generate limit cycles from the origin.

Almost sure stability of maxima

1973 ◽  
Vol 10 (2) ◽  
pp. 387-401 ◽  
Author(s):  
Sidney I. Resnick ◽  
R. J. Tomkins
Keyword(s):  
Markov Chain ◽  
Stability Problem ◽  
Sufficient Conditions ◽  
Random Variables ◽  
Necessary And Sufficient Conditions ◽  
Finite Markov Chain ◽  
Almost Sure Stability ◽  
Normalizing Constants ◽  
The Stability ◽  
Necessary And Sufficient

For random variables {Xn, n ≧ 1} unbounded above set Mn = max {X1, X2, …, Xn}. When do normalizing constants bn exist such that Mn/bn→ 1 a.s.; i.e., when is {Mn} a.s. stable? If {Xn} is i.i.d. then {Mn} is a.s. stable iff for all and in this case bn ∼ F–1 (1 – 1/n) Necessary and sufficient conditions for lim supn→∞, Mn/bn = l > 1 a.s. are given and this is shown to be insufficient in general for lim infn→∞Mn/bn = 1 a.s. except when l = 1. When the Xn are r.v.'s defined on a finite Markov chain, one shows by means of an analogue of the Borel Zero-One Law and properties of semi-Markov matrices that the stability problem for this case can be reduced to the i.i.d. case.

Stability Analysis of Switched Positive Systems with Delays

2011 ◽  
Vol 48-49 ◽  
pp. 1093-1096
Author(s):  
Xiu Yong Ding ◽  
Lan Shu ◽  
Chang Cheng Xiang ◽  
Xiu Liu
Keyword(s):  
Stability Analysis ◽  
Lyapunov Function ◽  
Discrete Time ◽  
Stability Problem ◽  
Sufficient Conditions ◽  
System Stability ◽  
Positive Systems ◽  
The Stability ◽  
Switched Positive Systems ◽  
Necessary And Sufficient

This brief investigates the stability problem of discrete-time switched positive systems with delays, and establishes some necessary and sufficient conditions for the existence of a switched copositive Lyapunov function(SCLF) for such systems. It turns out that the size of the delays does not affect the stability of these systems. In other words, system stability is completely determined by the system matrices.

Almost sure stability of maxima

1973 ◽  
Vol 10 (02) ◽  
pp. 387-401 ◽  
Author(s):  
Sidney I. Resnick ◽  
R. J. Tomkins
Keyword(s):  
Markov Chain ◽  
Stability Problem ◽  
Sufficient Conditions ◽  
Random Variables ◽  
Necessary And Sufficient Conditions ◽  
Finite Markov Chain ◽  
Almost Sure Stability ◽  
Normalizing Constants ◽  
The Stability ◽  
Necessary And Sufficient

For random variables {Xn, n≧ 1} unbounded above setMn= max {X1,X2, …,Xn}. When do normalizing constantsbnexist such thatMn/bn→1 a.s.; i.e., when is {Mn} a.s. stable? If {Xn} is i.i.d. then {Mn} is a.s. stable iff for alland in this casebn∼F–1(1 – 1/n) Necessary and sufficient conditions for lim supn→∞,Mn/bn= l >1 a.s. are given and this is shown to be insufficient in general for lim infn→∞Mn/bn= 1 a.s. except whenl= 1. When theXnare r.v.'s defined on a finite Markov chain, one shows by means of an analogue of the Borel Zero-One Law and properties of semi-Markov matrices that the stability problem for this case can be reduced to the i.i.d. case.

scholarly journals Characterizing slope regions

2021 ◽  
Author(s):  
Rocio Gonzalez-Diaz ◽  
Darshan Batavia ◽  
Rocio M. Casablanca ◽  
Walter G. Kropatsch
Keyword(s):  
Critical Points ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Topological Properties ◽  
Theoretical Characterization ◽  
Necessary And Sufficient ◽  
Conference Papers ◽  
Previous Conference

AbstractThis paper provides a theoretical characterization of monotonically connected image surface regions, called slope regions. The characterization is given by several topological properties described in terms of critical points relative to the region. We formally prove the necessary and sufficient conditions that a region needs to satisfy to be a slope region. We also provide a prototype of slope regions which is general and contains, as particular cases, the prototypes studied and published in previous conference papers.

On the Necessary and Sufficient Conditions for the Stability of Linear Generalized Ordinary Differential, Linear Impulsive and Linear Difference Systems

2009 ◽  
Vol 16 (4) ◽  
pp. 597-616
Author(s):  
Shota Akhalaia ◽  
Malkhaz Ashordia ◽  
Nestan Kekelia
Keyword(s):  
Linear System ◽  
Difference Equations ◽  
Closed Interval ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Difference Systems ◽  
The Stability ◽  
Necessary And Sufficient ◽  
Generalized Ordinary Differential Equations ◽  
Lyapunov Sense

Abstract Necessary and sufficient conditions are established for the stability in the Lyapunov sense of solutions of a linear system of generalized ordinary differential equations 𝑑𝑥(𝑡) = 𝑑𝐴(𝑡) · 𝑥(𝑡) + 𝑑𝑓(𝑡), where and are, respectively, matrix- and vector-functions with bounded total variation components on every closed interval from . The results are realized for the linear systems of impulsive, ordinary differential and difference equations.

scholarly journals On cryptographic properties of (n + 1)-bit S-boxes constructed by known n-bit S-boxes

2020 ◽  
Vol 15 (1) ◽  
pp. 258-265
Author(s):  
Yu Zhou ◽  
Daoguang Mu ◽  
Xinfeng Dong
Keyword(s):  
Sufficient Conditions ◽  
Sum Of Squares ◽  
Basic Component ◽  
Necessary And Sufficient Conditions ◽  
Autocorrelation Functions ◽  
Walsh Spectrum ◽  
Cryptographic Algorithms ◽  
Necessary And Sufficient ◽  
Relationship Of

AbstractS-box is the basic component of symmetric cryptographic algorithms, and its cryptographic properties play a key role in security of the algorithms. In this paper we give the distributions of Walsh spectrum and the distributions of autocorrelation functions for (n + 1)-bit S-boxes in [12]. We obtain the nonlinearity of (n + 1)-bit S-boxes, and one necessary and sufficient conditions of (n + 1)-bit S-boxes satisfying m-order resilient. Meanwhile, we also give one characterization of (n + 1)-bit S-boxes satisfying t-order propagation criterion. Finally, we give one relationship of the sum-of-squares indicators between an n-bit S-box S0 and the (n + 1)-bit S-box S (which is constructed by S0).

Some Structural Properties of Systolic Tree Automata

1989 ◽  
Vol 12 (4) ◽  
pp. 571-585
Author(s):  
E. Fachini ◽  
A. Maggiolo Schettini ◽  
G. Resta ◽  
D. Sangiorgi
Keyword(s):  
Structural Properties ◽  
Stability Problem ◽  
Sufficient Condition ◽  
Tree Automata ◽  
Necessary And Sufficient Condition ◽  
The Stability ◽  
Necessary And Sufficient

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