Search Results for ""

Let alpha(G) denote the independence number of a graph G. Then the Shannon capacity Theta(G), sometimes also denoted c(G), of G is defined as ...

An Artin L-function over the rationals Q encodes in a generating function information about how an irreducible monic polynomial over Z factors when reduced modulo each prime. ...

The smallest unit of binary information, equal to a single 0 or 1. Two bits are called a crumb, four bits are called a nibble, and eight bits are called 1 byte.

A Bloch vector is a unit vector (cosphisintheta, sinphisintheta, costheta) used to represent points on a Bloch sphere.

A space of functions comprising a complete biorthogonal system.

A compositeness certificate is a piece of information which guarantees that a given number p is composite. Possible certificates consist of a factor of a number (which, in ...

A sentence is called a contingency if its truth table contains at least one 'T' and at least one 'F.'

A formal structure for the organization of information. Examples of data structures include the list, queue, stack, and tree.

A database can be roughly defined as a structure consisting of 1. A collection of information (the data), 2. A collection of queries that can be submitted, and 3. A ...

The set of all edge automorphisms of G, denoted Aut^*(G). Let L(G) be the line graph of a graph G. Then the edge automorphism group Aut^*(G) is isomorphic to Aut(L(G)), ...