加载中…
Long, Reid, and Thistlewaite have shown that some groups generated by representations of the triangle group in are thin, while the status of others is unknown. In this paper we take a new approach: for each group we introduce a new graph that captures information about representations of in the group. We provide examples of our graph for a variety of groups, and we use information about the graph for to show that the chromatic number of the graph for is at most eight. By generating a portion of the graph for we show its chromatic number is at least four; we conjecture it is equal to four.

生成讲解博客的中文版本

生成AI智能校验的中文版本