Search Results for ""

A branch point whose neighborhood of values wrap around the range a finite number of times p as their complex arguments theta varies from 0 to a multiple of 2pi is called an ...

A k-automatic set is a set of integers whose base-k representations form a regular language, i.e., a language accepted by a finite automaton or state machine. If bases a and ...

A set S in a metric space (S,d) is bounded if it has a finite generalized diameter, i.e., there is an R<infty such that d(x,y)<=R for all x,y in S. A set in R^n is bounded ...

Given a group G, the algebra CG is a vector space CG={suma_ig_i|a_i in C,g_i in G} of finite sums of elements of G, with multiplication defined by g·h=gh, the group ...

Clairaut's difference equation is a special case of Lagrange's equation (Sokolnikoff and Redheffer 1958) defined by u_k=kDeltau_k+F(Deltau_k), (1) or in "x notation," ...

Let j_k(alpha) denote the number of cycles of length k for a permutation alpha expressed as a product of disjoint cycles. The cycle index Z(X) of a permutation group X of ...

A table made by subtracting adjacent entries in a sequence, then repeating the process with those numbers.

A set S is discrete in a larger topological space X if every point x in S has a neighborhood U such that S intersection U={x}. The points of S are then said to be isolated ...

For a particular format in the IEEE 754-2008 framework, a normal number is a finite nonzero floating-point number with magnitude greater than or equal to a minimum value ...

Let f be an entire function of finite order lambda and {a_j} the zeros of f, listed with multiplicity, then the rank p of f is defined as the least positive integer such that ...