Search Results for ""

The Walsh functions consist of trains of square pulses (with the allowed states being -1 and 1) such that transitions may only occur at fixed intervals of a unit time step, ...

A k×n Latin rectangle is a k×n matrix with elements a_(ij) in {1,2,...,n} such that entries in each row and column are distinct. If k=n, the special case of a Latin square ...

Given a ring R with identity, the special linear group SL_n(R) is the group of n×n matrices with elements in R and determinant 1. The special linear group SL_n(q), where q is ...

The special orthogonal group SO_n(q) is the subgroup of the elements of general orthogonal group GO_n(q) with determinant 1. SO_3 (often written SO(3)) is the rotation group ...

The word adjoint has a number of related meanings. In linear algebra, it refers to the conjugate transpose and is most commonly denoted A^(H). The analogous concept applied ...

For a general two-player zero-sum game, max_(i<=m)min_(j<=n)a_(ij)<=min_(j<=n)max_(i<=m)a_(ij). If the two are equal, then write ...

The global clustering coefficient C of a graph G is the ratio of the number of closed trails of length 3 to the number of paths of length two in G. Let A be the adjacency ...

The circumference of a graph is the length of any longest cycle in a graph. Hamiltonian graphs on n>1 vertices therefore have circumference of n. For a cyclic graph, the ...

The mean distance of a (connected) graph is the mean of the elements of its graph distance matrix. Closed forms for some classes of named graphs are given in the following ...

The pathwidth of a graph G, also called the interval thickness, vertex separation number, and node searching number, is one less than the size of the largest set in a path ...