Search Results for ""

A ring without zero divisors in which an integer norm and an associated division algorithm (i.e., a Euclidean algorithm) can be defined. For signed integers, the usual norm ...

The extended greatest common divisor of two integers m and n can be defined as the greatest common divisor GCD(m,n) of m and n which also satisfies the constraint ...

Let the vertices of a graph G be numbered with distinct integers 1 to |G|. Then the dilation of G is the maximum (absolute) difference between integers assigned to adjacent ...

A sequence {a_j} of positive integers is called an iteration sequence if there exists a strictly increasing sequence {s_k} of positive integers such that a_1=s_1>=2 and ...

A set of integers that give the orders of the blocks in a Jordan canonical form, with those integers corresponding to submatrices containing the same latent root bracketed ...

A submonoid is a subset of the elements of a monoid that are themselves a monoid under the same monoid operation. For example, consider the monoid formed by the nonnegative ...

Let h>=2 and let A_1, A_2, ..., A_h be sets of integers. The sumset A_1+A_2+...+A_h is the set of all integers of the form a_1+a_2+...+a_h, where a_i is a member of A_i for ...

Having forms of different handedness which are not mirror-symmetric.

The property of being degenerate.

A map x|->x^p where p is a prime.