2001
DOI: 10.1112/s0024609301008311
|View full text |Cite
|
Sign up to set email alerts
|

On Suborbital Graphs for the Modular Group

Abstract: This paper proves a conjecture of G. A. Jones, D. Singerman and K. Wicks, that a suborbital graph for the modular group is a forest if and only if it contains no triangles.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
33
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 39 publications
(33 citation statements)
references
References 2 publications
0
33
0
Order By: Relevance
“…Then Akbas found certain relationship between the lenghts of circuits in these graphs and periods of elliptic elements of the group Γ 0 (n) [1]. This is important taking into account that the elliptic elements are one of the invariants of the group.…”
Section: Motivationmentioning
confidence: 99%
“…Then Akbas found certain relationship between the lenghts of circuits in these graphs and periods of elliptic elements of the group Γ 0 (n) [1]. This is important taking into account that the elliptic elements are one of the invariants of the group.…”
Section: Motivationmentioning
confidence: 99%
“…Hence by Cauchy Frobenius Lemma, the number of orbits of ( ) By applying Cauchy Frobenius Lemma the number of orbits of ( 1,4,7 ) G acting on X Y Z × × are;…”
Section: G S S Smentioning
confidence: 99%
“…( 1,1,( ab ) ) 1 9 ( 1,( ab ),1 ) 1 9 ( 1,( ab ),( ab ) ) 1 3 ( ( ab ),1,1 ) 1 9 ( ( ab ),( ab ),1 ) 1 3 1 3 ( ( ab ),( ab ),( ab ) ) 1 1 Now applying Theorem 2.2, the number of orbits of ( 1,4,7 ) G acting on =Orb ( 2,5,8 )={ ( 2,5,8 ), ( 2,5,9 ), ( 2,6,8 ), ( 3,5,8 ), ( 2,6,9 ), ( 3,5,9 ), ( 3,6,8 ), ( 3,6,9 )} ∆ From the above, the rank of …”
mentioning
confidence: 99%
“…Firstly, in [3], it was proved that the elliptic elements in Γ 0 (n) correspond to circuits in the subgraph F u,n of the same order and vice versa. This fact is important because it means that suborbital graphs might have a potential to clarify signature problems taking into account the order of elliptic elements are one of the invariants of signature.…”
Section: Introductionmentioning
confidence: 99%
“…Then similar studies were done for related finitely generated groups.The reader is referred to [2][3][4][5]8,9,[11][12][13][14][15][16] for some relevant previous work on suborbital graphs. Firstly, in [3], it was proved that the elliptic elements in Γ 0 (n) correspond to circuits in the subgraph F u,n of the same order and vice versa.…”
Section: Introductionmentioning
confidence: 99%