Search Results for ""

A d-dimensional discrete percolation model on a regular point lattice L=L^d is said to be oriented if L is an oriented lattice. One common such model takes place on the ...

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

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

Two losing gambling games can be set up so that when they are played one after the other, they become winning. There are many ways to construct such scenarios, the simplest ...

The path covering number (or path-covering number; Slater 1972) of a graph G, variously denoted as summarized below, is the minimum number of vertex-disjoint paths that cover ...

The Pell-Lucas numbers are the V_ns in the Lucas sequence with P=2 and Q=-1, and correspond to the Pell-Lucas polynomial Q_n(1). The Pell-Lucas number Q_n is equal to ...

A principal bundle is a special case of a fiber bundle where the fiber is a group G. More specifically, G is usually a Lie group. A principal bundle is a total space E along ...

A projection matrix P is an n×n square matrix that gives a vector space projection from R^n to a subspace W. The columns of P are the projections of the standard basis ...

A prolate spheroid is a spheroid that is "pointy" instead of "squashed," i.e., one for which the polar radius c is greater than the equatorial radius a, so c>a (called ...

A quartic vertex-transitive graph is a quartic graph that is vertex transitive. Read and Wilson (1988, pp. 164-166) enumerate all connected quartic vertex-transitive graphs ...