The overall goal of this paper is to give a method of computing out how many words of length n there are for any Coxeter group via its Brink-Howlett automaton. [6] [7] To build our automaton, we focus on Coxeter systems and root systems honing in on a special set of roots called the small roots. We follow closely [1] [5] for the first two chapters. Finally, we build the Brink-Howlett automaton through literature compiled through the years and present explicit examples of A?1 and the Coxeter group on three generators which each pair of generators is in a free relation with one another
It is a long standing conjecture that the problem of deciding whether a quadratic word equation has ...
28 pagesInternational audienceIn this article, we give the multivariate generating function counting...
In this paper we explore some connections between some combinatorial properties of words and the stu...
Stanley's formula for the number of reduced expressions of a permutation regarded as a Coxeter group...
AbstractLet r(w) denote the number of reduced words for an element w in a Coxeter group W. Stanley p...
The topic of this thesis is the combinatorial structure of the set of reduced expressions in infinit...
The purpose of this note is to present a condition for the power of a Coxeter element of mathfrak{S}...
AbstractGiven a language L and a non-deterministic finite automaton M, we consider whether we can de...
Let (W,R) be an arbitrary Coxeter system. We determine the number of elements of W that have a uniqu...
AbstractCertain classes of infinite groups arising from geometry and topology are known to have solv...
A Coxeter system consists of a group W (called a Coxeter group) generated by a set S of involutions ...
We discuss the theory of certain partially ordered sets that capture the structure of commutation cl...
Abstract(1) The Poincaré polynomials of the finite irreducible Coxeter groups are derived by an elem...
We introduce a new method for computing the word length of an element of Thompson\u27s group F with ...
Abstract. We examine the relationship between the complexity of the word problem for a presentation ...
It is a long standing conjecture that the problem of deciding whether a quadratic word equation has ...
28 pagesInternational audienceIn this article, we give the multivariate generating function counting...
In this paper we explore some connections between some combinatorial properties of words and the stu...
Stanley's formula for the number of reduced expressions of a permutation regarded as a Coxeter group...
AbstractLet r(w) denote the number of reduced words for an element w in a Coxeter group W. Stanley p...
The topic of this thesis is the combinatorial structure of the set of reduced expressions in infinit...
The purpose of this note is to present a condition for the power of a Coxeter element of mathfrak{S}...
AbstractGiven a language L and a non-deterministic finite automaton M, we consider whether we can de...
Let (W,R) be an arbitrary Coxeter system. We determine the number of elements of W that have a uniqu...
AbstractCertain classes of infinite groups arising from geometry and topology are known to have solv...
A Coxeter system consists of a group W (called a Coxeter group) generated by a set S of involutions ...
We discuss the theory of certain partially ordered sets that capture the structure of commutation cl...
Abstract(1) The Poincaré polynomials of the finite irreducible Coxeter groups are derived by an elem...
We introduce a new method for computing the word length of an element of Thompson\u27s group F with ...
Abstract. We examine the relationship between the complexity of the word problem for a presentation ...
It is a long standing conjecture that the problem of deciding whether a quadratic word equation has ...
28 pagesInternational audienceIn this article, we give the multivariate generating function counting...
In this paper we explore some connections between some combinatorial properties of words and the stu...