Search Results for ""

The infimum of all number a for which |f(z)|<=exp(|z|^a) holds for all |z|>r and f an entire function, is called the order of f, denoted lambda=lambda(f) (Krantz 1999, p. ...

Let K be a number field of extension degree d over Q. Then an order O of K is a subring of the ring of integers of K with d generators over Z, including 1. The ring of ...

The ring of integers of a number field K, denoted O_K, is the set of algebraic integers in K, which is a ring of dimension d over Z, where d is the extension degree of K over ...

The number of graph edges meeting at a given node in a graph is called the order of that graph vertex.

The order n of an algebraic surface is the order of the polynomial defining a surface, which can be geometrically interpreted as the maximum number of points in which a line ...

An ordering of permutations in which each two adjacent permutations differ by the transposition of two elements. For the permutations of {1,2,3} there are two listings which ...

Given a sample of n variates X_1, ..., X_N, reorder them so that Y_1<Y_2<...<Y_N. Then Y_i is called the ith order statistic (Hogg and Craig 1970, p. 146), sometimes also ...

The set of terms of first-order logic (also known as first-order predicate calculus) is defined by the following rules: 1. A variable is a term. 2. If f is an n-place ...

Let n be a positive number having primitive roots. If g is a primitive root of n, then the numbers 1, g, g^2, ..., g^(phi(n)-1) form a reduced residue system modulo n, where ...

Let G be group of group order h and D be a set of k elements of G. If the set of differences d_i-d_j contains every nonzero element of G exactly lambda times, then D is a ...