Search Results for ""

The Norton-Smith graph is a weakly regular graph on 1134 vertices with regular parameters (nu,k,lambda,mu)=(1134,117,36,(0,12)). It is distance-regular as well as ...

Given a linear code C of length n and dimension k over the field F, a parity check matrix H of C is a n×(n-k) matrix whose rows generate the orthogonal complement of C, i.e., ...

The party problem, also known as the maximum clique problem, asks to find the minimum number of guests that must be invited so that at least m will know each other or at ...

Let C be an error-correcting code consisting of N codewords,in which each codeword consists of n letters taken from an alphabet A of length q, and every two distinct ...

A quintic symmetric graph is a quintic graph (i.e., regular of degree 5) that is also symmetric. Since quintic graphs exist only on an even number of nodes, so do symmetric ...

The vector space tensor product V tensor W of two group representations of a group G is also a representation of G. An element g of G acts on a basis element v tensor w by ...

A rotation group is a group in which the elements are orthogonal matrices with determinant 1. In the case of three-dimensional space, the rotation group is known as the ...

The process of approximating a quantity, be it for convenience or, as in the case of numerical computations, of necessity. If rounding is performed on each of a series of ...

The special unitary group SU_n(q) is the set of n×n unitary matrices with determinant +1 (having n^2-1 independent parameters). SU(2) is homeomorphic with the orthogonal ...

A tetradic (or four-way) number is a number that remains unchanged when flipped back to front, mirrored up-down, or flipped up-down. Since the only numbers that remain ...