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).
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
EUR 2,25 per la spedizione in U.S.A.
Destinazione, tempi e costiEUR 7,65 per la spedizione in U.S.A.
Destinazione, tempi e costiDa: Best Price, Torrance, CA, U.S.A.
Condizione: New. SUPER FAST SHIPPING. Codice articolo 9789401055147
Quantità: 2 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 21689192-n
Quantità: 15 disponibili
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Condizione: New. Codice articolo ABLIING23Apr0412070055443
Quantità: Più di 20 disponibili
Da: Grand Eagle Retail, Mason, OH, U.S.A.
Paperback. Condizione: new. Paperback. 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). Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Codice articolo 9789401055147
Quantità: 1 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9789401055147_new
Quantità: Più di 20 disponibili
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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). 268 pp. Englisch. Codice articolo 9789401055147
Quantità: 2 disponibili
Da: moluna, Greven, Germania
Condizione: New. Codice articolo 5832204
Quantità: Più di 20 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition. Codice articolo 21689192
Quantità: 15 disponibili
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condizione: New. 2012. Paperback. . . . . . Codice articolo V9789401055147
Quantità: 15 disponibili
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. v + 261. Codice articolo 26142319650
Quantità: 4 disponibili