graham higman has defined coset diagrams for psl(2,ℤ). these diagrams are composed of fragments, and the fragments are further composed of two or more circuits. q. mushtaq has proved in 1983 that existence of a certain fragment γ of a coset diagram in a coset diagram is a polynomial f in ℤ[z]. higman has conjectured that, the polynomials related to the fragments are monic and for a fixed degree...

Graham Higman has defined coset diagrams for PSL(2,ℤ). These diagrams are composed of fragments, and the fragments are further composed of two or more circuits. Q. Mushtaq has proved in 1983 that existence of a certain fragment γ of a coset diagram in a coset diagram is a polynomial f in ℤ[z]. Higman has conjectured that, the polynomials related to the fragments are monic and for a fixed degree...

In this paper‎, ‎we have shown that the coset diagrams for the‎ ‎action of a linear-fractional group $Gamma$ generated by the linear-fractional‎ ‎transformations $r:zrightarrow frac{z-1}{z}$ and $s:zrightarrow frac{-1}{2(z+1)}$ on‎ ‎the rational projective line is connected and transitive‎. ‎By using coset diagrams‎, ‎we have shown that $r^{3}=s^{4}=1$ are defining relations for $Gamma$‎. ‎Furt...

Let G be a finite group, and X a subset of G. The Cayley graph of G with respect to X , written Cay(G,X) has two different definitions in the literature. The vertex set of this graph is the group G. In one definition, there is an arc from g to xg for all g ∈ G and x ∈ X ; in the other definition, for the same pairs (g,x), there is an arc from g to gx. Cayley graphs are generalised by coset grap...

Higman has defined coset diagrams for PGL(2, ℤ). 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 ℤ[𝔃], 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 an...

We introduce abacus diagrams that describe the minimal length coset representatives of affine Weyl groups in types C̃/C, B̃/D, B̃/B and D̃/D. These abacus diagrams use a realization of the affine Weyl group C̃ due to Eriksson to generalize a construction of James for the symmetric group. We also describe several combinatorial models for these parabolic quotients that generalize classical results in ...

Regular maps on non-orientable surfaces are considered with particular reference to the properties of inner reflectors, corresponding to symmetries of the 2-fold smooth orientable covering which project onto local reflections of the map itself. An example is given where no inner reflector is induced by an involution, and the existence of such involutions is related to questions of symmetry of c...

Freiman’s theorem asserts, roughly speaking, if that a finite set in a torsion-free abelian group has small doubling, then it can be efficiently contained in (or controlled by) a generalised arithmetic progression. This was generalised by Green and Ruzsa to arbitrary abelian groups, where the controlling object is now a coset progression. We extend these results further to solvable groups of bo...