Equivalent Pairs of Words and Points of Connection
Keyword(s):
Higman has defined coset diagrams forPGL(2,Z). The coset diagrams are composed of fragments, and the fragments are further composed of two or more circuits. A condition for the existence of a certain fragmentγin a coset diagram is a polynomialfinZ[z], obtained by choosing a pair of wordsF[wi,wj]such that bothwiandwjfix a vertexvinγ. Two pairs of words are equivalent if and only if they have the same polynomial. In this paper, we find distinct pairs of words that are equivalent. We also show there are certain fragments, which have the same orientations as those of their mirror images.
2019 ◽
Vol 2019
◽
pp. 1-13
◽
Keyword(s):
1997 ◽
Vol 39
(2)
◽
pp. 221-225
◽
Keyword(s):
1981 ◽
Vol 87
(3-4)
◽
pp. 263-270
◽
Keyword(s):
1988 ◽
Vol 37
(2)
◽
pp. 303-309
◽
Keyword(s):
2008 ◽
Vol 28
(2)
◽
pp. 363-370
◽
1990 ◽
Vol 18
(11)
◽
pp. 3857-3888
◽
Keyword(s):
2020 ◽
Vol 13
(14)
◽
pp. 1458-1469