相关论文: Non-crossing partitions of type (e,e,r)
We use the theory of hyperplane arrangements to construct natural bases for the homology of partition lattices of types A, B and D. This extends and explains the "splitting basis" for the homology of the partition lattice given in [Wa96],…
We interpret noncrossing partitions of type $B$ and type $D$ in terms of noncrossing partitions of type $A$. As an application, we get type-preserving bijections between noncrossing and nonnesting partitions of type $B$, type $C$ and type…
We consider noncrossing partitions of [n] under the action of (i) the reflection group (of order 2), (ii) the rotation group (cyclic of order n) and (iii) the rotation/reflection group (dihedral of order 2n). First, we exhibit a bijection…
We prove an instance of the cyclic sieving phenomenon, occurring in the context of noncrossing parititions for well-generated complex reflection groups.
Consider the noncrossing set partitions of an $n$-element set which either do not contain the block $\{n-1,n\}$, or which do not contain the singleton block $\{n\}$ whenever $1$ and $n-1$ are in the same block. In this article we study the…
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…
The notion of noncrossing linked partition arose from the study of certain transforms in free probability theory. It is known that the number of noncrossing linked partitions of [n+1] is equal to the n-th large Schroder number $r_n$, which…
In this article we give a simple, almost uniform proof that the lattice of noncrossing partitions associated with a well-generated complex reflection group is lexicographically shellable. So far a uniform proof is available only for Coxeter…
In an earlier paper by three of the present authors and Csaba Schneider, it was shown that, for $m\ge2$, a set of $m+1$ partitions of a set $\Omega$, any $m$ of which are the minimal non-trivial elements of a Cartesian lattice, either form…
Garside calculus is the common mechanism that underlies a certain type of normal form for the elements of a monoid, a group, or a category. Originating from Garside's approach to Artin's braid groups, it has been extended to more and more…
In this paper, we extend the classical theory of crossed $G$-sets and the crossed Burnside ring from a finite group $G$ to a finite groupoid $\mathcal{G}$. We introduce a natural monoidal structure on the category of crossed…
In this paper, we investigate the classes of matroid intersection admitting a solution for the problem of partitioning the ground set $E$ into $k$ common independent sets, where $E$ can be partitioned into $k$ independent sets in each of…
We give an elementary, case-free, Coxeter-theoretic derivation of the formula $h^nn!/|W|$ for the number of maximal chains in the noncrossing partition lattice $NC(W)$ of a real reflection group $W$. Our proof proceeds by comparing the…
Birman, Ko and Lee have introduced a new monoid ${\cal B}^{*}_{n}$--with an explicit presentation--whose group of fractions is the $n$-strand braid group ${\cal B}_{n}$. Building on a new approach by Digne, Michel and himself, Bessis has…
Garside groups are a natural lattice-theoretic generalisation of the braid groups and spherical type Artin--Tits groups. Here we show that the class of Garside groups is closed under some free products with cyclic amalgamated subgroups. We…
In this paper we introduce a class of `parabolic' subgroups for the generalized braid group associated to an arbitrary irreducible complex reflection group, which maps onto the collection of parabolic subgroups of the reflection group.…
A partition on $[n]$ has a crossing if there exists $i\_1<i\_2<j\_1<j\_2$ such that $i\_1$ and $j\_1$ are in the same block, $i\_2$ and $j\_2$ are in the same block, but $i\_1$ and $i\_2$ are not in the same block. Recently, Chen et al.…
We investigate the role that non-crossing partitions play in the study of positroids, a class of matroids introduced by Postnikov. We prove that every positroid can be constructed uniquely by choosing a non-crossing partition on the ground…
In this paper, we introduce polynomial time algorithms that generate random $k$-noncrossing partitions and 2-regular, $k$-noncrossing partitions with uniform probability. A $k$-noncrossing partition does not contain any $k$ mutually…
We present a solution to the conjugacy decision problem and the conjugacy search problem in Garside groups, which is theoretically simpler than the usual one, with no loss of efficiency. This is done by replacing the well known cycling and…