Related papers: Factorization problems in complex reflection group…

Consider the symmetric group $S_n$ acting as a reflection group on the polynomial ring $k[x_1, \ldots, x_n]$, where $k$ is a field such that Char$(k)$ does not divide $n!$. We use Higher Specht polynomials to construct matrix factorizations…

Chapuy and Stump have given a nice generating series for the number of factorisations of a Coxeter element as a product of reflections. Their method is to evaluate case by case a character-theoretic expression. The goal of this note is to…

A permutation representation of a Coxeter group $W$ naturally defines an absolute order. This family of partial orders (which includes the absolute order on $W$) is introduced and studied in this paper. Conditions under which the associated…

Let W be a finite group generated by unitary reflections and A be the set of reflecting hyperplanes. We will give a characterization of the logarithmic differential forms with poles along A in terms of anti-invariant differential forms. If…

In symmetric groups, studies of permutation factorizations or triples of permutations satisfying certain conditions have a long history. One particular interesting case is when two of the involved permutations are long cycles, for which…

We survey results on factorizations of non zero-divisors into atoms (irreducible elements) in noncommutative rings. The point of view in this survey is motivated by the commutative theory of non-unique factorizations. Topics covered include…

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…

Let $V$ be a vector space endowed with a non-degenerate quadratic form $Q$. If the base field $\mathbb{F}$ is different from $\mathbb{F}_2$, it is known that every isometry can be written as a product of reflections. In this article, we…

Factorizations over cones and their duals play central roles for many areas of mathematics and computer science. One of the reasons behind this is the ability to find a representation for various objects using a well-structured family of…

We refine Brink's theorem, that the non-reflection part of a reflection centralizer in a Coxeter group W is a free group. We give an explicit set of generators for centralizer, which is finitely generated when W is. And we give a method for…

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…

For Coxeter groups with sufficiently large braid relations, we prove that the sequence of powers of a Coxeter element has unbounded reflection length. We establish a connection between the reflection length functions on arbitrary Coxeter…

We enumerate Hurwitz orbits of shortest reflection factorizations of an arbitrary element in the infinite family $G(m, p, n)$ of complex reflection groups. As a consequence, we characterize the elements for which the action is transitive…

We study arithmetic properties of factorizations of elements into products of generators, in monoids given with explicit presentations. After relating and comparing this perspective to the more usual approach of factoring into products of…

In [APS], the authors characterize the partitions of $n$ whose corresponding representations of $S_n$ have nontrivial determinant. The present paper extends this work to all irreducible finite Coxeter groups $W$. Namely, given a nontrivial…

Factorization models express a statistical object of interest in terms of a collection of simpler objects. For example, a matrix or tensor can be expressed as a sum of rank-one components. However, in practice, it can be challenging to…

In a finite real reflection group, the reflection length of each element is equal to the codimension of its fixed space, and the two coincident functions determine a partial order structure called the absolute order. In complex reflection…

We consider GL_n(F_q)-analogues of certain factorization problems in the symmetric group S_n: rather than counting factorizations of the long cycle (1, 2, ..., n) given the number of cycles of each factor, we count factorizations of a…

We establish recursions counting various classes of chains in the noncrossing partition lattice of a finite Coxeter group. The recursions specialize a general relation which is proven uniformly (i.e. without appealing to the classification…

In a seminal work, Bessis gave a geometric interpretation of the noncrossing lattice $NC(W)$ associated to a well-generated complex reflection group $W$. Chief component of this was the trivialization theorem, a fundamental correspondence…