Search Results for ""
221 - 230 of 830 for Trivial representationSearch Results
A reduced root system is a root system R satisfying the additional property that, if alpha in R, then the only multiples of alpha in R are +/-alpha.
An Auslander algebra which connects the representation theories of the symmetric group of permutations and the general linear group GL(n,C). Schur algebras are ...
Every "large" even number may be written as 2n=p+m where p is a prime and m in P union P_2 is the set of primes P and semiprimes P_2.
Given a hereditary representation of a number n in base b, let B[b](n) be the nonnegative integer which results if we syntactically replace each b by b+1 (i.e., B[b] is a ...
The Killing form is an inner product on a finite dimensional Lie algebra g defined by B(X,Y)=Tr(ad(X)ad(Y)) (1) in the adjoint representation, where ad(X) is the adjoint ...
Consider a collection of diagonal matrices H_1,...,H_k, which span a subspace h. Then the ith eigenvalue, i.e., the ith entry along the diagonal, is a linear functional on h, ...
Given a complex measure mu, there exists a positive measure denoted |mu| which measures the total variation of mu, also sometimes called simply "total variation." In ...
Wolfram's iteration is an algorithm for computing the square root of a rational number 1<=r<4 using properties of the binary representation of r. The algorithm begins with ...
The term "bundle" is an abbreviated form of the full term fiber bundle. Depending on context, it may mean one of the special cases of fiber bundles, such as a vector bundle ...
Caesar's method is an encryption scheme involving shifting an alphabet (so a->c, b->d, c->e, d->f, etc., x->z,y->a,z->b). It is one of the most basic encryption methods, and ...
...
View search results from all Wolfram sites (8853 matches)

