Search Results for ""

A reciprocity theorem for the case n=3 solved by Gauss using "integers" of the form a+brho, when rho is a root of x^2+x+1=0 (i.e., rho equals -(-1)^(1/3) or (-1)^(2/3)) and ...

If there is an integer x such that x^3=q (mod p), then q is said to be a cubic residue (mod p). If not, q is said to be a cubic nonresidue (mod p).

A linear code C is cyclic if for every codeword (c_0,c_1,...,c_(n-1)) in C, the codeword (c_(n-1),c_0,c_1,...,c_(n-2)) is also in C.

The 3-node tournament (and directed graph) illustrated above (Harary 1994, p. 205).

A degree set is a set of integers that make up a degree sequence. Any set of positive integers is the degree set for some graph, because any odd integer from that set can be ...

The order-n dipole graph D_n is a multigraph consisting of two vertices and n multiple edges joining them. The dipole graph D_2 is a multigraph that can be considered to ...

Given any real number theta and any positive integer N, there exist integers h and k with 0<k<=N such that |ktheta-h|<1/N. A slightly weaker form of the theorem states that ...

If, for n and d integers, the ratio n/d is itself an integer, then d is said to divide n. This relationship is written d|n, read "d divides n." In this case, n is also said ...

A binary relation associated with an instance of the stable marriage problem. Stable marriages correspond to vertices with outdegree 0 in the divorce digraph (Skiena 1990, p. ...

A term in social choice theory meaning each alternative receives equal weight for a single vote.