Search Results for ""

A square matrix is called Hermitian if it is self-adjoint. Therefore, a Hermitian matrix A=(a_(ij)) is defined as one for which A=A^(H), (1) where A^(H) denotes the conjugate ...

A n×n matrix A is an orthogonal matrix if AA^(T)=I, (1) where A^(T) is the transpose of A and I is the identity matrix. In particular, an orthogonal matrix is always ...

A symmetric matrix is a square matrix that satisfies A^(T)=A, (1) where A^(T) denotes the transpose, so a_(ij)=a_(ji). This also implies A^(-1)A^(T)=I, (2) where I is the ...

A Hamilton decomposition (also called a Hamiltonian decomposition; Bosák 1990, p. 123) of a Hamiltonian regular graph is a partition of its edge set into Hamiltonian cycles. ...

Let G be a group, and let S subset= G be a set of group elements such that the identity element I not in S. The Cayley graph associated with (G,S) is then defined as the ...

A minimal surface given by the parametric equations x(u,v) = u-sinucoshv (1) y(u,v) = 1-cosucoshv (2) z(u,v) = 4sin(1/2u)sinh(1/2v) (3) (Gray 1997), or x(r,phi) = ...

A separable extension K of a field F is one in which every element's algebraic number minimal polynomial does not have multiple roots. In other words, the minimal polynomial ...

Given a "good" graph G (i.e., one for which all intersecting graph edges intersect in a single point and arise from four distinct graph vertices), the crossing number is the ...

An amicable pair (m,n) consists of two integers m,n for which the sum of proper divisors (the divisors excluding the number itself) of one number equals the other. Amicable ...

An almost perfect number, also known as a least deficient or slightly defective (Singh 1997) number, is a positive integer n for which the divisor function satisfies ...