2017
DOI: 10.1080/00927872.2017.1324872
|View full text |Cite
|
Sign up to set email alerts
|

The BMR freeness conjecture for the tetrahedral and octahedral families

Abstract: We prove the validity of the freeness conjecture of Broué, Malle and Rouquier for the generic Hecke algebras associated to the exceptional complex reflection groups of rank 2 belonging to the tetrahedral and octahedral families, and we give a description of the basis similar to the classical case of the finite Coxeter groups.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
31
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 17 publications
(32 citation statements)
references
References 26 publications
1
31
0
Order By: Relevance
“…Note that, since the generators of G 13 are of order 2 and belong to two different conjugacy classes, H(G 13 ) depends on four parameters a, b, c and d; among them, only b and d are units in R(G 13 ). In [Cha1], the second author proved the BMR freeness conjecture for G 13 by providing the following explicit basis for H(G 13 ):…”
Section: Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…Note that, since the generators of G 13 are of order 2 and belong to two different conjugacy classes, H(G 13 ) depends on four parameters a, b, c and d; among them, only b and d are units in R(G 13 ). In [Cha1], the second author proved the BMR freeness conjecture for G 13 by providing the following explicit basis for H(G 13 ):…”
Section: Resultsmentioning
confidence: 99%
“…It is entirely possible to do all these calculations by hand -examples are provided in the Appendix. Actually, the second author has done all these calculations by hand in order to prove the BMR freeness conjecture for G 13 in [Cha1], without however keeping track of the explicit coefficients. Since the calculations are time-consuming and mistakes can be made when computing the coefficients, we created a computer program in the language C++ whose purpose was to produce the desired linear combination for every product b i b j , with b i ∈ {u, s, t}, using the methodology described below and illustrated in the examples found in the Appendix.…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…This conjecture is currently known for all irreducible complex reflection groups except G 17 , ..., G 21 (according to the Shephard-Todd classification), and there is a hope that these cases can be proved as well using a sufficiently powerful computer (see [Cha1,Cha2] and [M3] for more details). Also, it is shown in [BMR] that to prove the conjecture, it suffices to show that H(W ) is spanned by |W | elements.…”
Section: The Main Resultsmentioning
confidence: 99%