Search Results for ""

Lucas's theorem states that if n>=3 be a squarefree integer and Phi_n(z) a cyclotomic polynomial, then Phi_n(z)=U_n^2(z)-(-1)^((n-1)/2)nzV_n^2(z), (1) where U_n(z) and V_n(z) ...

A nonnegative function g(x,y) describing the "distance" between neighboring points for a given set. A metric satisfies the triangle inequality g(x,y)+g(y,z)>=g(x,z) (1) and ...

A bounded plane convex region symmetric about a lattice point and with area >4 must contain at least three lattice points in the interior. In n dimensions, the theorem can be ...

In a set X equipped with a binary operation · called a product, the multiplicative identity is an element e such that e·x=x·e=x for all x in X. It can be, for example, the ...

The Nauru graph is the name given by Eppstein (2007) to the generalized Petersen graph GP(12,5) on 24 nodes and 36 edges which is also cubic symmetric graph F_(024)A, the ...

Suppose that A and B are two normed (Banach) algebras. A vector space X is called an A-B-bimodule whenever it is simultaneously a normed (Banach) left A-module, a normed ...

The operator norm of a linear operator T:V->W is the largest value by which T stretches an element of V, ||T||=sup_(||v||=1)||T(v)||. (1) It is necessary for V and W to be ...

An oriented graph is a directed graph having no symmetric pair of directed edges. A complete oriented graph is called a tournament. The numbers of oriented graphs on n=1, 2, ...

In elementary geometry, orthogonal is the same as perpendicular. Two lines or curves are orthogonal if they are perpendicular at their point of intersection. Two vectors v ...

The orthogonal complement of a subspace V of the vector space R^n is the set of vectors which are orthogonal to all elements of V. For example, the orthogonal complement of ...