Search Results for ""

A cubefree word contains no cubed words as subwords. The number of binary cubefree words of length n=1, 2, ... are 2, 4, 6, 10, 16, 24, 36, 56, 80, 118, ... (OEIS A028445). ...

A sophisticated checksum (often abbreviated CRC), which is based on the algebra of polynomials over the integers (mod 2). It is substantially more reliable in detecting ...

The discrete Fourier transform of length N (where N is even) can be rewritten as the sum of two discrete Fourier transforms, each of length N/2. One is formed from the ...

The inversion of a convolution equation, i.e., the solution for f of an equation of the form f*g=h+epsilon, given g and h, where epsilon is the noise and * denotes the ...

A set partition of the rational numbers into two nonempty subsets S_1 and S_2 such that all members of S_1 are less than those of S_2 and such that S_1 has no greatest ...

A Dedekind ring is a commutative ring in which the following hold. 1. It is a Noetherian ring and a integral domain. 2. It is the set of algebraic integers in its field of ...

An embedding of a 1-sphere in a 3-manifold which exists continuously over the 2-disk also extends over the disk as an embedding. An alternate phrasing is that if a knot group ...

A set is denumerable iff it is equipollent to the finite ordinal numbers. (Moore 1982, p. 6; Rubin 1967, p. 107; Suppes 1972, pp. 151-152). However, Ciesielski (1997, p. 64) ...

A Turing machine is called deterministic if there is always at most one instruction associated with a given present internal state/tape state pair (q,s). Otherwise, it is ...

A differential equation is an equation that involves the derivatives of a function as well as the function itself. If partial derivatives are involved, the equation is called ...