✦ LIBER ✦

Some Combinatorial Results for Complex Reflection Groups

✍ Scribed by H. Can

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 160 KB
Volume: 19
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.1998.0236

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, we prove that a simple system for a subsystem of the complex root system can always be chosen as a subset of the positive system + of . Furthermore, we show that a set of distinguished coset representatives can be found for every reflection subgroup of the complex reflection groups. The corresponding results for real crystallographic root systems and their reflection groups (i.e., Weyl groups) are well known (see [9]).

📜 SIMILAR VOLUMES

Some Graded Representations of the Compl

Some Graded Representations of the Complex Reflection Groups

✍ Edward E. Allen 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 282 KB

Some Complexity Results for Polynomial I

Some Complexity Results for Polynomial Ideals

✍ Ernst W. Mayr 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 184 KB

In this paper, we survey some of our new results on the complexity of a number of problems related to polynomial ideals. We consider multivariate polynomials over some ring, like the integers or the rationals. For instance, a polynomial ideal membership problem is a (w + 1)-tuple P = ( f, g 1 , g 2

Poincaré Series on Symmetric and Alterna

Poincaré Series on Symmetric and Alternating Tensors for Irreducible Representations of Imprimitive Complex Reflection Groups

✍ K. Koike 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 336 KB