Results 261 to 270 of about 78,297 (300)
Some of the next articles are maybe not open access.
Combinatorics, Probability and Computing, 2009
A d-simplex is a collection of d + 1 sets such that every d of them has non-empty intersection and the intersection of all of them is empty. Fix k ≥ d + 2 ≥ 3 and let be a family of k-element subsets of an n-element set that contains no d-simplex. We prove that if $|\cG| \geq (1 - o(1))\binom{n-1 }{k-1}$, then there is a vertex x of such that the ...
Dhruv Mubayi, Reshma Ramadurai
openaire +2 more sources
A d-simplex is a collection of d + 1 sets such that every d of them has non-empty intersection and the intersection of all of them is empty. Fix k ≥ d + 2 ≥ 3 and let be a family of k-element subsets of an n-element set that contains no d-simplex. We prove that if $|\cG| \geq (1 - o(1))\binom{n-1 }{k-1}$, then there is a vertex x of such that the ...
Dhruv Mubayi, Reshma Ramadurai
openaire +2 more sources
TEACHING STABILITY AND ROBUST STABILITY
IFAC Proceedings Volumes, 1994Abstract The aim of this paper is to demonstrate that, in teaching stability theory for linear systems, there are two basic mathematical foundations which can be used: The principal of the argument and Lyapunov theory, according to the presentation of the system in the operator or time-domain, respectively.
openaire +1 more source
A-Stability and Stochastic Mean-Square Stability
BIT Numerical Mathematics, 2000The author considers the mean-square stability of the stochastic differential equation for the test problem with multiplicative noise proposed by \textit{Y. Saito} and \textit{T. Mitsui} [SIAM J. Appl. Math. 56, No. 5, 1400-1423 (1996; Zbl 0869.60053)]. It quantifies precisely the point where unconditional stability is lost.
openaire +4 more sources
The equivalence of algebraic stability andAN-stability
BIT, 1987Let C be a general linear integration method. The author proves that an irreducible AN-stable method C is algebraically stable (for definitions of these concepts see the author [ibid. 27, 182-189 (1987; Zbl 0623.65074)]. This generalizes previous results about Runge-Kutta methods and one-leg methods. A number of useful miscellaneous results from theory
openaire +1 more source
Stability and stabilization of biocatalysts
Trends in Biotechnology, 1999F J, Plou, A, Ballesteros
openaire +2 more sources
Simplicity, and stability in there
Journal of Symbolic Logic, 2001AbstractFirstly, in this paper, we prove that the equivalence of simplicity and the symmetry of forking. Secondly, we attempt to recover definability part of stability theory to simplicity theory. In particular, using elimination of hyperimaginaries we prove that for any supersimpleT.
openaire +1 more source
G-stability is equivalent toA-stability
BIT, 1978In 1975 the author showed that a norm (Liapunov function) can be constructed for the stability and error analysis of a linear multistep method (and the related one-leg method) for the solution of stiff non-linear systems, provided that the system satisfies a monotonicity condition and the method possesses a property calledG-stability.
openaire +1 more source