Search Results for ""
10371 - 10380 of 13131 for booleanalgebra.htmlSearch Results

A functor which defines an equivalence of module categories.
The p×p square matrix formed by setting s_(ij)=xi^(ij), where xi is a pth root of unity. The Schur matrix has a particularly simple determinant given by ...
A property of finite simple groups which is known for all such groups.
The Schur number S(k) is the largest integer n for which the interval [1,n] can be partitioned into k sum-free sets (Fredricksen and Sweet 2000). S(k) is guaranteed to exist ...
The Schur polynomials are a class of orthogonal polynomials. They are a special case of the Jack polynomials corresponding to the case alpha=1.
For p(z)=a_nz^n+a_(n-1)z^(n-1)+...+a_0, (1) polynomial of degree n>=1, the Schur transform is defined by the (n-1)-degree polynomial Tp(z) = a^__0p(z)-a_np^*(z) (2) = ...
Let A=a_(ij) be an n×n matrix with complex (or real) entries and eigenvalues lambda_1, lambda_2, ..., lambda_n, then sum_(i=1)^n|lambda_i|^2<=sum_(i,j=1)^n|a_(ij)|^2 (1) ...
There are at least two statements known as Schur's lemma. 1. The endomorphism ring of an irreducible module is a division algebra. 2. Let V, W be irreducible (linear) ...
Schur's partition theorem lets A(n) denote the number of partitions of n into parts congruent to +/-1 (mod 6), B(n) denote the number of partitions of n into distinct parts ...
Schur (1916) proved that no matter how the set of positive integers less than or equal to |_n!e_| (where |_x_| is the floor function) is partitioned into n classes, one class ...

...