Related papers: Odd length for even hyperoctahedral groups and sig…

Coxeter groups are a special class of groups generated by involutions. They play important roles in the various areas of mathematics. This survey particularly focuses on how one uses Coxeter groups to construct interesting examples of…

We study the generating function for the number of even (or odd) permutations on n letters containing exactly $r\gs0$ occurrences of 132. It is shown that finding this function for a given r amounts to a routine check of all permutations in…

A solution is proposed for the problem of composition of ordinary generating functions. A new class of functions that provides a composition of ordinary generating functions is introduced; main theorems are presented; compositae are written…

In this paper, we study geodesic growth of numbered graph products; these are a generalization of right-angled Coxeter groups, defined as graph products of finite cyclic groups. We first define a graph-theoretic condition called…

For well-generated complex reflection groups, Chapuy and Stump gave a simple product for a generating function counting reflection factorizations of a Coxeter element by their length. This is refined here to record the number of reflections…

If every element of a matrix group is similar to a permutation matrix, then it is called a permutation-like matrix group. References [4] and [5] showed that, if a permutation-like matrix group contains a maximal cycle of length equal to a…

Group cohomology of polynomial growth is defined for any finitely generated discrete group, using cochains that have polynomial growth with respect to the word length function. We give a geometric condition that guarantees that it agrees…

Stirling numbers, which count partitions of a set and permutations in the symmetric group, have found extensive application in combinatorics, geometry, and algebra. We study analogues and q-analogues of these numbers corresponding to the…

There exist a number of well known multiplicative generating functions for series of Schur functions. Amongst these are some related to the dual Cauchy identity whose expansion coefficients are rather simple, and in some cases periodic in…

Let (G,S) be a finitely generated Coxeter group, such that the Coxeter system is indecomposable and the canonical bilinear form is indefinite but non-degenerate. We show that the reduced C-*-algebra of G is simple with unique normalised…

We describe a new random greedy algorithm for generating regular graphs of high girth: Let $k\geq 3$ and $c \in (0,1)$ be fixed. Let $n \in \mathbb{N}$ be even and set $g = c \log_{k-1} (n)$. Begin with a Hamilton cycle $G$ on $n$ vertices.…

In any Coxeter group, the conjugates of elements in its Coxeter generating set are called reflections and the reflection length of an element is its length with respect to this expanded generating set. In this article we give a simple…

The paper investigates a significant part of the automorphic, in fact of the so-called Eisenstein cohomology of split odd orthogonal groups over Q. The main result provides a description of residual and regular Eisenstein cohomology classes…

We construct a family of right-angled Coxeter groups which provide counter-examples to questions about the stable boundary of a group, one-endedness of quasi-geodesically stable subgroups, and the commensurability types of right-angled…

We introduce a new invariant of finitely generated groups, the ambiguity function, and prove that every finitely generated acylindrically hyperbolic group has a linearly bounded ambiguity function. We use this result to prove that the…

In this paper, we study properties of random walks on finite groups and later use them to obtain the limiting braid length expectation and component number of braid closure in a model of random braids, which is constructed by lifting…

The present note considers a certain family of sums indexed by the set of fixed length compositions of a given number. The sums in question cannot be realized as weighted compositions. However they can be be related to the hypergeometric…

We are studying here the classical operator creating secondary polynomials associated with an orthogonal system for a continuous probability density function on a real interval. We know it is possible with the coupling of Stietjes…

We give a characterization of limits of dihedral groups in the space of finitely generated marked groups. We also describe the topological closure of dihedral groups in the space of marked groups on a fixed number of generators.

We study the countable set of rates of growth of a hyperbolic group with respect to all its finite generating sets. We prove that the set is well-ordered, and that every real number can be the rate of growth of at most finitely many…