The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
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.
Ginchev, Ivan (2010)
Union of Bulgarian Mathematicians
Similarity:
Иван Гинчев - Класът на ℓ-устойчивите в точка функции, дефиниран в [2] и разширяващ класа на C1,1 функциите, се обобщава от скаларни за векторни функции. Доказани са някои свойства на ℓ-устойчивите векторни функции. Показано е, че векторни оптимизационни задачи с ограничения допускат условия от втори ред изразени чрез посочни производни, което обобщава резултати от [2] и [5]. The class of ℓ-stable at a point functions defined in [2] and being larger than the class of C1,1...
Ingo Schiermeyer (2001)
Discussiones Mathematicae Graph Theory
Similarity:
A property P defined on all graphs of order n is said to be k-stable if for any graph of order n that does not satisfy P, the fact that uv is not an edge of G and that G + uv satisfies P implies . Every property is (2n-3)-stable and every k-stable property is (k+1)-stable. We denote by s(P) the smallest integer k such that P is k-stable and call it the stability of P. This number usually depends on n and is at most 2n-3. A graph of order n is said to be pancyclic if it contains cycles...
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.
Vladimir Emelichev, Evgeny Gurevsky, Kirill Kuzmin (2010)
Control and Cybernetics
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.
Luis Antonio Favaro, C. M. Mendes (1986)
Annales de l'institut Fourier
Similarity:
In this paper, we give some examples which point to the non-existence of -global stable diagrams , compact. If : is fixed we define the -equivalence for maps and the corresponding -stability. The globalization procedure works and we can compare the -stability, -infinitesimal stability, and -homotopical stability. Also we give some characterization theorems for lower dimensions.