Search Results for ""

The Rogers mod 14 identities are a set of three Rogers-Ramanujan-like identities given by A(q) = sum_(n=0)^(infty)(q^(n^2))/((q;q)_n(q;q^2)_n) (1) = ...

A set A of integers is said to be one-one reducible to a set B (A<<_1B) if there is a one-one recursive function f such that for every x, x in A=>f(x) in B (1) and f(x) in ...

A set (usually of letters) from which a subset is drawn. A sequence of letters is called a word, and a set of words is called a code.

Quantifies deviation from translational invariance by describing the distribution of gaps within a set at multiple scales. The more lacunar a set, the more heterogeneous the ...

Circumscribe a triangle about a circle, another circle around the triangle, a square outside the circle, another circle outside the square, and so on. The circumradius and ...

Zeno's paradoxes are a set of four paradoxes dealing with counterintuitive aspects of continuous space and time. 1. Dichotomy paradox: Before an object can travel a given ...

An interpretation of first-order logic consists of a non-empty domain D and mappings for function and predicate symbols. Every n-place function symbol is mapped to a function ...

Every dense linear order complete set without endpoints having at most omega disjoint intervals is order isomorphic to the continuum of real numbers, where omega is the set ...

The closure of a set A is the smallest closed set containing A. Closed sets are closed under arbitrary intersection, so it is also the intersection of all closed sets ...

If {a_j} subset= D(0,1) (with possible repetitions) satisfies sum_(j=1)^infty(1-|a_j|)<=infty, where D(0,1) is the unit open disk, and no a_j=0, then there is a bounded ...