Related papers: Generating series of cyclically fully commutative …

We prove that under a symmetry assumption all cocycles on Hopf *-algebras arise from generating functionals. This extends earlier results of R.Vergnioux and D.Kyed and has two quantum group applications: all quantum L\'evy processes with…

This paper introduces the concept of a generating set for stochastic matrices -- a subset of matrices whose repeated composition generates the entire set. Understanding such generating sets requires specifying the "indivisible elements" and…

Let $d(G)$ be the smallest cardinality of a generating set of a finite group $G.$ We give a complete classification of the finite groups with the property that, whenever $ \langle x_1, \dots, x_{d(G)} \rangle = \langle y_1, \dots, y_{d(G)}…

A ring $\Lambda$ is called right K\"othe if every right $\Lambda$-module is a direct sum of cyclic modules. In this paper, we give a characterization of basic hereditary right K\"othe rings in terms of their Coxeter valued quivers. Also we…

Let $p$ be a prime number, $F$ a field of characteristic $p$, and $G$ a cyclic group of order $q =p^a$ for some positive integer $a$. Under these circumstances every indecomposable $F G$-module is cyclic. For indecomposable $F G$-modules…

Uhlenbeck proved that a set of simple elements generates the group of rational loops in GL(n,C) that satisfy the U(n)-reality condition. For an arbitrary complex reductive group, a choice of representation defines a notion of rationality…

We study $c$-preprojective roots for a Coxeter element $c$ of infinite Coxeter group $W$. In particular, we consider the case when any positive root is $c$-preprojective for some Coxeter element $c$. In this paper, by assuming that the…

A model for a finite group is a set of linear characters of subgroups that can be induced to obtain every irreducible character exactly once. A perfect model for a finite Coxeter group is a model in which the relevant subgroups are the…

Shephard groups are common generalizations of Coxeter groups, Artin groups, and graph products of cyclic groups. Their definition is similar to that of a Coxeter group, but generators may have arbitrary order rather than strictly order 2.…

We enumerate traceless square matrices over finite quotients of compact discrete valuation rings by their image sizes. We express the associated rational generating functions in terms of statistics on symmetric and hyperoctahedral groups,…

For a Coxeter group (W,S), a permutation of the set S is called a Coxeter word and the group element represented by the product is called a Coxeter element. Moving the first letter to the end of the word is called a rotation and two Coxeter…

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…

We show that a unital ring is generated by its commutators as an ideal if and only if there exists a natural number $N$ such that every element is a sum of $N$ products of pairs of commutators. We show that one can take $N \leq 2$ for…

Consider any sequence of finite groups $A^t$, where $t$ takes values in an integer index set $\mathbf{Z}$. A group system $A$ is a set of sequences with components in $A^t$ that forms a group under componentwise addition in $A^t$, for each…

We use polyhedral product models to analyse the structure of the commutator subgroup of a right-angled Artin group. In particular, we provide a minimal set of generators for the commutator subgroup, consisting of special iterated…

Let $(W,S)$ be a Coxeter system and suppose that $w \in W$ is fully commutative (in the sense of Stembridge) and has a reduced expression beginning (respectively, ending) with $s \in S$. If there exists $t\in S$ such that $s$ and $t$ do not…

We study the family of rational sets of words, called completely reducible and which are such that the syntactic representation of their characteristic series is completely reducible. This family contains, by a result of Reutenauer, the…

In this paper, we inspect a relatively unexplored notion of finite generation in semirings, namely semirings in which all congruences are finitely generated. Such semirings are dubbed Congruence Noetherian. After developing sufficient…

We show that every finite simple group is generated invariably by a Sylow subgroup and a cyclic group. It follows that that the order complex of the coset poset of an arbitrary finite group has nontrivial reduced rational homology.

Assuming standard conjectures, we show that the canonical symmetrizing trace evaluated at powers of a Coxeter element produces rational Catalan numbers for irreducible spetsial complex reflection groups. This extends a technique used by…