arXiv math/04034002004-03math.GR

Non-crossing partitions of type (e,e,r)

David Bessis, Ruth Corran

备注：: 38 pages, 15 figures; second version with extended introduction

英文摘要：

We investigate a new lattice of generalised non-crossing partitions, constructed using the geometry of the complex reflection group $G(e,e,r)$. For the particular case $e=2$ (resp. $r=2$), our lattice coincides with the lattice of simple elements for the type $D_n$ (resp. $I_2(e)$) dual braid monoid. Using this lattice, we construct a Garside structure for the braid group $B(e,e,r)$. As a corollary, one may solve the word and conjugacy problems in this group.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Structural properties of non-crossing partitions from algebraic and geometric perspectives

The present thesis studies structural properties of non-crossing partitions associated to finite Coxeter groups from both algebraic and geometric perspectives. On the one hand, non-crossing partitions are lattices, and on the other hand, we can view them as simplicial complexes by considering their order complexes. We make use of these different interpretations and their interactions in various ways. The order complexes of non-crossing partitions have a rich geometric structure, which we investigate in this thesis. In particular, we interpret them as subcomplexes of spherical buildings. From a…

2019-03-15math.COmath.GR

Cyclic sieving for generalised non-crossing partitions associated to complex reflection groups of exceptional type - the details

We prove that the generalised non-crossing partitions associated to well-generated complex reflection groups of exceptional type obey two different cyclic sieving phenomena, as conjectured by Armstrong, respectively by Bessis and Reiner. This manuscript accompanies the paper "Cyclic sieving for generalised non-crossing partitions associated to complex reflection groups of exceptional type" [arXiv:1001.0028], for which it provides the computational details.

2012-02-28math.COmath.GR

Geometrically Constructed Bases for Homology of Non-Crossing Partition Lattices

For any finite, real reflection group $W$, we construct a geometric basis for the homology of the corresponding non-crossing partition lattice. We relate this to the basis for the homology of the corresponding intersection lattice introduced by Björner and Wachs in \cite{BW} using a general construction of a generic affine hyperplane for the central hyperplane arrangement defined by $W$.

2008-07-15math.COmath.GR

Non-crossing partitions and Milnor fibers

For a finite real reflection group $W$ we use non-crossing partitions of type $W$ to construct finite cell complexes with the homotopy type of the Milnor fiber of the associated $W$-discriminant $Δ_W$ and that of the Milnor fiber of the defining polynomial of the associated reflection arrangement. These complexes support natural cyclic group actions realizing the geometric monodromy. Using the shellability of the non-crossing partition lattice, this cell complex yields a chain complex of homology groups computing the integral homology of the Milnor fiber of $Δ_W$.

2017-09-22math.ATmath.GR

On maximal chains in the non-crossing partition lattice

A weak order on the set of maximal chains of the non-crossing partition lattice is introduced and studied. A $0$-Hecke algebra action is used to compute the radius of the graph on these chains in which two chains are adjacent if they differ in exactly one element.

2013-12-23math.COmath.GR

Non-crossing partitions

Non-crossing partitions have been a staple in combinatorics for quite some time. More recently, they have surfaced (sometimes unexpectedly) in various other contexts from free probability to classifying spaces of braid groups. Also, analogues of the non-crossing partition lattice have been introduced. Here, the classical non-crossing partitions are associated to Coxeter and Artin groups of type $\mathsf{A}_n$, which explains the tight connection to the symmetric groups and braid groups. We shall outline those developments.

2019-03-04math.COmath.GRmath.PR

更多相关论文收起更多论文

Cyclic sieving for generalised non-crossing partitions associated to complex reflection groups of exceptional type

We present the proof of the cyclic sieving conjectures for generalised non-crossing partitions associated to well-generated complex reflection groups due to Armstrong, respectively to Bessis and Reiner, for the 26 exceptional well-generated complex reflection groups. The computational details are provided in the manuscript "Cyclic sieving for generalised non-crossing partitions associated to complex reflection groups of exceptional type - the details" [arXiv:1001.0030].

2012-02-28math.COmath.GR

Generalized non-crossing Partitions and Buildings

For any finite Coxeter group $W$ of rank $n$ we show that the order complex of the lattice of non-crossing partitions $\mathrm{NC}(W)$ embeds as a connected chamber subcomplex into a spherical building of type $A_{n-1}$. We use this to give a new proof of the fact that the non-crossing partition lattice in type $A_n$ is supersolvable for all $n$ and show that in case $B_n$, this is only the case if $n<4$. We also obtain a lower bound on the radius of the Hurwitz graph $H(W)$ in all types and re-prove that in type $A_n$ the radius is ${n \choose 2}$.

2018-05-23math.COmath.GR

Decomposition numbers for finite Coxeter groups and generalised non-crossing partitions

Given a finite irreducible Coxeter group $W$, a positive integer $d$, and types $T_1,T_2,...,T_d$ (in the sense of the classification of finite Coxeter groups), we compute the number of decompositions $c=\si_1\si_2 cdots\si_d$ of a Coxeter element $c$ of $W$, such that $\si_i$ is a Coxeter element in a subgroup of type $T_i$ in $W$, $i=1,2,...,d$, and such that the factorisation is "minimal" in the sense that the sum of the ranks of the $T_i$'s, $i=1,2,...,d$, equals the rank of $W$. For the exceptional types, these decomposition numbers have been computed by the first author. The type $A_n$ d…

2009-11-17math.COmath.GR

The $M$-triangle of generalised non-crossing partitions for the types $E_7$ and $E_8$

The $M$-triangle of a ranked locally finite poset $P$ is the generating function $\sum_{u,w\in P} ^{}μ(u,w) x^{\rk u}y^{\rk w}$, where $μ(.,.)$ is the Möbius function of $P$. We compute the $M$-triangle of Armstrong's poset of $m$-divisible non-crossing partitions for the root systems of type $E_7$ and $E_8$. For the other types except $D_n$ this had been accomplished in the earlier paper "The $F$-triangle of the generalised cluster complex." Altogether, this almost settles Armstrong's $F=M$ Conjecture predicting a surprising relation between the $M$-triangle of the $m$-divisible partitions po…

2006-10-25math.COmath.GR

Enumerative Properties of NC^B(p,q)

We determine the rank generating function, the zeta polynomial and the Moebius function for the poset NC^B(p,q) of annular non-crossing partitions of type B, where p and q are two positive integers. We give an alternative treatment of some of these results in the case q=1, for which this poset is a lattice. We also consider the general case of multiannular non-crossing partitions of type B, and prove that this reduces to the cases of non-crossing partitions of type B in the annulus and in the disc.

2008-11-20math.COmath.GR