Search Results for ""

For n>=1, let u and v be integers with u>v>0 such that the Euclidean algorithm applied to u and v requires exactly n division steps and such that u is as small as possible ...

Let F be the set of complex analytic functions f defined on an open region containing the closure of the unit disk D={z:|z|<1} satisfying f(0)=0 and df/dz(0)=1. For each f in ...

The Laplacian polynomial is the characteristic polynomial of the Laplacian matrix. The second smallest root of the Laplacian polynomial of a graph g (counting multiple values ...

The Laplacian spectral radius of a finite graph is defined as the largest value of its Laplacian spectrum, i.e., the largest eigenvalue of the Laplacian matrix (Lin et al. ...

A "law of large numbers" is one of several theorems expressing the idea that as the number of trials of a random process increases, the percentage difference between the ...

Let S be a nonempty set of real numbers that has an upper bound. Then a number c is called the least upper bound (or the supremum, denoted supS) for S iff it satisfies the ...

The Lebesgue covering dimension is an important dimension and one of the first dimensions investigated. It is defined in terms of covering sets, and is therefore also called ...

A nonnegative measurable function f is called Lebesgue integrable if its Lebesgue integral intfdmu is finite. An arbitrary measurable function is integrable if f^+ and f^- ...

The Lebesgue integral is defined in terms of upper and lower bounds using the Lebesgue measure of a set. It uses a Lebesgue sum S_n=sum_(i)eta_imu(E_i) where eta_i is the ...

The Lebesgue measure is an extension of the classical notions of length and area to more complicated sets. Given an open set S=sum_(k)(a_k,b_k) containing disjoint intervals, ...