NUMBER OF CYCLICALLY IRREDUCIBLE WORDS IN THE ALPHABET OF A FREE GROUP OF FINITE RANK

被引：0
|
作者：
Koganov, L. M. [1 ]
机构：
[1] Russian Acad Sci, Sci Ctr Nonliner Wave Mech & Technol, Moscow, Russia
来源：
CYBERNETICS AND SYSTEMS ANALYSIS | 2007年 / 43卷 / 04期
关键词：
cyclically irreducible word; proper word; chromatic polynomial of a graph; Whitney formula for the chromatic polynomial of a simple cycle;
D O I：
10.1007/s10559-007-0076-0
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
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 lambda are mutually deducible from one another when lambda = 2k. The necessary bijections differ for even and odd values of n.
引用
收藏
页码：499 / 506
页数：8
相关论文
共 50 条
12345