Poisson stability in product of dynamical systems.
Kumar, A., Bhagat, R.P. (1987)
International Journal of Mathematics and Mathematical Sciences
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Kumar, A., Bhagat, R.P. (1987)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Prasad, S.S., Kumar, Anant (1984)
International Journal of Mathematics and Mathematical Sciences
Similarity:
J. Auslander, P. Seibert (1964)
Annales de l'institut Fourier
Similarity:
Les auteurs étudient la notion de prolongement au sens de T. Ura et ses relations avec la notion d’ensembles positivement invariants. La stabilité au sens de Liapounoff est équivalente à l’invariance par prolongement. Les auteurs dégagent ensuite la notion de “prolongements abstraits” et les notions de stabilité correspondantes; la stabilité absolue (associée au prolongement minimal transitif) et la stabilité asymptotique jouent un rôle important.
Alex V. Kontorovich, Steven J. Miller (2005)
Acta Arithmetica
Similarity:
Vaisman, I. (1999)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Wainberg, Dorin (2002)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Pop, Camelia, Petrişor, Camelia, Bălă, Dumitru (2011)
Mathematical Problems in Engineering
Similarity:
Dimitri Gurevich, Pavel Saponov (2011)
Banach Center Publications
Similarity:
We consider Poisson pencils, each generated by a linear Poisson-Lie bracket and a quadratic Poisson bracket corresponding to a so-called Reflection Equation Algebra. We show that any bracket from such a Poisson pencil (and consequently, the whole pencil) can be restricted to any generic leaf of the Poisson-Lie bracket. We realize a quantization of these Poisson pencils (restricted or not) in the framework of braided affine geometry. Also, we introduce super-analogs of all these Poisson...
Byunghan Kim, A. Pillay (2001)
Fundamenta Mathematicae
Similarity:
We discuss various conjectures and problems around the issue of when and whether stable formulas are responsible for forking in simple theories. We prove that if the simple theory T has strong stable forking then any complete type is a nonforking extension of a complete type which is axiomatized by instances of stable formulas. We also give another treatment of the first author's result which identifies canonical bases in supersimple theories.
Jean-Paul Dufour, Aïssa Wade (2006)
Annales de l’institut Fourier
Similarity:
We study the stability of singular points for smooth Poisson structures as well as general Lie algebroids. We give sufficient conditions for stability lying on the first-order approximation (not necessarily linear) of a given Poisson structure or Lie algebroid at a singular point. The main tools used here are the classical Lichnerowicz-Poisson cohomology and the deformation cohomology for Lie algebroids recently introduced by Crainic and Moerdijk. We also provide several examples of...
Ewa Drgas-Burchardt (2013)
Discussiones Mathematicae Graph Theory
Similarity:
In this note we present some sufficient conditions for the uniqueness of a stable matching in the Gale-Shapley marriage classical model of even size. We also state the result on the existence of exactly two stable matchings in the marriage problem of odd size with the same conditions.
Mikami, Kentaro (1999)
Lobachevskii Journal of Mathematics
Similarity: