Related papers: Length enumeration of fully commutative elements i…

For numerical semigroups with three generators, we study the asymptotic behavior of weighted factorization lengths, that is, linear functionals of the coefficients in the factorizations of semigroup elements. This work generalizes many…

There is a well-known classification of conjugacy classes of involutions in finite Coxeter groups, in terms of subsets of nodes of their Coxeter graphs. In many cases, the product of an involution with the longest element is again an…

The descent algebra of a finite Coxeter group $W$ is a basic algebra, and as such it has a presentation as quiver with relations. In recent work, we have developed a combinatorial framework which allows us to systematically compute such a…

An element $x$ of a group $G$ is a commutator if it can be expressed in the form $x = a^{-1}b^{-1}ab$ for some $a, b \in G$. In 2010 MacHale posed the following problem in the Kourovka notebook: does there exist a finite group $G$, with…

Generalized Baxter's TQ-relations and the QQ-system are systems of algebraic relations in the category O of representations of the Borel subalgebra of the quantum affine algebra U_q(g^), which we established in our earlier works…

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 W be an associative PI-algebra over a field F of characteristic zero. Suppose W is G-graded where G is a finite group. Let exp(W) and exp(W_e) denote the codimension growth of W and of the identity component W_e, respectively. The…

We consider the set of affine permutations that avoid a fixed permutation pattern. Crites has given a simple characterization for when this set is infinite. We find the generating series for this set using the Coxeter length statistic and…

Oftentimes the elements of a ring or semigroup $H$ can be written as finite products of irreducible elements, say $a=u_1 \cdot \ldots \cdot u_k = v_1 \cdot \ldots \cdot v_{\ell}$, where the number of irreducible factors is distinct. The set…

Let $(W,R)$ be an arbitrary Coxeter system. We determine the number of elements of $W$ that have a unique reduced expression.

This paper is a sequel to work of Dynkin on subroot lattices of root lattices and to work of Carter on presentations of Weyl group elements as products of reflections. The quotients $L/L_1$ are calculated for all irreducible root lattices…

A Coxeter group is said to be \emph{$\mathbf{a}(2)$-finite} if it has finitely many elements of $\mathbf{a}$-value 2 in the sense of Lusztig. In this paper, we give explicit combinatorial descriptions of the left, right, and two-sided…

We characterize group representations that factor through monomial representations, respectively, block-triangular representations with monomial diagonal blocks, by arithmetic properties. Similar results are obtained for semigroup…

In this paper, we introduce the notion of combinatorial Auslander-Reiten(AR) quiver for commutation classes $[\widetilde{w}]$ of $w$ in finite Weyl group. This combinatorial object visualizes the convex partial order…

For a finite Coxeter system and a subset of its diagram nodes, we define spherical elements (a generalization of Coxeter elements). Conjecturally, for Weyl groups, spherical elements index Schubert varieties in a flag manifold G/B that are…

An atomic monoid $M$ is called length-factorial if for every non-invertible element $x \in M$, no two distinct factorizations of $x$ into irreducibles have the same length (i.e., number of irreducible factors, counting repetitions). The…

We refine Brieskorn's study of the cohomology of the complement of the reflection arrangement of a finite Coxeter group $W$. As a result we complete the verification of a conjecture by Felder and Veselov that gives an explicit basis of the…

A group-word w is called concise if whenever the set of w-values in a group G is finite it always follows that the verbal subgroup w(G) is finite. More generally, a word w is said to be concise in a class of groups X if whenever the set of…

We begin with (densely-defined) fractional linear transformations (FLT) on (some) Banach algebras and their relatives. This leads to Wedderburn's continued fractions (recursively-defined noncommutative polynomials) for any ring. Along the…

For every quiver (valued) of finite representation type we define a finitely presented group called a picture group. This group is very closely related to the cluster theory of the quiver. For example, positive expressions for the Coxeter…