Search Results for ""

The end of the last gap in the Lagrange spectrum, given by F=(2221564096+283748sqrt(462))/(491993569)=4.5278295661... (OEIS A118472). Real numbers greater than F are members ...

Let p>3 be a prime number, then 4(x^p-y^p)/(x-y)=R^2(x,y)-(-1)^((p-1)/2)pS^2(x,y), where R(x,y) and S(x,y) are homogeneous polynomials in x and y with integer coefficients. ...

The eigenvalues of a graph are defined as the eigenvalues of its adjacency matrix. The set of eigenvalues of a graph is called a graph spectrum. The largest eigenvalue ...

A surface given by the parametric equations x(u,v) = u (1) y(u,v) = v (2) z(u,v) = 1/3u^3+uv^2+2(u^2-v^2). (3) The handkerchief surface has stationary points summarized in ...

A continuous transformation from one function to another. A homotopy between two functions f and g from a space X to a space Y is a continuous map G from X×[0,1]|->Y such ...

A special nonsingular map from one manifold to another such that at every point in the domain of the map, the derivative is an injective linear transformation. This is ...

A semigroup S is said to be an inverse semigroup if, for every a in S, there is a unique b (called the inverse of a) such that a=aba and b=bab. This is equivalent to the ...

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