Search Results for ""

A stellation is said to be fully supported if all its included cells are supported, i.e., if all its bottom faces are covered by their adjacent cells. In other words, every ...

A finite extension K=Q(z)(w) of the field Q(z) of rational functions in the indeterminate z, i.e., w is a root of a polynomial a_0+a_1alpha+a_2alpha^2+...+a_nalpha^n, where ...

A congruence of the form f(x)=g(x) (mod n), where f(x) and g(x) are both integer polynomials. Functional congruences are sometimes also called "identical congruences" (Nagell ...

A functional graph is a directed graph in which each vertex has outdegree one, and can therefore be specified by a function mapping {1,...,n} onto itself. Functional graphs ...

A function between categories which maps objects to objects and morphisms to morphisms. Functors exist in both covariant and contravariant types.

Let t be an infinite word over a finite alphabet Sigma. Then there exists a uniformly recurrent infinite word r such that Sub(r) subset= Sub(t), where Sub(w) is the set of ...

A game which permits a draw ("tie") when played properly by both players. Tic-tac-toe, for example, is a futile game.

Let G be a group and S be a set. Then S is called a left G-set if there exists a map phi:G×S->S such that phi(g_1,phi(g_2,s))=phi(g_1g_2,s) for all s in S and all g_1,g_2 in ...

A G-space is a special type of T1-Space. Consider a point x and a homeomorphism of an open neighborhood V of x onto an open set of R^n. Then a space is a G-space if, for any ...

A set S is said to be GCD-closed if GCD(x_i,x_j) in S for 1<=i,j<=n.