Search Results for ""

An idealized mathematical object having a rigorously straight edge which can be used to draw a line segment. Although geometric constructions are sometimes said to be ...

A set of moves which a player plans to follow while playing a game.

A relation < is a strict order on a set S if it is 1. Irreflexive: a<a does not hold for any a in S. 2. Asymmetric: if a<b, then b<a does not hold. 3. Transitive: a<b and b<c ...

A tensor category (C, tensor ,I,a,r,l) is strict if the maps a, l, and r are always identities. A related notion is that of a tensor R-category.

Let P=(P,<=) be a partially ordered set, and let x,y,z in P. If x<=y<=z, then y is said to be between x and z. If y is between x and z and y not in {x,z}, then y is strictly ...

A generalization of Ramsey theory to mathematical objects in which one would not normally expect structure to be found. For example, there exists a graph with very few ...

Let C be a category. Then D is said to be a subcategory of C, if the objects of D are also objects of C, if the morphisms of D are also morphisms of C, and if D is a category ...

Giving a set F={f_1,f_2,...,f_n} of contracting similitudes of R^l, the closed set E is said to be subselfsimilar for F if E subset union _(i=1)^nf_i(E) (Falconer 1995, ...

A tree G^' whose graph vertices and graph edges form subsets of the graph vertices and graph edges of a given tree G.

For any ordinal number alpha, the successor of alpha is alpha union {alpha} (Ciesielski 1997, p. 46). The successor of an ordinal number alpha is therefore the next ordinal, ...