Number of cyclically irreducible words in the alphabet of a free group of finite rank
It is shown that a formula that was independently obtained earlier for the number of cyclically irreducible words of length n in a symmetric alphabet of a finitely generated free group of rank k and the Whitney formula for a chromatic polynomial of a simple nonself-intersecting cycle of length n wit...
Gespeichert in:
| Veröffentlicht in: | Cybernetics and systems analysis 2007-07, Vol.43 (4), p.499-506 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | It is shown that a formula that was independently obtained earlier for the number of cyclically irreducible words of length n in a symmetric alphabet of a finitely generated free group of rank k and the Whitney formula for a chromatic polynomial of a simple nonself-intersecting cycle of length n with a variable ... are mutually deducible from one another when ... = 2k. The necessary bijections differ for even and odd values of n. (ProQuest: ... denotes formulae/symbols omitted) |
|---|---|
| ISSN: | 1060-0396 1573-8337 |
| DOI: | 10.1007/s10559-007-0076-0 |