TOPICS
Search

Search Results for ""


3181 - 3190 of 6485 for Finite Group D 4Search Results
For any sequence of integers 0<n_1<...<n_k, there is a flag manifold of type (n_1, ..., n_k) which is the collection of ordered sets of vector subspaces of R^(n_k) (V_1, ..., ...
If there exists a one-to-one correspondence between two subgroups and subfields such that G(E(G^')) = G^' (1) E(G(E^')) = E^', (2) then E is said to have a Galois theory. A ...
The Gelfand transform x|->x^^ is defined as follows. If phi:B->C is linear and multiplicative in the senses phi(ax+by)=aphi(x)+bphi(y) and phi(xy)=phi(x)phi(y), where B is a ...
A Laurent polynomial with coefficients in the field F is an algebraic object that is typically expressed in the form ...+a_(-n)t^(-n)+a_(-(n-1))t^(-(n-1))+... ...
Low-dimensional topology usually deals with objects that are two-, three-, or four-dimensional in nature. Properly speaking, low-dimensional topology should be part of ...
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 random permutation is a permutation containing a fixed number n of a random selection from a given set of elements. There are two main algorithms for constructing random ...
A transformation consisting of a constant offset with no rotation or distortion. In n-dimensional Euclidean space, a translation may be specified simply as a vector giving ...
Related to or being the mathematically most simple case. More generally, the word "trivial" is used to describe any result which requires little or no effort to derive or ...
The Barnes G-function is an analytic continuation of the G-function defined in the construction of the Glaisher-Kinkelin constant G(n)=([Gamma(n)]^(n-1))/(H(n-1)) (1) for ...
1 ... 316|317|318|319|320|321|322 ... 649 Previous Next

...