Combinatorics of Coxeter Groups / Bjorner, Anders (2005)  

Público ISBD Título : Combinatorics of Coxeter Groups Tipo de documento: documento electrónico Autores: Bjorner, Anders ; SpringerLink (Online service) ; Brenti, Francesco Editorial: Berlin, Heidelberg : Springer Berlin Heidelberg Fecha de publicación: 2005 Colección: Graduate Texts in Mathematics, ISSN 0072-5285 num. 231 Número de páginas: XIV, 366 p Il.: online resource ISBN/ISSN/DL: 978-3-540-27596-1 Idioma : Inglés (eng) Palabras clave: Mathematics  Group  theory  Topological  groups  Lie  Combinatorics  Groups,  Groups  Theory  and  Generalizations Clasificación: 51 Matemáticas Resumen: 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 Nota de contenido: I -- 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 En línea: http://dx.doi.org/10.1007/3-540-27596-7 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=35283 Combinatorics of Coxeter Groups [documento electrónico] / Bjorner, Anders ; SpringerLink (Online service) ; Brenti, Francesco . - Berlin, Heidelberg : Springer Berlin Heidelberg, 2005 . - XIV, 366 p : online resource. - (Graduate Texts in Mathematics, ISSN 0072-5285; 231) . ISBN : 978-3-540-27596-1 Idioma : Inglés (eng) Palabras clave: Mathematics  Group  theory  Topological  groups  Lie  Combinatorics  Groups,  Groups  Theory  and  Generalizations Clasificación: 51 Matemáticas Resumen: 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 Nota de contenido: I -- 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 En línea: http://dx.doi.org/10.1007/3-540-27596-7 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=35283

Ejemplares

Signatura	Medio	Ubicación	Sub-localización	Sección	Estado
ningún ejemplar