Search Results for ""

The multicomputational paradigm is a generalization of the computational paradigm to many computational threads of time. In the ordinary computational paradigm, time ...

A point is a 0-dimensional mathematical object which can be specified in n-dimensional space using an n-tuple (x_1, x_2, ..., x_n) consisting of n coordinates. In dimensions ...

A sequence of n-tuples that fills n-space more uniformly than uncorrelated random points, sometimes also called a low-discrepancy sequence. Although the ordinary uniform ...

There are nine possible types of isolated singularities on a cubic surface, eight of them rational double points. Each type of isolated singularity has an associated normal ...

The ruliad may be defined as the entangled limit of everything that is computationally possible, i.e., the result of following all possible computational rules in all ...

Multiple series generalizations of basic hypergeometric series over the unitary groups U(n+1). The fundamental theorem of U(n) series takes c_1, ..., c_n and x_1, ..., x_n as ...

If a is an arbitrary integer relatively prime to n and g is a primitive root of n, then there exists among the numbers 0, 1, 2, ..., phi(n)-1, where phi(n) is the totient ...

A permutation group is a finite group G whose elements are permutations of a given set and whose group operation is composition of permutations in G. Permutation groups have ...

Let n be an integer variable which tends to infinity and let x be a continuous variable tending to some limit. Also, let phi(n) or phi(x) be a positive function and f(n) or ...

Let (L,<=) be any complete lattice. Suppose f:L->L is monotone increasing (or isotone), i.e., for all x,y in L, x<=y implies f(x)<=f(y). Then the set of all fixed points of f ...