Upper bound inequality.The Mathieu's series $S(r)$ was considered firstly by \\'E.L. Mathieu in 1890 ; its alternating variant $\\widetilde S(r)$ has been recently introduced by Pog\\'any et al. [11] where various bounds have been established for $S, \\widetilde S$. In this ...
Noun1.upper bound- (mathematics) a number equal to or greater than any other number in a given set math,mathematics,maths- a science (or group of related sciences) dealing with the logic of quantity and shape and arrangement bound,boundary,edge- a line determining the limits of an area ...
An upper bound for the G.C.D. of an - 1 and bn -1. Math. Z. 243, 79–84 (2003). https://doi.org/10.1007/s00209-002-0449-z Download citation Issue DateJanuary 2003 DOIhttps://doi.org/10.1007/s00209-002-0449-z Access this article Log in via an institution Subscribe and ...
The equivalence of the least upper bound property and the Hahn-Banach extension property in ordered vector spaces TO T. -O. Proc. Amer. Math. Soc. 30(2), 2... TO To - 《Proc.amer.math.soc》 被引量: 24发表: 1971年 Relational Algebraic Approach to the Real Numbers: The Least-Upper...
An upper bound is obtained on the mean-square error involved when a real-valued non-band-limited nonstationary random process x( t) is approximated by the sampling expansion ∑ n=∞ ∞x(nT) sinπ(tnT)/T π(tnT)/T for some T > 0. When the process x( t) is band-limited over [...
We completely specify the sharp upper bound (and corresponding maximizing distribution function) when the first moment and any other higher moment are fixed. Specifically, in the case of a fixed mean and variance, we generalize the Cantelli bound for (Tail) Value-at-Risk in that we express ...
These upper bounds are important for the termination of spatial branch-and-bound algorithms. Our method is based on the theorem of Miranda which helps to ensure the existence of feasible points in certain boxes. Then, the computation of upper bounds at the objective function over those boxes ...
Not all graphs have such representations; Tamassia and Tollis [7] and Wismath [9] gave a characterization: Theorem 1 [7], [9] A graph admits a bar visibility representation if and only if it has a planar embedding such that all cut-vertices lie on the boundary of one face. As a ...
An easily calculable upper bound for the infinity norm of the inverse of S S mathContainer Loading Mathjax -strictly diagonally dominant ( S S mathContaine... N Morača - 《Journal of Computational & Applied Mathematics》 被引量: 41发表: 2007年 Upper bounds for the infinity norm of the ...
Harmonic functions of maximal growth: invertibility and cyclicity in Bergman spaces In the theory of commutative Banach algebras with unit, an element generates a dense ideal if and only if it is invertible, in which case its Gelfand trans... Alexander,Borichev,H\\aa,... - 《J.amer.math....