Abstract
Graham Higman was the first who studied the transitive actions of the extended modular group over PL(Fq) = Fq∪{∞} graphically and named it as coset diagram. In these sorts of graphs, a closed path of edges and triangles is known as a circuit. Coset diagrams evolve through the joining of these circuits. In a coset diagram, a circuit is termed as a length‐l circuit if its one vertex is fixed by , and it is denoted by (π1, π2, π3, …, πl). In this study, we shall formulate combinatorial sequences and find the number of distinct equivalence classes of a length‐6 circuit (π1, π2, π3, π4, π5, π6) for a fixed number of triangle Δ of class Π.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
