Search Results for ""

Two graphs which contain the same number of graph vertices connected in the same way are said to be isomorphic. Formally, two graphs G and H with graph vertices ...

A function f mapping a set X->X/R (X modulo R), where R is an equivalence relation in X, is called a canonical map.

The intersection product for classes of rational equivalence between cycles on an algebraic variety.

Let G be a locally compact Abelian group. Let G^* be the group of all continuous homeomorphisms G->R/Z, in the compact open topology. Then G^* is also a locally compact ...

Modular arithmetic is the arithmetic of congruences, sometimes known informally as "clock arithmetic." In modular arithmetic, numbers "wrap around" upon reaching a given ...

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 ...

Consider the local behavior of a map f:R^m->R^n by choosing a point x in R^m and an open neighborhood U subset R^m such that x in U. Now consider the set of all mappings ...

A finite field is a field with a finite field order (i.e., number of elements), also called a Galois field. The order of a finite field is always a prime or a power of a ...

Take K a number field and m a divisor of K. A congruence subgroup H is defined as a subgroup of the group of all fractional ideals relative prime to m (I_K^m) that contains ...

The group of classes of finite dimensional central simple algebras over k with respect to a certain equivalence.