# Equivalent Pairs of Words and Points of Connection

Authors: Qaiser Mushtaq; Abdul Razaq
Journal: The Scientific World Journal
 (2014)

---

## Abstract

Higman has defined coset diagrams forP
G
L
(
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 polynomial f in Z
[
z
], obtained by choosing a pair of words F
[
w
i
,
w
j
] such that both w
i and w
j  fix a vertex v  in γ. 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.


---

## Body

## 1. Introduction

The modular groupPSL
(
2
,
Z
) [1–3] an interesting group of hyperbolic isometries and has a finite presentation
(1)
〈
x
,
y
:
x
2
=
y
3
=
1
〉
,
where x and y are the linear fractional transformations defined by z
→
-
1
/
z and z
→
(
z
-
1
)
/
z, respectively. The modular group PSL
(
2
,
Z
) is of great interest in many fields of mathematics, for example, group theory, graph theory, and number theory. By adjoining a new element t
:
z
→
1
/
z with x and y, we obtain a presentation
(2)
〈
x
,
y
,
t
:
x
2
=
y
3
=
t
2
=
(
x
t
)
2
=
(
y
t
)
2
=
1
〉
of the extended modular group PGL
(
2
,
Z
).The Hecke groupH
(
λ
q
) is the discrete group generated by z
→
-
1
/
z,  z
→
-
1
/
(
z
+
λ
q
), where λ
q
=
2
cos
⁡
(
π
/
q
). It is well known that the modular group can be generalized to the Hecke groups. For q
=
3, the resulting Hecke group H
(
λ
3
) is the modular group PSL
(
2
,
Z
).Ifq is a power of a prime p, then the projective line over the finite field F
q, which is F
q
∪
{
∞
}, is denoted by PL
(
F
q
). The group PGL
(
2
,
q
) has its customary meaning, a group of all linear fractional transformations z
→
(
a
z
+
b
)
/
(
c
z
+
d
) such that a
,
b
,
c
,
d
∈
F
q and a
d
-
b
c
≠
0, while PSL
(
2
,
q
) is its subgroup consisting of all those, where a
d
-
b
c is a non-zero square in F
q.There is a well-known relationship between the action ofPSL
(
2
,
Z
) on R and continued fractions. There are many articles on the connection between the geodesics on the modular surface and continued fractions which are particularly important in the theory of approximation of real numbers by rational [4, 5]. Important results have been obtained using these ideas in a very well-written article [6]. A good account on relationship between continued fractions and indefinite binary quadratic forms is also given in [7]. In [8], Mushtaq has shown a relationship between reduced indefinite binary quadratic forms and orbits of the modular group. There is another interesting article [9] of Mushtaq and Hayat on the topic of Pell numbers, Pell-Lucas numbers, and modular group. In [10], Bong and Mushtaq determine the Fibonacci and Locus numbers through the action of modular group on real quadratic fields.In1978, G. Higman introduced a new type of graph called a coset diagram for PGL
(
2
,
Z
). The three cycles of y are denoted by small triangles whose vertices are permuted counterclockwise by y and any two vertices which are interchanged by x are joined by an edge. The fixed points of x and y are denoted by heavy dots. Notice (
y
t
)
2
=
1 is equivalent to t
y
t
=
y
-
1, which means that t reverses the orientation of the triangles representing the three cycles of y (as reflection does); because of this, there is no need to make the diagram more complicated by introducing t-edges. For details about coset diagrams, one can refer to [11–14].Two homomorphismsα and β from PGL
(
2
,
Z
) to PGL
(
2
,
q
) are called conjugate if β
=
α
ρ for some inner automorphism ρ on PGL
(
2
,
q
). We call α to be non-degenerate if neither of x
,
y lies in the kernel of α. In [15], it has been shown that the conjugacy classes of non-degenerate homomorphisms from PGL
(
2
,
Z
) to PGL
(
2
,
q
) are in one to one correspondence with the elements θ
≠
0,3 of F
q under the correspondence which maps each class to its parameter θ. As in [15], the coset diagram corresponding to the action of PGL
(
2
,
Z
) on PL
(
F
q
) via a homomorphism α with parameter θ is denoted by D
(
θ
,
q
). Each conjugacy class is represented by a unique coset diagram, unique in the sense that the diagram remains invariant except that labels of vertices change from α to β.By a circuit in a coset diagram for an action ofPGL
(
2
,
Z
) on PL
(
F
q
), we will mean a closed path of triangles and edges. Let n
1
,
n
2
,
…
,
n
2
k be a sequence of positive integers, the circuit which contains a vertex, fixed by w
=
(
x
y
)
n
1
(
x
y
-
1
)
n
2
⋯
(
x
y
-
1
)
n
2
k
∈
PSL
(
2
,
Z
) for some k
≥
1; we will mean the circuit in which n
1 triangles have one vertex inside the circuit and n
2 triangles have one vertex outside the circuit and so on. Since it is a cycle (
n
1
,
n
2
,
…
,
n
2
k
), so it does not make any difference if n
1 triangles have one vertex outside the circuit and n
2 triangles have one vertex inside the circuit and so on. The circuit of the type (
n
1
,
n
2
,
…
,
n
2
k
′
,
n
1
,
n
2
,
…
,
n
2
k
′
,
…
,
n
1
,
n
2
,
…
,
n
2
k
′
) is called a periodic circuit and the length of its period is 2
k
′. A circuit that is not of this type is non-periodic. A circuit is called simple, if each vertex of the circuit is fixed by a unique word w or its inverse w
-
1.


## 2. Joining of Circuits

Consider two non-periodic and simple circuits(
n
1
,
n
2
,
…
,
n
2
k
) and (
m
1
,
m
2
,
…
,
m
2
k
). Let v
i be any vertex in (
n
1
,
n
2
,
…
,
n
2
k
) fixed by a word w
i and let v
j be any vertex in (
m
1
,
m
2
,
…
,
m
2
k
) fixed by a word w
j. In order to connect these two circuits at v
i and v
j, we choose, without loss of generality (
n
1
,
n
2
,
…
,
n
2
k
), and apply w
j on v
i in such a way that w
j ends at v
i. Consequently, we get a fragment denoted by γ. In other words, by γ, we will mean a nonsimple fragment whose one vertex v
=
v
i
=
v
j is fixed by a pair of words w
i, w
j, dented by F
[
w
i
,
w
j
].Example 1.
We connect the vertexv, fixed by (
x
y
)
(
x
y
-
1
)
3
(
x
y
)
3, in (
4,3
) with the vertex u, fixed by (
x
y
)
3
(
x
y
-
1
)
2 of (
3,2
), and compose a fragment γ as shown in Figures 1, 2, and 3.Figure 1Figure 2Figure 3One can see that the vertexv
=
u in γ (Figure 3) is fixed by a pair of words
(3)
F
[
(
x
y
)
(
x
y
-
1
)
3
(
x
y
)
3
,
(
x
y
)
3
(
x
y
-
1
)
2
]
.The action ofPGL
(
2
,
Z
) on PL
(
F
q
2
) yields two components, namely, PL
(
F
q
) and PL
(
F
q
2
)
∖
PL
(
F
q
). For sake of simplicity, let PL
(
F
q
)
¯ denote the complement PL
(
F
q
2
)
∖
PL
(
F
q
).The coset diagramD
(
θ
,
q
) is made of fragments. It is therefore necessary to ask when a fragment exists in D
(
θ
,
q
). In [16], this question is answered in the following way.Theorem 2.
Given a fragment, there is a polynomialf in Z
[
z
] such that(i)
if the fragment occurs inD
(
θ
,
q
), then f
(
θ
)
=
0;
(ii)
iff
(
θ
)
=
0, then the fragment, or a homomorphic image of it occurs in D
(
θ
,
q
) or in P
L
(
F
q
)
¯.In [16], the method of calculating a polynomial from a fragment is given. Here, we describe this method briefly. Since a fragment is composed of two non-periodic and connected circuits (
n
1
,
n
2
,
…
,
n
2
k
) and (
m
1
,
m
2
,
…
,
m
2
k
) with a common fixed vertex, say, v, then there is a pair of words, for instance,
(4)
F
[
w
i
,
w
j
]
=
F
[
(
x
y
)
l
1
(
x
y
-
1
)
l
2
⋯
(
x
y
-
1
)
l
2
k
1
,
(
x
y
)
m
1
(
x
y
-
1
)
m
2
⋯
(
x
y
-
1
)
m
2
k
2
(
x
y
)
l
1
(
x
y
-
1
)
l
2
.
.
.
(
x
y
-
1
)
l
2
k
1
,
]
such that (
v
)
w
i
=
v and (
v
)
w
j
=
v. Let X and Y be the matrices corresponding to x and y of PGL
(
2
,
q
). Then, w
i and w
j can be expressed as
(5)
W
i
=
(
X
Y
)
l
1
(
X
Y
-
1
)
l
2
⋯
(
X
Y
-
1
)
l
2
k
1
,
W
j
=
(
X
Y
)
m
1
(
X
Y
-
1
)
m
2
⋯
(
X
Y
-
1
)
m
2
k
2
,
where k
1
,
k
2
>
0. By using (3.1) to (3.7) of [16], the matrices W
i and W
j can be expressed linearly as
(6)
W
i
=
λ
0
I
+
λ
1
X
+
λ
2
Y
+
λ
3
X
Y
,
W
j
=
μ
0
I
+
μ
1
X
+
μ
2
Y
+
μ
3
X
Y
such that λ
i and μ
i, for i
=
0,1
,
2,3, are polynomials in r and Δ, where r is the trace of X
Y and Δ is its determinant. Since v is a common fixed vertex of w
i and w
j, therefore the 2
×
2 matrices W
i and W
j have a common eigenvector. Then, by Lemma 3.1 of [16], the algebra generated by W
i and W
j has dimension 3. The algebra contains I, W
i, W
j, and  W
i
W
j and so these are linearly dependent. Using (3.1) to (3.7) of [16], the matrix W
i
W
j is expressed as
(7)
W
i
W
j
=
ν
0
I
+
ν
1
X
+
ν
2
Y
+
ν
3
X
Y
,
where v
i, for i
=
0,1
,
2,3, can be calculated in terms of the λ
i and μ
i, using (
3.1
) to (
3.7
) of [16]. The condition that I, W
i, W
j, and W
i
W
j are linearly dependent is expressed as
(8)
|
λ
1
λ
2
λ
3
μ
1
μ
2
μ
3
ν
1
ν
2
ν
3
|
=
0
.
If we calculate v
1
,
v
2
,
v
3 in terms of λ
i and μ
i and substitute in (8), we find that it is equivalent to
(9)
(
λ
2
μ
3
-
μ
2
λ
3
)
2
+
Δ
(
λ
3
μ
1
-
μ
3
λ
1
)
2
+
(
λ
1
μ
2
-
μ
1
λ
2
)
2
+
r
(
λ
2
μ
3
-
μ
2
λ
3
)
(
λ
3
μ
1
-
μ
3
λ
1
)
+
(
λ
2
μ
3
-
μ
2
λ
3
)
(
λ
1
μ
2
-
μ
1
λ
2
)
=
0
.This gives a homogeneous equation inΔ and r. By substituting Δ
θ for r
2, we get an equation in θ.Two pairs of wordsF
[
w
i
,
w
j
] and F
[
w
k
,
w
l
] are equivalent if and only if they have the same polynomial. If two pairs of words F
[
w
i
,
w
j
] and F
[
w
k
,
w
l
] are equivalent, then we write F
[
w
i
,
w
j
]
~
F
[
w
k
,
w
l
].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.


## 3. Main Results

Theorem 3.
In the above notation, the polynomial obtained from a fragmentγ is unique.Proof.
Letv
i and v
k be any two vertices of a fragment γ, such that v
i is fixed by a pair of words F
[
w
i
,
w
j
] and v
k is fixed by a pair of words F
[
w
k
,
w
l
]. Suppose f
(
θ
) is a polynomial obtained by choosing F
[
w
i
,
w
j
] and g
(
θ
) is a polynomial obtained by choosing F
[
w
k
,
w
l
]. Now, if f
(
θ
)
=
0, then, by Theorem 2, the fragment γ or its homomorphic image occurs in D
(
θ
,
q
) or in PL
(
F
q
)
¯. So, there exists a vertex in D
(
θ
,
q
) or in PL
(
F
q
)
¯ which is fixed by F
[
w
k
,
w
l
]. Again, by Theorem 2, we have g
(
θ
)
=
0. Similarly, it can be proved that if g
(
θ
)
=
0, then f
(
θ
)
=
0. Hence, f
(
θ
)
=
g
(
θ
).Remark 4.
If a vertexv is fixed by a word w
i
∈
PSL
(
2
,
Z
), then the vertex (
v
)
w is fixed by the conjugate w
-
1
w
i
w of w
i.We know thatγ is a fragment created by joining a vertex v
i of (
n
1
,
n
2
,
…
,
n
2
k
) with the vertex v
j of (
m
1
,
m
2
,
…
,
m
2
k
). Since the same polynomial is evolved for all the points of connection for the fragment γ, therefore it is important to know all the points of connection for the fragment γ. Following theorem is useful in finding all points of connection of (
n
1
,
n
2
,
…
,
n
2
k
) and (
m
1
,
m
2
,
…
,
m
2
k
) for the fragment γ.Theorem 5.
Let fragmentγ be constructed by joining a vertex v
i of (
n
1
,
n
2
,
…
,
n
2
k
) with the vertex v
j of (
m
1
,
m
2
,
…
,
m
2
k
). Then, γ is obtainable also, if the vertex (
v
i
)
w of (
n
1
,
n
2
,
…
,
n
2
k
) is joined with the vertex (
v
j
)
w of (
m
1
,
m
2
,
…
,
m
2
k
).Proof.
Suppose vertexv
i is fixed by a word w
i and vertex v
j is fixed by a word w
j. Then, one vertex of the fragment γ is fixed by w
i and w
j. Now, we join the vertex (
v
i
)
w of (
n
1
,
n
2
,
…
,
n
2
k
) with the vertex (
v
j
)
w of (
m
1
,
m
2
,
…
,
m
2
k
) and compose a fragment δ. By Remark 4, the vertex (
v
)
w of fragment δ is fixed by w
-
1
w
i
w and w
-
1
w
j
w, whereas the vertex (
(
v
)
w
)
w
-
1
=
v of fragment δ is fixed by w
(
w
-
1
w
i
w
)
w
-
1
=
w
i and w
(
w
-
1
w
j
w
)
w
-
1
=
w
j. This shows that γ and δ are the same fragments.Sinceγ and δ are the same fragments, and a unique polynomial is obtained from a fragment, hence F
[
w
i
,
w
j
]
~
F
[
w
-
1
w
i
w
,
w
-
1
w
j
w
].Corollary 6.
LetP be the set of words such that for any w
∈
P, both vertices (
v
i
)
wand (
v
j
)
w lie on the circuits (
n
1
,
n
2
,
…
,
n
2
k
) and (
m
1
,
m
2
,
…
,
m
2
k
). Let s be the total number of points of connection of the circuits to compose γ. Then, s
=
|
P
|.Example 7.
As in Example1, the vertex v in (
4,3
) is connected with the vertex u in (
3,2
), and a fragment γ is evolved. Then, one can see that
(10)
P
=
{
y
,
y
-
1
,
e
,
x
,
x
y
,
x
y
-
1
,
x
y
x
,
x
y
x
y
,
x
y
x
y
-
1
}
is the set of words such that, for any w
∈
P, both vertices (
v
)
w and (
u
)
w lie on (
4,3
) and (
3,2
). Since |
P
|
=
9, there are nine points of connection of (
4,3
) and (
3,2
) composing γ. Hence, 9 vertices of one circuit are merged in another circuit. In other words, 3 triangles of one circuit are merged in another circuit.The number of points of connection of the circuits for a fragment is always multiple of three and plays a significant role because they are directly related to the structure of the fragment. The following theorem illustrates this relation.Theorem 8.
Letr be the total number of triangles in a fragment γ and s the total number of points of connection of the circuits (
n
1
,
n
2
,
…
,
n
2
k
) and (
m
1
,
m
2
,
…
,
m
2
k
). Then, r
=
∑
j
=
1
2
k
n
j
+
∑
j
=
1
2
k
m
j
-
(
1
/
3
)
s.Proof.
Since circuits(
n
1
,
n
2
,
…
,
n
2
k
) and (
m
1
,
m
2
,
…
,
m
2
k
) have ∑
j
=
1
2
k
n
j and ∑
j
=
1
2
k
m
j number of triangles, respectively, and there are s number of points of connection of (
n
1
,
n
2
,
…
,
n
2
k
) and (
m
1
,
m
2
,
…
,
m
2
k
) composing γ, therefore, by Corollary 6, there are s number of words w such that (
v
i
)
w, (
v
j
)
w lie on (
n
1
,
n
2
,
…
,
n
2
k
) and (
m
1
,
m
2
,
…
,
m
2
k
), respectively. So, s number of vertices of (
m
1
,
m
2
,
…
,
m
2
k
) are merged in (
n
1
,
n
2
,
…
,
n
2
k
), and remaining 3
∑
j
=
1
2
k
m
j
-
s number of vertices are included in (
n
1
,
n
2
,
…
,
n
2
k
) to compose γ. So, the total number of vertices in γ is (
3
∑
j
=
1
2
k
m
j
-
s
+
3
∑
j
=
1
2
k
n
j
). This implies that r
=
∑
j
=
1
2
k
n
j
+
∑
j
=
1
2
k
m
j
-
(
1
/
3
)
s.Remark 9.
Consider a fragmentγ such that one vertex v of γ is fixed by F
[
w
i
,
w
j
]. Then, obviously, v is fixed by F
[
w
i
-
1
,
w
j
-
1
]. So, F
[
w
i
,
w
j
]
~
F
[
w
i
-
1
,
w
j
-
1
]. Also, it is trivial that F
[
w
i
,
w
j
]
~
F
[
w
j
,
w
i
].The following Theorem shows that(
n
1
,
n
2
,
…
,
n
2
k
) and (
m
1
,
m
2
,
…
,
m
2
k
) are not a unique pair of circuits for the fragment γ.Theorem 10.
The following pairs of words are equivalent:(11)
F
[
w
i
,
w
j
]
,
F
[
w
i
,
w
i
w
j
]
,
F
[
w
i
,
w
i
w
j
-
1
]
,
F
[
w
i
,
w
j
w
i
]
,
F
[
w
i
,
w
j
w
i
-
1
]
.Proof.
Letv
i
,
v
j, and v
k be arbitrary vertices of the circuits (
n
1
,
n
2
,
…
,
n
2
k
), (
m
1
,
m
2
,
…
,
m
2
k
), and (
m
1
′
,
m
2
′
,
…
,
m
2
k
′
), respectively. Let the words w
i
,
w
j, and w
i
w
j fix the vertices v
i
,
v
j, and v
k, respectively. We join a vertex v
i fixed by w
i of the circuit (
n
1
,
n
2
,
…
,
n
2
k
) with the vertex v
j fixed by w
j of the circuit (
m
1
,
m
2
,
…
,
m
2
k
) to compose γ. Also, we join a vertex v
i fixed by w
i of the circuit (
n
1
,
n
2
,
…
,
n
2
k
) with the vertex fixed by w
i
w
j of the (
m
1
′
,
m
2
′
,
…
,
m
2
k
′
) to compose a fragment δ. So, in δ,   v
i is a common fixed vertex of F
[
w
i
,
w
i
w
j
]. The fragment δ is different from the fragment γ if and only if, in fragment δ, the word w
i
w
j fixes the vertex v
i in the following way: w
i maps the vertex v
i to some vertex a
≠
v
i, and then w
j maps the vertex a to the vertex v
i; that is, v
i
→
w
i
a
→
w
j
v
i. Since w
i is a composition of linear fractional transformations x and y, therefore a
=
v
i. This implies that γ and δ are the same fragments, since a unique polynomial is obtained from a fragment. Hence, F
[
w
i
,
w
j
]
~
F
[
w
i
,
w
i
w
j
].
Similarly, it is easy to prove that(12)
F
[
w
i
,
w
j
]
~
F
[
w
i
,
w
i
w
j
-
1
]
,
F
[
w
i
,
w
j
]
~
F
[
w
i
,
w
j
w
i
]
,
F
[
w
i
,
w
j
]
~
F
[
w
i
,
w
j
w
i
-
1
]
.
Since ~ is an equivalence relation, hence
(13)
F
[
w
i
,
w
j
]
~
F
[
w
i
,
w
i
w
j
]
~
F
[
w
i
,
w
i
w
j
-
1
]
~
F
[
w
i
,
w
j
w
i
]
~
F
[
w
i
,
w
j
w
i
-
1
]
.Example 11.
Theorem10 shows that the fragment γ, which has a vertex fixed by F
[
w
i
,
w
j
], and the fragment δ
′, which has a vertex fixed by F
[
w
i
,
w
j
w
i
], are the same. So, the fragment, which has a vertex fixed by F
[
(
x
y
)
2
(
x
y
-
1
)
,
(
x
y
-
1
)
(
x
y
)
3
], and the fragment, which has a vertex fixed by F
[
(
x
y
)
2
(
x
y
-
1
)
,
(
x
y
-
1
)
(
x
y
)
5
(
x
y
-
1
)
], are the same. Since the words (
x
y
)
2
(
x
y
-
1
),  (
x
y
-
1
)
(
x
y
)
3, and (
x
y
-
1
)
(
x
y
)
5
(
x
y
-
1
) correspond to the circuits (
2,1
), (
3,1
), and (
5,2
), so the fragment (Figure 4) is obtained, not only by joining the vertex v
1 in (
2,1
) (Figure 5) with the vertex v
2 in (
3,1
) (Figure 6) but also by joining the vertex v
1 in (
2,1
) (Figure 7) with the vertex u
2 in (
5,2
) (Figure 8).Figure 4Figure 5Figure 6Figure 7Figure 8Theorem 12.
In a coset diagram for the action ofP
G
L
(
2
,
Z
) on P
L
(
F
q
), if a vertex v is fixed by w, then the vertex (
v
)
t is fixed by w
*.Proof.
Letw
=
x
y
η
1
x
y
η
2
⋯
x
y
η
n
-
1
x
y
η
n be a word such that
(14)
(
v
)
x
y
η
1
x
y
η
2
⋯
x
y
η
n
-
1
x
y
η
n
=
v
.
Since(
x
t
)
2
=
(
y
t
)
2
=
1, this implies that
(15)
y
t
=
t
y
-
1
,
y
-
1
t
=
t
y
,
x
t
=
t
x
.
Now, by using (14) and (15), we have (
v
)
t
=
(
(
v
)
x
y
η
1
x
y
η
2
⋯
x
y
η
n
-
1
x
y
η
n
)
t
=
(
(
v
)
t
)
x
y
-
η
1
x
y
-
η
2
⋯
x
y
-
η
n
-
1
x
y
-
η
n
=
(
(
v
)
t
)
w
*. This shows that x
y
-
η
1
x
y
-
η
2
⋯
x
y
-
η
n
-
1
x
y
-
η
n also fixes a point (
v
)
t.Theorem 13.
If a vertexv is fixed by a word w in a circuit (
n
1
,
n
2
), then there exists a vertex v
* in (
n
1
,
n
2
) such that v
* is fixed by w
*.Proof.
Consider a simple circuit(
n
1
,
n
2
).
In Figure9, one can see that the vertex u
1 is fixed by (
x
y
)
n
1
(
x
y
-
1
)
n
2 and u
3
n
2 is fixed by (
x
y
-
1
)
n
1
(
x
y
)
n
2. So, u
3
n
2
=
u
1
*. Also, the vertex u
2 is fixed by y
(
x
y
)
n
1
(
x
y
-
1
)
n
2
-
1
x
y and u
3
n
2
-
1 is fixed by y
-
1
(
x
y
-
1
)
n
1
(
x
y
)
n
2
-
1
x
y
-
1. So, u
3
n
2
-
1
=
u
2
*. Similarly, u
3
n
2
-
2
=
u
3
*,   u
3
n
2
-
3
=
u
4
*
,
….
The verticesv
1 and v
3
n
1 are fixed by (
x
y
)
n
2
(
x
y
-
1
)
n
1 and (
x
y
-
1
)
n
2
(
x
y
)
n
1, respectively, implying that v
3
n
2
=
v
1
*. Also, the vertices v
2 and v
3
n
1
-
1 are fixed by y
(
x
y
)
n
2
(
x
y
-
1
)
n
1
-
1
x
y and y
-
1
(
x
y
-
1
)
n
2
(
x
y
)
n
1
-
1
x
y
-
1, respectively, implying that v
3
n
1
-
1
=
v
2
*. Similarly, v
3
n
1
-
2
=
v
3
*,    v
3
n
2
-
3
=
v
4
*
,
….Figure 9Let the homomorphic image of the fragment (Figure10) occur in the coset diagram D
(
θ
,
q
). Since D
(
θ
,
q
) admits the axis of symmetry, the mirror image of the fragment under the permutation t will also occur as shown in Figure 11.Figure 10Figure 11Proposition 14.
If the fragmentγ has one vertex v fixed by F
[
w
i
,
w
j
], then its mirror image γ
* has one vertex fixed by F
[
w
i
*
,
w
j
*
].Proof.
Letγ be the fragment with one vertex v fixed by F
[
w
i
,
w
j
]. Since γ
* is the mirror image of γ, therefore γ
* has one vertex (
v
)
t. Then, by Theorem 12, the vertex (
v
)
t is fixed by F
[
w
i
*
,
w
j
*
].Theorem 15.
The polynomials obtained from the fragmentγ and its mirror image γ
* are the same.Proof.
Letf
(
θ
) be the polynomial obtained by choosing a pair of words F
[
w
i
,
w
j
] from γ and let g
(
θ
) be the polynomial obtained by choosing a pair of words F
[
w
i
*
,
w
j
*
] from γ
*. Let f
(
θ
)
=
0. Then, by Theorem 2, there is a vertex say v in D
(
θ
,
q
) or in PL
(
F
q
)
¯ which is fixed by F
[
w
i
,
w
j
]. Then, by Theorem 12, the vertex (
v
)
t is fixed by F
[
w
i
*
,
w
j
*
]. So, by Theorem 2, g
(
θ
)
=
0. Similarly, it can be proved that if g
(
θ
)
=
0, then f
(
θ
)
=
0. Hence, f
(
θ
)
=
g
(
θ
).Since a unique polynomial is obtained from a fragmentγ and its mirror image γ
*, hence F
[
w
i
,
w
j
]
~
F
[
w
i
*
,
w
j
*
].Consider two circuits(
n
1
,
n
2
) and (
m
1
,
m
2
). In general, fragment γ and its mirror image γ
* do not have the same orientation. There are certain fragments which have the same orientations as those of their mirror images. These kinds of fragments have vertical symmetry and may have fixed points of t. The following Theorem shows how these fragments are composed.Theorem 16.
(i) The fragment composed by joining a vertexu
1, fixed by
(16)
(
x
y
-
1
)
(
n
1
-
1
)
/
2
(
x
y
)
n
2
(
x
y
-
1
)
(
n
1
+
1
)
/
2
in (
n
1
,
n
2
), with the vertex u
2, fixed by (
x
y
-
1
)
(
m
1
-
1
)
/
2
(
x
y
)
m
2
(
x
y
-
1
)
(
m
1
+
1
)
/
2 in (
m
1
,
m
2
), has the same orientation as that of its mirror image.
(ii) The fragment composed by joining a vertexu
1, fixed by
(17)
(
x
y
-
1
)
n
1
/
2
(
x
y
)
n
2
(
x
y
-
1
)
n
1
/
2
in (
n
1
,
n
2
), with the vertex u
2, fixed by (
x
y
-
1
)
m
1
/
2
(
x
y
)
m
2
(
x
y
-
1
)
m
1
/
2 in (
m
1
,
m
2
), has the same orientation as that of its mirror image.
(iii) The fragment composed by joining a vertexv
1, fixed by
(18)
(
x
y
-
1
)
n
1
/
2
(
x
y
)
n
2
(
x
y
-
1
)
n
1
/
2
in (
n
1
,
n
2
), with the vertex v
2, fixed by (
x
y
)
m
1
/
2
(
x
y
-
1
)
m
2
(
x
y
)
m
1
/
2 in (
m
1
,
m
2
), has the same orientation as that of its mirror image.Proof.
(i) Letγ
1 be the fragment which has one vertex say u, fixed by
(19)
(
x
y
-
1
)
(
n
1
-
1
)
/
2
(
x
y
)
n
2
(
x
y
-
1
)
(
n
1
+
1
)
/
2
,
(
x
y
-
1
)
(
m
1
-
1
)
/
2
(
x
y
)
m
2
(
x
y
-
1
)
(
m
1
+
1
)
/
2
.
Then, by Proposition 14, its mirror image fragment γ
1
* contains a vertex, say, u
*, fixed by (
x
y
)
(
n
1
-
1
)
/
2
(
x
y
-
1
)
n
2
(
x
y
)
(
n
1
+
1
)
/
2 and (
x
y
)
(
m
1
-
1
)
/
2
(
x
y
-
1
)
m
2
(
x
y
)
(
m
1
+
1
)
/
2. By Remark 4, the vertex (
u
*
)
y of fragment γ
1
* is fixed by
(20)
y
(
x
y
)
(
n
1
-
1
)
/
2
(
x
y
-
1
)
n
2
(
x
y
)
(
n
1
+
1
)
/
2
y
-
1
=
(
(
x
y
-
1
)
(
n
1
-
1
)
/
2
(
x
y
)
n
2
(
x
y
-
1
)
(
n
1
+
1
)
/
2
)
-
1
and y
(
x
y
)
(
m
1
-
1
)
/
2
(
x
y
-
1
)
m
2
(
x
y
)
(
m
1
+
1
)
/
2
y
-
1
=
(
(
x
y
-
1
)
(
m
1
-
1
)
/
2
(
x
y
)
m
2
(
x
y
-
1
)
(
m
1
+
1
)
/
2
)
-
1. This implies that u
=
(
u
*
)
y. Hence fragment γ
1 has the same orientation as that of its mirror image γ
1
*.
(ii) Letγ
2 be the fragment which has one vertex, say, v, fixed by
(21)
(
x
y
-
1
)
n
1
/
2
(
x
y
)
n
2
(
x
y
-
1
)
n
1
/
2
,
(
x
y
-
1
)
m
1
/
2
(
x
y
)
m
2
(
x
y
-
1
)
m
1
/
2
.
Then, its mirror image fragment γ
2
* has one vertex, say, v
*, fixed by
(22)
(
x
y
)
n
1
/
2
(
x
y
-
1
)
n
2
(
x
y
)
n
1
/
2
,
(
x
y
)
m
1
/
2
(
x
y
-
1
)
m
2
(
x
y
)
m
1
/
2
.
The vertex (
v
*
)
x of fragment γ
2
* is fixed by
(23)
x
(
x
y
)
n
1
/
2
(
x
y
-
1
)
n
2
(
x
y
)
n
1
/
2
x
=
(
(
x
y
-
1
)
n
1
/
2
(
x
y
)
n
2
(
x
y
-
1
)
n
1
/
2
)
-
1
and x
(
x
y
)
m
1
/
2
(
x
y
)
m
2
(
x
y
)
m
1
/
2
x
=
(
(
x
y
-
1
)
m
1
/
2
(
x
y
)
m
2
(
x
y
-
1
)
m
1
/
2
)
-
1. This implies that v
=
(
v
*
)
x. Hence, γ
2 has the same orientation as that of its mirror image γ
2
*.
(iii) Letγ
3 be the fragment which has one vertex, say, v, fixed by
(24)
(
x
y
-
1
)
n
1
/
2
(
x
y
)
n
2
(
x
y
-
1
)
n
1
/
2
,
(
x
y
)
m
1
/
2
(
x
y
-
1
)
m
2
(
x
y
)
m
1
/
2
.
Then, its mirror image fragment γ
3
* has one vertex, say, v
*, fixed by
(25)
(
x
y
)
n
1
/
2
(
x
y
-
1
)
n
2
(
x
y
)
n
1
/
2
,
(
x
y
-
1
)
m
1
/
2
(
x
y
)
m
2
(
x
y
-
1
)
m
1
/
2
.
The vertex (
v
*
)
x of fragment γ
3
* is fixed by
(26)
x
(
x
y
)
n
1
/
2
(
x
y
-
1
)
n
2
(
x
y
)
n
1
/
2
x
=
(
(
x
y
-
1
)
n
1
/
2
(
x
y
)
n
2
(
x
y
-
1
)
n
1
/
2
)
-
1
and x
(
x
y
-
1
)
m
1
/
2
(
x
y
)
m
2
(
x
y
-
1
)
m
1
/
2
x
=
(
(
x
y
)
m
1
/
2
(
x
y
-
1
)
m
2
(
x
y
)
m
1
/
2
)
-
1. This implies that v
=
(
v
*
)
x. Hence, γ
3 has the same orientation as that of its mirror image γ
3
*.


## 4. Motivation and Open Problems

If we join a pair of circuits at a certain point, we get a fragment and hence a polynomial. Since each such polynomial splits linearly in a suitable Galois [16] and corresponding to each zero, we get a triplet (
x
¯
,
y
¯
,
t
¯
) [15] which is a group. This shows that each pair of circuits can be related to a group. A pair of circuits has finitely many points of connections. Two distinct points of connection may or may not give the same fragment. So, it is important to ask the following question.Problem 17.
How many fragments (polynomials) are obtained if we join a pair of circuits(
n
1
,
n
2
) and (
m
1
,
m
2
) at all points of connection?In order to give the answer of the above question, we first have to find those pair of words which are equivalent. In other words, we have to find those points of connection, at which we get the same polynomial. This issue is resolved in this paper. We will give the answer of the above question in an other paper. After that, one can establish a connection between a class of groups and a pair of circuits(
n
1
,
n
2
) and (
m
1
,
m
2
), which is indeed a great development.



---

*Source: 505496-2014-09-08.xml*