Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
