相关论文: Non-crossing partitions of type (e,e,r)
The purpose of this note is to complete the study, begun in the first author's PhD thesis, of the topology of the poset of generalized noncrossing partitions associated to real reflection groups. In particular, we calculate the Euler…
We consider several subgroup-related algorithmic questions in groups, modeled after the classic computational lattice problems, and study their computational complexity. We find polynomial time solutions to problems like finding a subgroup…
The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…
We determine the structure of the cyclotomic Hecke algebra corresponding to the complex reflection group $G_{25}$ also when it is not semisimple, as long as the generators are diagonalizable. In particular, we classify all simple…
Generalised almost complex structures $\mathcal J$ on transitive Courant algebroids $E$ are studied in terms of their components with respect to a splitting $E\cong TM \oplus T^*M \oplus \mathcal G$, where $M$ denotes the base of $E$ and…
This thesis takes Brady's construction of $K(\pi,1)$s for the braid groups as a starting point. It is widely known that this construction can - with the right ingredients - be generalized to Artin groups of finite type. Results of Bessis as…
We study two families of lattices whose number of elements are given by the numbers in even (respectively odd) positions in the Fibonacci sequence. The even Fibonacci lattice arises as the lattice of simple elements of a Garside monoid…
We describe a simple scheme for constructing finitely generated monoids in which left-divisibility is a linear ordering and for practically investigating these monoids. The approach is based on subword reversing, a general method of…
We construct a family of links we call torus necklaces for which the link groups are precisely the braid groups of generalised $J$-reflection groups. Moreover, this correspondence exhibits the meridians of the aforementioned link groups as…
In his proof of the K(pi,1) conjecture for complex reflection arrangements, Bessis defined Garside categories suitable for studying braid groups of centralizers of Springer regular elements in well-generated complex reflection groups. We…
In the paper we study the algebroid A of the groupoid of partially invertible elements over the lattice of orthogonal projections of a $W^*$-algebra. In particular the complex analytic manifold structure of these objects is investigated.…
The Garside group, as a generalization of braid groups and Artin groups of finite types, is defined as the group of fractions of a Garside monoid. We show that the semidirect product of Garside monoids is a Garside monoid. We use the…
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…
We construct the lattice gauge theory of the group G_N, the semidirect product of the permutation group S_N with U(1)^N, on an arbitrary Riemann surface. This theory describes the branched coverings of a two-dimensional target surface by…
We compare two crossed homomorphisms on a braid group, one defined diagrammatically and the other defined algebraically. We show that these crossed homomorphisms are essentially the same, and compute them in detail for simple braids, namely…
In this paper we study partitions whose successive ranks belong to a given set. We enumerate such partitions while keeping track of the number of parts, the largest part, the side of the Durfee square, and the height of the Durfee…
The homology of a Garside monoid, thus of a Garside group, can be computed efficiently through the use of the order complex defined by Dehornoy and Lafont. We construct a categorical generalization of this complex and we give some…
The material gives a new combinatorial proof of the multiplicative property of the S-transform. In particular, several properties of the coefficients of its inverse are connected to non-crossing linked partitions and planar trees.
Following an idea of Gon\c{c}alvez, Guaschi and Ocampo on the usual braid group we construct crystallographic and Bieberbach groups as (sub)quotients of the generalized braid group associated to an arbitrary complex reflection group.
For any finite reductive group, we compute the central elements in its Hecke algebra that arise from partial Springer resolutions via the Harish-Chandra transform. Of the two kinds of partial resolution, the larger is the more interesting…