Displaying similar documents to “M-T topologically stable mappings are uniformly stable.”

Around stable forking

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.

A Note on the Uniqueness of Stable Marriage Matching

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.

Second-order sufficient condition for ℓ ˜ -stable functions

Dušan Bednařík, Karel Pastor (2007)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

Similarity:

The aim of our article is to present a proof of the existence of local minimizer in the classical optimality problem without constraints under weaker assumptions in comparisons with common statements of the result. In addition we will provide rather elementary and self-contained proof of that result.

A Basic Fixed Point Theorem

Lech Pasicki (2006)

Bulletin of the Polish Academy of Sciences. Mathematics

Similarity:

The paper contains a fixed point theorem for stable mappings in metric discus spaces (Theorem 10). A consequence is Theorem 11 which is a far-reaching extension of the fundamental result of Browder, Göhde and Kirk for non-expansive mappings.

Prolongations and stability in dynamical systems

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.

Vector Optimization Results for ℓ -Stable Data

Marie Dvorská (2013)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

Similarity:

The aim of this paper is to summarize basic facts about ℓ -stable at a point vector functions and existing results for certain vector constrained programming problem with ℓ -stable data.