Search Results for ""

Let Q(x)=Q(x_1,x_2,...,x_n) be an integer-valued n-ary quadratic form, i.e., a polynomial with integer coefficients which satisfies Q(x)>0 for real x!=0. Then Q(x) can be ...

A matrix used in the Jacobi transformation method of diagonalizing matrices. The Jacobi rotation matrix P_(pq) contains 1s along the diagonal, except for the two elements ...

A method of matrix diagonalization using Jacobi rotation matrices P_(pq). It consists of a sequence of orthogonal similarity transformations of the form ...

The Janko-Kharaghani-Tonchev graph is a strongly regular graph on 324 vertices and 24786 edges. It has regular parameters (nu,k,lambda,mu)=(324,153,72,72). It is implemented ...

If any set of points is displaced by X^idx_i where all distance relationships are unchanged (i.e., there is an isometry), then the vector field is called a Killing vector. ...

Let L=(L, ^ , v ) be a lattice, and let tau subset= L^2. Then tau is a tolerance if and only if it is a reflexive and symmetric sublattice of L^2. Tolerances of lattices, ...

The Lester circle is the circle on which the circumcenter C, nine-point center N, and the first and second Fermat points X and X^' lie (Kimberling 1998, pp. 229-230). Besides ...

A representation of a Lie algebra g is a linear transformation psi:g->M(V), where M(V) is the set of all linear transformations of a vector space V. In particular, if V=R^n, ...

The Ljubljana graph is a graph on 112 vertices that is the third smallest cubic semisymmetric graph. It was discovered by Brouwer et al. (1993) and rediscovered by Conder et ...

The longest path problem asks to find a path of maximum length in a given graph. The problem is NP-complete, but there exists an efficient dynamic programming solution for ...