Equivalent Pairs of Words and Points of Connection
Higman has defined coset diagrams for PGL(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[wi,...
Saved in:
Main Authors: | Qaiser Mushtaq, Abdul Razaq |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2014-01-01
|
Series: | The Scientific World Journal |
Online Access: | http://dx.doi.org/10.1155/2014/505496 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Pairs of paths and critical points
by: Florin Caragiu, et al.
Published: (2001-01-01) -
THE LEXICAL EQUIVALENCE VARIETY OF F-WORDS TRANSLATION INTO INDONESIAN : CORPUS-BASED TRANSLATION RESEARCH
by: Isra F. Sianipar, et al.
Published: (2022-04-01) -
On countable connected Hausdorff spaces in which the intersection of every pair of connected subsets in connected
by: V. Tzannes
Published: (1998-01-01) -
Study of equivalent point-to-point transmission model for coded relay cooperations
by: Qiu-xia ZHANG, et al.
Published: (2012-12-01) -
The Fixed Point Property in c0 with an Equivalent Norm
by: Berta Gamboa de Buen, et al.
Published: (2011-01-01)