Search Results for ""

The odd graph O_n of order n is a graph having vertices given by the (n-1)-subsets of {1,...,2n-1} such that two vertices are connected by an edge iff the associated subsets ...

Any row r and column s of a determinant being selected, if the element common to them be multiplied by its cofactor in the determinant, and every product of another element ...

A set of integers that give the orders of the blocks in a Jordan canonical form, with those integers corresponding to submatrices containing the same latent root bracketed ...

A distance g on a set that fulfils the same properties as a metric except relaxes the definition to allow the distance between two different points to be zero. An example of ...

Course List

The notion of parallel transport on a manifold M makes precise the idea of translating a vector field V along a differentiable curve to attain a new vector field V^' which is ...

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

A subset {v_1,...,v_k} of a vector space V, with the inner product <,>, is called orthogonal if <v_i,v_j>=0 when i!=j. That is, the vectors are mutually perpendicular. Note ...

Given a Jacobi theta function, the nome is defined as q(k) = e^(piitau) (1) = e^(-piK^'(k)/K(k)) (2) = e^(-piK(sqrt(1-k^2))/K(k)) (3) (Borwein and Borwein 1987, pp. 41, 109 ...

A generalized octagon GO(n,k) is a generalized polygon of order 8. GO(1,2) is the (3,8)-cage graph, the incidence graph of the Cremona-Richmond configuration, the cubic ...