Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Automata and growth functions of Coxeter groups
KTH, Superseded Departments, Mathematics.
2004 (English)Licentiate thesis, monograph (Other scientific)
Abstract [en]

The aim of this thesis is to study, in some detail,properties of growth functions and geodesic growth functionsfor Coxeter groups. To do this, we use the fact that allCoxeter groups, which can be defined by some simple rules on apresentation by generators and relators, are described byformal languages which satisfy rather strong finitaryconditions. By connecting the context of groups with that offormal languages and constructing finite state automata for thelanguages N(G, S) and L(G, S) we make explicit algorithmiccomputations of the corresponding growth functions of the groupG.

As a test-case we choose the subclass of triangle groups,which are defined in a purely geometric way as groups generatedby reflections with respect to the sides of a triangle. Thetheorems and the methods shown are however valid for allCoxeter groups. The construction of the automatons is based ona representation of a Coxeter group by linear transformationsacting on a vector space. The key notion here is that of a rootsystem. We demonstrate that the growth series and the growthseries of geodesics associated with a Coxeter system can bothbe given by rational expressions.

Triangle groups (except for a finite number) are naturallyorganized into a few infinite series, and we were able toperform our computations for these infinite series, with one orseveral parameter tending to infinity. We give graphicalrepresentations of the constructed automata as well as resultsof numerical computations of the corresponding growthfunctions.

Place, publisher, year, edition, pages
Stockholm: Matematik , 2004. , 77 p.
Series
Trita-MAT. MA, ISSN 1401-2278 ; 2004:12
Identifiers
URN: urn:nbn:se:kth:diva-1814ISBN: 91-7283-852-3 (print)OAI: oai:DiVA.org:kth-1814DiVA: diva2:7820
Available from: 2004-09-16 Created: 2004-09-16 Last updated: 2012-03-20

Open Access in DiVA

fulltext(481 kB)603 downloads
File information
File name FULLTEXT01.pdfFile size 481 kBChecksum MD5
002bf4ff6878e7e52a78413bad139625a7fa690946411f8c75578c3321ff1d1cef224b22
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Avasjö, Agneta
By organisation
Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 603 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 482 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf