Geometric Complexity Theory IV: Nonstandard Quantum Group for the Kronecker Problem

Geometric Complexity Theory IV: Nonstandard Quantum Group for the Kronecker Problem
Author :
Publisher : American Mathematical Soc.
Total Pages : 176
Release :
ISBN-10 : 9781470410117
ISBN-13 : 1470410117
Rating : 4/5 (117 Downloads)

Book Synopsis Geometric Complexity Theory IV: Nonstandard Quantum Group for the Kronecker Problem by : Jonah Blasiak

Download or read book Geometric Complexity Theory IV: Nonstandard Quantum Group for the Kronecker Problem written by Jonah Blasiak and published by American Mathematical Soc.. This book was released on 2015-04-09 with total page 176 pages. Available in PDF, EPUB and Kindle. Book excerpt: The Kronecker coefficient is the multiplicity of the -irreducible in the restriction of the -irreducible via the natural map , where are -vector spaces and . A fundamental open problem in algebraic combinatorics is to find a positive combinatorial formula for these coefficients. The authors construct two quantum objects for this problem, which they call the nonstandard quantum group and nonstandard Hecke algebra. They show that the nonstandard quantum group has a compact real form and its representations are completely reducible, that the nonstandard Hecke algebra is semisimple, and that they satisfy an analog of quantum Schur-Weyl duality.


Geometric Complexity Theory IV: Nonstandard Quantum Group for the Kronecker Problem Related Books

Geometric Complexity Theory IV: Nonstandard Quantum Group for the Kronecker Problem
Language: en
Pages: 176
Authors: Jonah Blasiak
Categories: Mathematics
Type: BOOK - Published: 2015-04-09 - Publisher: American Mathematical Soc.

GET EBOOK

The Kronecker coefficient is the multiplicity of the -irreducible in the restriction of the -irreducible via the natural map , where are -vector spaces and . A
Geometry and Complexity Theory
Language: en
Pages: 353
Authors: J. M. Landsberg
Categories: Computers
Type: BOOK - Published: 2017-09-28 - Publisher: Cambridge University Press

GET EBOOK

Two central problems in computer science are P vs NP and the complexity of matrix multiplication. The first is also a leading candidate for the greatest unsolve
Open Problems in Algebraic Combinatorics
Language: en
Pages: 382
Authors: Christine Berkesch
Categories: Mathematics
Type: BOOK - Published: 2024-08-21 - Publisher: American Mathematical Society

GET EBOOK

In their preface, the editors describe algebraic combinatorics as the area of combinatorics concerned with exact, as opposed to approximate, results and which p
Recent Developments in Algebraic and Combinatorial Aspects of Representation Theory
Language: en
Pages: 222
Authors: Vyjayanthi Chari
Categories: Mathematics
Type: BOOK - Published: 2013-11-25 - Publisher: American Mathematical Soc.

GET EBOOK

This volume contains the proceedings of the International Congress of Mathematicians Satellite Conference on Algebraic and Combinatorial Approaches to Represent
Reduced Fusion Systems over 2-Groups of Sectional Rank at Most 4
Language: en
Pages: 112
Authors: Bob Oliver
Categories: Mathematics
Type: BOOK - Published: 2016-01-25 - Publisher: American Mathematical Soc.

GET EBOOK

The author classifies all reduced, indecomposable fusion systems over finite -groups of sectional rank at most . The resulting list is very similar to that by G