Search Results for ""

As shown by Schur (1916), the Schur number S(n) satisfies S(n)<=R(n)-2 for n=1, 2, ..., where R(n) is a Ramsey number.

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 ...

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.

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 ...

The Schur decomposition of a complex square matrix A is a matrix decomposition of the form Q^(H)AQ=T=D+N, (1) where Q is a unitary matrix, Q^(H) is its conjugate transpose, ...

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) ...

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) = ...

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 ...

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 ...