Search Results for ""

Let M be a bounded set in the plane, i.e., M is contained entirely within a rectangle. The outer Jordan measure of M is the greatest lower bound of the areas of the coverings ...

The Jørgensen graph is a maximally linklessly embeddable graph on 8 vertices and 21 edges, where "maximal" means it is not a proper subgraph of another linklessly embeddable ...

A ket |psi> is a vector living in a dual vector space to that containing bras <psi|. Bras and kets are commonly encountered in quantum mechanics. Bras and kets can be ...

The Killing form is an inner product on a finite dimensional Lie algebra g defined by B(X,Y)=Tr(ad(X)ad(Y)) (1) in the adjoint representation, where ad(X) is the adjoint ...

Given a series of positive terms u_i and a sequence of finite positive constants a_i, let rho=lim_(n->infty)(a_n(u_n)/(u_(n+1))-a_(n+1)). 1. If rho>0, the series converges. ...

The ordinary differential equation (1) (Byerly 1959, p. 255). The solution is denoted E_m^p(x) and is known as an ellipsoidal harmonic of the first kind, or Lamé function. ...

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

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.