Related papers: On generating functions and automata associated to…

Let C be a one- or two-sided Kazhdan--Lusztig cell in a Coxeter group (W,S), and let Reduced(C) denote the set of reduced expressions of all w in C, regarded as a language over the alphabet S. Casselman has conjectured that Reduced(C) is…

Reflection length and codimension of fixed point spaces induce partial orders on a complex reflection group. While these partial orders are of independent combinatorial interest, our investigation is motivated by a connection between the…

In this paper we discuss reflection groups and root systems, in particular non-crystallographic ones, and a Clifford algebra framework for both these concepts. A review of historical as well as more recent work on viral capsid symmetries…

We introduce the concept of hyperreflection groups, which are a generalization of Coxeter groups. We prove the Deletion and Exchange Conditions for hyperreflection groups, and we discuss special subgroups and fundamental sectors of…

Brink and Howlett have introduced a partial ordering, called dominance, on the positive roots in the Tits realization of Coxeter groups (Math. Ann. 296 (1993), 179--190). Recently a concept called $\infty$-height is introduced to each…

Reifegerste and independently, Petersen and Tenner studied a statistic $\mathrm{drops}()$ on permutations in $\mathfrak{S}_n$. Two other studied statistics on $\mathfrak{S}_n$ are $\mathrm{depth}$ and $\mathrm{exc}$. Using descents in ${\it…

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…

We prove that the Stanley--Reisner ideal of the Alexander dual of the subword complexes in Coxeter groups has linear quotients with respect to the lexicographical order of the minimal monomial generators. As a consequence, we obtain a…

In this paper, we study the generating function of cyclically fully commutative elements in Coxeter groups, which are elements such that any cyclic shift of theirs reduced decompositions remains a reduced expression of a fully commutative…

In a Coxeter group $W$, an element is fully commutative if any two of its reduced expressions can be linked by a series of commutation of adjacent letters. These elements have particularly nice combinatorial properties, and also index a…

For a rank two root system and a pair of nonnegative integers, using only elementary combinatorics we construct two posets. The constructions are uniform across the root systems A1+A1, A2, C2, and G2. Examples appear in Figures 3.2 and 3.3.…

For a finite Coxeter group, a subword complex is a simplicial complex associated with a pair (Q, \pi), where Q is a word in the alphabet of simple reflections, $\pi$ is a group element. We discuss the transformations of such a complex…

We study solutions of the parametric set-theoretic reflection equation from an algebraic perspective by employing recently derived generalizations of the familiar shelves and racks, called parametric (p)-shelves and racks. Generic…

Multitriangulations, and more generally subword complexes, yield a large family of simplicial complexes that are homeomorphic to spheres. Until now, all attempts to prove or disprove that they can be realized as convex polytopes faced major…

We compute explicit formulae for Dirichlet generating functions enumerating finite-dimensional irreducible complex representations of potent and saturable principal congruence subgroups of $\mathrm{SL}_4^m(\mathfrak{o})$ ($m\in\mathbb{N}$)…

In this paper we show that the Poisson analogue of the Noether's Problem has a positive solution for essentially all finite symplectic reflection groups - the analogue of complex reflection groups in the symplectic world. Our proofs are…

We continue our study of the representations of the Reflection Equation Algebra (=REA) on Hilbert spaces, focusing again on the REA constructed from the $R$-matrix associated to the standard $q$-deformation of $GL(N,\mathbb{C})$ for…

The characterization of orbits of roots under the action of a Coxeter element is a fundamental tool in the study of finite root systems and their reflection groups. This paper develops the analogous tool in the affine setting, adding detail…

Semidefinite relaxations are a powerful tool for approximately solving combinatorial optimization problems such as MAX-CUT and the Grothendieck problem. By exploiting a bounded rank property of extreme points in the semidefinite cone, we…

The set-theoretical reflection equation and its solutions, the reflection maps, recently introduced by two of the authors, is presented in general and then applied in the context of quadrirational Yang-Baxter maps. We provide a method for…