Search Results for ""

An algorithm originally described by Barnsley in 1988. Pick a point at random inside a regular n-gon. Then draw the next point a fraction r of the distance between it and a ...

When a number is expressed in scientific notation, the number of significant digits (or significant figures) is the number of digits needed to express the number to within ...

If a complex function f is analytic in a disk contained in a simply connected domain D and f can be analytically continued along every polygonal arc in D, then f can be ...

Let omega_1 and omega_2 be periods of a doubly periodic function, with tau=omega_2/omega_1 the half-period ratio a number with I[tau]!=0. Then Klein's absolute invariant ...

Elder's theorem is a generalization of Stanley's theorem which states that the total number of occurrences of an integer k among all unordered partitions of n is equal to the ...

The principal branch of an analytic multivalued function, also called a principal sheet, is a single-valued "slice" (i.e., branch) of the function chosen that is for ...

Let n points xi_1, ..., xi_n be randomly distributed on a domain S, and let H be some event that depends on the positions of the n points. Let S^' be a domain slightly ...

In predicate calculus, an existential formula is a prenex normal form formula (i.e., a formula written as a string of quantifiers and bound variables followed by a ...

Let A be a C^*-algebra and A_+ be its positive part. Suppose that E is a complex linear space which is a left A-module and lambda(ax)=(lambdaa)x=a(lambdax), where lambda in ...

A type of number involving the roots of unity which was developed by Kummer while trying to solve Fermat's last theorem. Although factorization over the integers is unique ...