Formula for the reflection length of elements in the group \(G(m,p,n)\). (Q2460816): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4398664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduced words and a length function for \(G(e,1,n)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668957 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certain imprimitive reflection groups and their generic versions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congruence classes of presentations for the complex reflection groups \(G(m,1,n)\) and \(G(m,m,n)\). / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congruence classes of presentations for the complex reflection groups \(G(m,p,n)\). / rank
 
Normal rank

Latest revision as of 13:09, 27 June 2024

scientific article
Language Label Description Also known as
English
Formula for the reflection length of elements in the group \(G(m,p,n)\).
scientific article

    Statements

    Formula for the reflection length of elements in the group \(G(m,p,n)\). (English)
    0 references
    0 references
    16 November 2007
    0 references
    Let \(G(m,p,n)\) be the reflection group consisting of all the \(n\times n\) monomial matrices \(w\) such that all the non-zero entries, say \(\theta_1,\dots,\theta_n\), of \(w\) are \(m\)-th roots of unity with \((\prod^n_{i=1}\theta_i)^{m/p}=1\), with \(p\in\{1,2,\dots,n\}\) and \(p\mid m\). The reflection length of \(w\), \(l_T(w)\), is the smallest possible number of factors among all such expressions. It is deduced a closed formula for the reflection length functions of the reflection group \(G(m,p,n)\). The formula is shown separately in three cases: \(p=1\), \(p=m\) and \(p\in\{2,\dots,m-1\}\).
    0 references
    0 references
    reflections
    0 references
    reflection groups
    0 references
    reflection lengths
    0 references
    length functions
    0 references
    0 references