Search Results for ""

Coding theory, sometimes called algebraic coding theory, deals with the design of error-correcting codes for the reliable transmission of information across noisy channels. ...

A composite number n is a positive integer n>1 which is not prime (i.e., which has factors other than 1 and itself). The first few composite numbers (sometimes called ...

A complete set of mutually conjugate group elements. Each element in a group belongs to exactly one class, and the identity element (I=1) is always in its own class. The ...

The connected domination number of a connected graph G, denoted d(G), is the size of a minimum connected dominating set of a graph G. The maximum leaf number l(G) and ...

The Conway-Smith graph is a distance-transitive graph on 63 vertices having intersection array {10,6,4,1;1,2,6,10} (Hall 1980). It is also distance-transitive. It is denoted ...

Conway's soldiers, also known as the "solitaire army" game (Berlekamp et al. 1982) or "checker-jumping problem" (Honsberger 1976) is a one-player game played on an infinite ...

A plot in the complex plane of the points B(t)=S(t)+iC(t), (1) where S(t) and C(t) are the Fresnel integrals (von Seggern 2007, p. 210; Gray 1997, p. 65). The Cornu spiral is ...

The Coulomb wave function is a special case of the confluent hypergeometric function of the first kind. It gives the solution to the radial Schrödinger equation in the ...

The cross polytope beta_n is the regular polytope in n dimensions corresponding to the convex hull of the points formed by permuting the coordinates (+/-1, 0, 0, ..., 0). A ...

If a discrete group of displacements in the plane has more than one center of rotation, then the only rotations that can occur are by 2, 3, 4, and 6. This can be shown as ...