Related papers: Recurrence Relations for Cosets in Free Groups

In this paper we show how string rewriting methods can be applied to give a new method of computing double cosets. Previous methods for double cosets were enumerative and thus restricted to finite examples. Our rewriting methods do not…

On etudie divers aspects d'une formule qui compte les reflexions pleines dans les groupes de Coxeter finis. ***** We study several points about a formula which counts reflexions in a finite Coxeter group whose reduced decompositions involve…

Let $G$ be a finite additive abelian group with exponent $n$ and $S=g_{1}\cdots g_{t}$ be a sequence of elements in $G$. For any element $g$ of $G$ and $A\subseteq\{1,2,\ldots,n-1\}$, let $N_{A,g}(S)$ denote the number of subsequences…

Given any generating set of any pseudo-Anosov-containing subgroup of the mapping class group of a surface, we construct a pseudo-Anosov with word length bounded by a constant depending only on the surface. More generally, in any subgroup G…

Non-negative elements in group algebras play a crucial role in the study of functions, measures and operators. This paper focuses on the sum of Hermitian squares (SOHS) of non-negative elements in group algebras of finite groups. We first…

The classic string indexing problem is to preprocess a string S into a compact data structure that supports efficient pattern matching queries. Typical queries include existential queries (decide if the pattern occurs in S), reporting…

A set $\mathcal{A}$ is said to be an additive $h$-basis if each element in $\{0,1,\ldots,hn\}$ can be written as an $h$-sum of elements of $\mathcal{A}$ in {\it at least} one way. We seek multiple representations as $h$-sums, and, in this…

In this paper, we investigate certain generalizations of Camina pairs. Let $H$ be a nontrivial proper subgroup of a finite group $G$. We first show that every nontrivial irreducible complex character of $H$ induces homogeneously to $G$ if…

We show that the following problems are decidable in a rank 2 free group F_2: does a given finitely generated subgroup H contain primitive elements? and does H meet the orbit of a given word u under the action of G, the group of…

We give formulas for the second and third integral homology of an arbitrary finitely generated Coxeter group, solely in terms of the corresponding Coxeter diagram. The first of these calculations refines a theorem of Howlett, while the…

We define parabolic quasi-Coxeter elements in well generated complex reflection groups. We characterize them in multiple natural ways, and we study two combinatorial objects associated with them: the collections $\operatorname{Red}_W(g)$ of…

The action of a finite reflection group (type A) on its set of roots is understood as a permutation representation or group action. We show that this representation is an induced representation from a certain kind of parabolic subgroup.…

We construct two finite groups of size $2^{365}\cdot 3^{105}\cdot 7^{104}$: a solvable group $G$ and a non-solvable group $H$, such that for every integer $n$ the groups have the same number of elements of order $n$. This answers a question…

Let $F_n$ be the free group of a finite rank $n$. We study orbits $Orb_{\phi}(u)$, where $u$ is an element of the group $F_n$, under the action of an automorphism $\phi$. If an orbit like that is finite, we determine precisely what its…

We show that for each element $g$ of a Garside group, there exists a positive integer $m$ such that $g^m$ is conjugate to a periodically geodesic element $h$, an element with $|h^n|_\D=|n|\cdot|h|_\D$ for all integers $n$, where $|g|_\D$…

This paper studies a subset of the free semi-group $F_k$ with letters in a field $k$ which has some interesting arithmetic and combinatorial properties.

We consider the structure of a finite groups having a normal series whose factors have bicyclic Sylow subgroups. In particular, we investigated groups of odd order and $A_4$-free groups with this property. Exact estimations of the derived…

We describe an algorithm that computes the index of a finitely generated subgroup in a finitely $L$-presented group provided that this index is finite. This algorithm shows that the subgroup membership problem for finite index subgroups in…

Let $<X>$ be the free monoid on a generating set $X$, and suppose one adjoins to $<X>$ universal 2-sided inverses to a finite set $S$ of its elements. We note an elementary algorithm which yields a normal form for elements of the resulting…

We consider the complexity of Green's relations when the semigroup is given by transformations on a finite set. Green's relations can be defined by reachability in the (right/left/two-sided) Cayley graph. The equivalence classes then…