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 ...

The Landau-Mignotte bound, also known as the Mignotte bound, is used in univariate polynomial factorization to determine the number of Hensel lifting steps needed. It gives ...

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. ...

The Laplacian spectral ratio R_L(G) of a connected graph G is defined as the ratio of its Laplacian spectral radius to its algebraic connectivity. If a connected graph of ...

The largest known prime numbers are Mersenne primes, the largest of these known as of September 2013 bing 2^(57885161)-1, which has a whopping 17425170 decimal digits. As of ...

An irregular dodecagonal cross in the shape of a dagger |. The six faces of a cube can be cut along seven edges and unfolded into a Latin cross (i.e., the Latin cross is the ...

The latitude of a point on a sphere is the elevation of the point from the plane of the equator. The latitude delta is related to the colatitude (the polar angle in spherical ...

A lattice automorphism is a lattice endomorphism that is also a lattice isomorphism.