Search Results for ""

In conical coordinates, Laplace's equation can be written ...

In bispherical coordinates, Laplace's equation becomes (1) Attempt separation of variables by plugging in the trial solution f(u,v,phi)=sqrt(coshv-cosu)U(u)V(v)Psi(psi), (2) ...

In toroidal coordinates, Laplace's equation becomes (1) Attempt separation of variables by plugging in the trial solution f(u,v,phi)=sqrt(coshu-cosv)U(u)V(v)Psi(psi), (2) ...

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

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

Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. A lattice endomorphism is a mapping h:L->L that preserves both meets and joins.

A lattice graph, also known as a mesh graph or grid graph, is a graph possessing an embedding in a Euclidean space R^n that forms a regular tiling. Examples include grid ...

Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. A lattice isomorphism is a one-to-one and onto lattice homomorphism.