Combinatorics of Coxeter Groups

Lieferzeit: Lieferbar innerhalb 14 Tagen

106,99 €

inkl. 7 % MwSt. zzgl. Versandkosten

Graduate Texts in Mathematics 231

ISBN: 3540442383
ISBN 13: 9783540442387
Autor: Bjorner, Anders/Brenti, Francesco
Verlag: Springer Verlag GmbH
Umfang: xiv, 366 S.
Erscheinungsdatum: 31.05.2005
Auflage: 1/2005
Format: 2.2 x 24.2 x 16
Gewicht: 657 g
Produktform: Gebunden/Hardback
Einband: GEB

Coxeter groups are of central importance in several areas of algebra, geometry, and combinatorics. This clear and rigorous exposition focuses on the combinatorial aspects of Coxeter groups, such as reduced expressions, partial order of group elements, enumeration, associated graphs and combinatorial cell complexes, and connections with combinatorial representation theory. While Coxeter groups have already been exposited from algebraic and geometric perspectives, this text is the first one to focus mainly on the combinatorial aspects of Coxeter groups. The first part of the book provides a self-contained introduction to combinatorial Coxeter group theory. The emphasis here is on the combinatorics of reduced decompositions, Bruhat order, weak order, and some aspects of root systems. The second part deals with more advanced topics, such as Kazhdan-Lusztig polynomials and representations, enumeration, and combinatorial descriptions of the classical finite and affine Weyl groups. A wide variety of exercises, ranging from easy to quite difficult are also included. The book will serve graduate students as well as researchers. Anders Björner is Professor of Mathematics at the Royal Institute of Technology in Stockholm, Sweden. Francesco Brenti is Professor of Mathematics at the University of Rome.

Artikelnummer: 1986350 Kategorie:

Beschreibung

InhaltsangabeI.- The basics.- Bruhat order.- Weak order and reduced words.- Roots, games, and automata.- II.- Kazhdan-Lusztig and R-polynomials.- Kazhdan-Lusztig representations.- Enumeration.- Combinatorial Descriptions.

Inhaltsverzeichnis

Foreword.- The Basics.- Bruhat order.- Weak order and reduced words.- Roots, games and automata.- Kazhdan-Lusztig and R-polynomials.- Kazhdan-Lusztig representations.- Enumeration.- Combinatorial descriptions.- Appendices.- Bibliography.- Index.

Das könnte Ihnen auch gefallen …