Coincidences between intervals in two partial orders on complex reflection groups (Q7008562)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 8015277
Language Label Description Also known as
default for all languages
No label defined
    English
    Coincidences between intervals in two partial orders on complex reflection groups
    scientific article; zbMATH DE number 8015277

      Statements

      Coincidences between intervals in two partial orders on complex reflection groups (English)
      0 references
      0 references
      0 references
      21 March 2025
      0 references
      This paper investigates two natural partial orders defined on finite complex reflection groups: one via reflection length and the other via fixed space codimension. In real reflection groups, the two coincide; in complex reflection groups, they generally differ. The authors characterize the elements in the infinite family \(G(m,p,n)\) for which the intervals below a given group element \(w\) in these two posets coincide.\N\NMore precisely, given a complex reflection group \(G\) and an element \(w \in G\), one defines two subadditive functions: the reflection length \(\ell_R(w)\) and the codimension of the fixed space of \(w\). Each induces a partial order defined by \(x \leq y\) if \(x \leq y\) if \(\ell(x) + \ell(x^{-1}y) = \ell(y)\). The intervals \([\mathrm{id}, w]_R\) and \([\mathrm{id}, w]_{\mathrm{cdf}}\) are then the sets of elements below \(w\) in these two orders.\N\NThe main result (Theorem 1.1) gives necessary and sufficient conditions for equality of the two intervals in \(G(m,p,n)\): namely, (1) the multiset of nonzero cycle weights of \(w\) can be partitioned into pairs summing to zero; and (2) every subset of cycle weights summing to \(0 \mod p\) decomposes into singleton weights divisible by \(p\) and such pairs.\N\NThe authors use detailed combinatorial models of elements in \(G(m,p,n)\) (based on cycles and weights), and build on earlier work by \textit{J. Shi} [J. Algebra 316, No. 1, 284--296 (2007; Zbl 1142.20023)] and others on reflection length. They show how these conditions ensure that the reflection length of each element \(u \leq w\) matches the codimension of its fixed space. The proof is constructive and employs a recursive argument via cycle partitions.\N\NIn the final section, the authors relate these results to the structure of Garside categories and dual presentations of complex braid groups, and explore the heritability of the equality property across subintervals. Connections to permutation statistics and subadditive functions are discussed.
      0 references
      0 references
      absolute order
      0 references
      complex reflection group
      0 references
      reflection length
      0 references
      symmetric group
      0 references
      permutation statistics
      0 references
      partially ordered set
      0 references
      dual reflection presentation
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references