Search Results for ""
701 - 710 of 1215 for unique factorization domainSearch Results
Given a linear code C, a generator matrix G of C is a matrix whose rows generate all the elements of C, i.e., if G=(g_1 g_2 ... g_k)^(T), then every codeword w of C can be ...
A two-dimensional piecewise linear map defined by x_(n+1) = 1-y_n+|x_n| (1) y_(n+1) = x_n. (2) The map is chaotic in the filled region above and stable in the six hexagonal ...
Given two groups G and H, there are several ways to form a new group. The simplest is the direct product, denoted G×H. As a set, the group direct product is the Cartesian ...
The group direct sum of a sequence {G_n}_(n=0)^infty of groups G_n is the set of all sequences {g_n}_(n=0)^infty, where each g_n is an element of G_n, and g_n is equal to the ...
The upper central series of a group G is the sequence of groups (each term normal in the term following it) 1=Z_0<=Z_1<=Z_2<=...<=Z_n<=... that is constructed in the ...
Any locally compact Hausdorff topological group has a unique (up to scalars) nonzero left invariant measure which is finite on compact sets. If the group is Abelian or ...
For all integers n and nonnegative integers t, the harmonic logarithms lambda_n^((t))(x) of order t and degree n are defined as the unique functions satisfying 1. ...
Let l(x) be an nth degree polynomial with zeros at x_1, ..., x_n. Then the fundamental Hermite interpolating polynomials of the first and second kinds are defined by ...
A Hermitian metric on a complex vector bundle assigns a Hermitian inner product to every fiber bundle. The basic example is the trivial bundle pi:U×C^k->U, where U is an open ...
The hexacode graph is the incidence graph of the unique symmetric transversal design STD_2[6;3]. It is also a bipartite (0,2)-graph. The hexacode graph is a ...
...