Abstract. Schur functions provide an integral basis of the ring of symmetric functions. It is shown that this ring has a natural Hopf algebra structure by identifying the appropriate product, coproduct, unit, counit and antipode, and their properties. Characters of covariant tensor irreducible representations of the classical groups GL(n), O(n) and Sp(n) are then expressed in terms of Schur fun...

Title ofprogram: Schur Method of solution A new backtracking algorithm [1] is implemented to generate Catalogue number: AAMJ the partitions that appear in the expansion of a product of Schur functions. Program obtainable from: CPC Program Library, Queen’s University of Belfast, N. Ireland (see application form in this issue) Restrictions on the complexity of the problem The size of the problem ...

in which cases either f(x) is irreducible or f(x) is the product of two irreducible polynomials of equal degree. If |an| = n > 1, then for some choice of a1, . . . , an−1 ∈ Z and a0 = ±1, we have that f(x) is reducible. I. Schur (in [8]) obtained this result in the special case that an = ±1. Further results along the nature of Theorem 1 are also discussed in [6]. The purpose of this paper is to...

We classify all multiplicity-free products of Schur functions and all multiplicity-free products of characters of SL(n; C). 0. Introduction In this paper, we classify the products of Schur functions that are multiplicity-free; i.e., products for which every coeecient in the resulting Schur function expansion is 0 or 1. We also solve the slightly more general classiication problem for Schur func...

Kronecker coefficients are the multiplicities in the tensor product decomposition of two irreducible representations of the symmetric group Sn. They can also be interpreted as the coefficients of the expansion of the internal product of two Schur polynomials in the basis of Schur polynomials. We show that the problem KRONCOEFF of computing Kronecker coefficients is very difficult. More specific...

We give formulae for computing Kronecker coefficients occurring in the expansion of sμ ∗ sν , where both μ and ν are nearly rectangular, and have smallest parts equal to either 1 or 2. In particular, we study s(n,n−1,1) ∗ s(n,n), s(n−1,n−1,1) ∗ s(n,n−1), s(n−1,n−1,2) ∗ s(n,n), s(n−1,n−1,1,1) ∗ s(n,n) and s(n,n,1) ∗ s(n,n,1). Our approach relies on the interplay between manipulation of symmetric...

We prove an explicit formula for the tensor product with itself of an irreducible complex representation of the symmetric group defined by a rectangle of height two. We also describe part of the decomposition for the tensor product of representations defined by rectangles of heights two and four. Our results are deduced, through Schur-Weyl duality, from the observation that certain actions on t...

Considering the Euclidean Jordan algebra of the real symmetric matrices endowed with the Jordan product and the inner product given by the usual trace of matrices, we construct an alternating Schur series with an element of the Jordan frame associated to the adjacency matrix of a strongly regular graph. From this series we establish necessary conditions for the existence of strongly regular gra...