Number of cyclically irreducible words in the alphabet of a free group of finite rank

  • Koganov L
  • 3


    Mendeley users who have this article in their library.
  • 0


    Citations of this article.


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.

Author-supplied keywords

  • Chromatic polynomial of a graph
  • Cyclically irreducible word
  • Proper word
  • Whitney formula for the chromatic polynomial of a simple cycle

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Lenya M. Koganov

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free