Search Results for ""

The m×n rook graph (confusingly called the m×n grid by Brouwer et al. 1989, p. 440) and also sometimes known as a lattice graph (e.g., Brouwer) is the graph Cartesian product ...

The Shrikhande graph is a strongly regular graph on 16 nodes. It is cospectral with the rook graph L_(4,4), so neither of the two is determined by spectrum. The Shrikhande ...

A tree is a mathematical structure that can be viewed as either a graph or as a data structure. The two views are equivalent, since a tree data structure contains not only a ...

The pure equation x^p=C of prime degree p is irreducible over a field when C is a number of the field but not the pth power of an element of the field. Jeffreys and Jeffreys ...

Affine functions represent vector-valued functions of the form f(x_1,...,x_n)=A_1x_1+...+A_nx_n+b. The coefficients can be scalars or dense or sparse matrices. The constant ...

An affine geometry is a geometry in which properties are preserved by parallel projection from one plane to another. In an affine geometry, the third and fourth of Euclid's ...

A two-dimensional affine geometry constructed over a finite field. For a field F of size n, the affine plane consists of the set of points which are ordered pairs of elements ...

Let V be a vector space over a field K, and let A be a nonempty set. Now define addition p+a in A for any vector a in V and element p in A subject to the conditions: 1. ...

Fok (1946) and Hazewinkel (1988, p. 65) call v(z) = 1/2sqrt(pi)Ai(z) (1) w_1(z) = 2e^(ipi/6)v(omegaz) (2) w_2(z) = 2e^(-ipi/6)v(omega^(-1)z), (3) where Ai(z) is an Airy ...

An algebraic function is a function f(x) which satisfies p(x,f(x))=0, where p(x,y) is a polynomial in x and y with integer coefficients. Functions that can be constructed ...