Topics in Computational Algebra

個数:

Topics in Computational Algebra

  • 提携先の海外書籍取次会社に在庫がございます。通常3週間で発送いたします。
    重要ご説明事項
    1. 納期遅延や、ご入手不能となる場合が若干ございます。
    2. 複数冊ご注文の場合は、ご注文数量が揃ってからまとめて発送いたします。
    3. 美品のご指定は承りかねます。

    ●3Dセキュア導入とクレジットカードによるお支払いについて
  • 【入荷遅延について】
    世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
    おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。
  • ◆画像の表紙や帯等は実物とは異なる場合があります。
  • ◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
    また、洋書販売価格は、ご注文確定時点での日本円価格となります。
    ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。
  • 製本 Paperback:紙装版/ペーパーバック版/ページ数 261 p.
  • 言語 ENG
  • 商品コード 9789401055147
  • DDC分類 512

Full Description

The main purpose of these lectures is first to briefly survey the fundamental con­ nection between the representation theory of the symmetric group Sn and the theory of symmetric functions and second to show how combinatorial methods that arise naturally in the theory of symmetric functions lead to efficient algorithms to express various prod­ ucts of representations of Sn in terms of sums of irreducible representations. That is, there is a basic isometry which maps the center of the group algebra of Sn, Z(Sn), to the space of homogeneous symmetric functions of degree n, An. This basic isometry is known as the Frobenius map, F. The Frobenius map allows us to reduce calculations involving characters of the symmetric group to calculations involving Schur functions. Now there is a very rich and beautiful theory of the combinatorics of symmetric functions that has been developed in recent years. The combinatorics of symmetric functions, then leads to a number of very efficient algorithms for expanding various products of Schur functions into a sum of Schur functions. Such expansions of products of Schur functions correspond via the Frobenius map to decomposing various products of irreducible representations of Sn into their irreducible components. In addition, the Schur functions are also the characters of the irreducible polynomial representations of the general linear group over the complex numbers GLn(C).

Contents

Branching Functions for Winding Subalgebras and Tensor Products.- Computing with Characters of Finite Groups.- Some Remarks on the Computation of Complements and Normalizers in Soluble Groups.- Methods for Computing in Algebraic Geometry and Commutative Algebra.- Combinatorial Algorithms for the Expansion of Various Products of Schur Functions.- Polynomial Identities for 2 x 2 Matrices.- Cayley Factorization and a Straightening Algorithm.- The Nagata-Higman Theorem.- Supersymmetric Bracket Algebra and Invariant Theory.- Aspects of Characteristic-Free Representation Theory of GLn, and Some Applications to Intertwining Numbers.

最近チェックした商品