Search Results for ""

A labeled binary tree containing the labels 1 to n with root 1, branches leading to nodes labeled 2 and 3, branches from these leading to 4, 5 and 6, 7, respectively, and so ...

An equivalence relation on a set X is a subset of X×X, i.e., a collection R of ordered pairs of elements of X, satisfying certain properties. Write "xRy" to mean (x,y) is an ...

A morphism is a map between two objects in an abstract category. 1. A general morphism is called a homomorphism, 2. A morphism f:Y->X in a category is a monomorphism if, for ...

A presheaf C of categories consists of the following data: 1. For every local homeomorphism f:Y->X of topological spaces X, Y, a category C(f:Y->X); 2. For every diagram f ...

Let L be a language of the first-order logic. Assume that the language L has the following sets of nonlogical symbols: 1. C is the set of constant symbols of L. (These are ...

The base 16 notational system for representing real numbers. The digits used to represent numbers using hexadecimal notation are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, ...

The base 8 notational system for representing real numbers. The digits used are 0, 1, 2, 3, 4, 5, 6, and 7, so that 8_(10) (8 in base 10) is represented as 10_8 ...

A group representation of a group G on a vector space V can be restricted to a subgroup H. For example, the symmetric group on three letters has a representation phi on R^2 ...

The Wythoff array is an interspersion array that can be constructed by beginning with the Fibonacci numbers {F_2,F_3,F_4,F_5,...} in the first row and then building up ...

The best known example of an Anosov diffeomorphism. It is given by the transformation [x_(n+1); y_(n+1)]=[1 1; 1 2][x_n; y_n], (1) where x_(n+1) and y_(n+1) are computed mod ...