On Comparatively Stable Tridiagonalization Methods.
J.W. RAINEY (1969)
Numerische Mathematik
Similarity:
J.W. RAINEY (1969)
Numerische Mathematik
Similarity:
N. METROPOLIS, M.L. STEIN, P.R. STEIN (1967)
Numerische Mathematik
Similarity:
R.M.M. Mattheij (1980)
Numerische Mathematik
Similarity:
J. Hartung (1977/1978)
Numerische Mathematik
Similarity:
O. Nevanlinna (1977)
Numerische Mathematik
Similarity:
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.
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.
Maurice Kléman, Louise Michel (1978)
Recherche Coopérative sur Programme n°25
Similarity:
A.R. MITCHELL, A.R. GOURLAY (1966)
Numerische Mathematik
Similarity:
M. C. Laskowski, S. Shelah (2006)
Fundamenta Mathematicae
Similarity:
We characterize the stable theories T for which the saturated models of T admit decompositions. In particular, we show that countable, shallow, stable theories with NDOP have this property.
Levit, Vadim E., Mândrescu, Eugen (2005)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Christine Bessenrodt, Lieven Le Bruyn (1991)
Inventiones mathematicae
Similarity:
Chen, Huanyin, Chen, Miaosen (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity: