Combinatorics of Coxeter Groups

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

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.

Author(s): Anders Bjorner, Francesco Brenti (auth.)
Series: Graduate Texts in Mathematics 231
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2005

Language: English
Pages: 366
City: New York, NY
Tags: Topological Groups, Lie Groups; Group Theory and Generalizations; Combinatorics

The basics....Pages 1-25
Bruhat order....Pages 27-64
Weak order and reduced words....Pages 65-88
Roots, games, and automata....Pages 89-130
Kazhdan-Lusztig and R -polynomials....Pages 131-172
Kazhdan-Lusztig representations....Pages 173-200
Enumeration....Pages 201-244
Combinatorial Descriptions....Pages 245-294