Geodesic
A Characterization of PSL(2, 31) and its Geometry
Canadian journal of mathematics, Tome 32 (1980) no. 1, pp. 155-164

Voir la notice de l'article provenant de la source Cambridge University Press

The aim of this paper is the characterization of PSL(2, 31) in terms of its action on a certain polygonal graph. A polygonal graph is a pair (, ) consisting of a graph which is regular, connected and has girth m for some m ≧ 3, and a set of m-gons (circuits of length m) of such that every 2-claw (i.e. path of length 2) of is contained in a unique element of , (See Section 2 for the definitions of the terms used here.) If is the set of all m-gons of H, so that there is in a unique m-gon on every one of its 2-claws, then we write for (, ) and call a strict polygonal graph. If we wish to emphasize the integer m, then we call (, ) an m-gon-graph (respectively, a strict m-gon-graph). For convenience, a strict 5-gon-graph will be called a pentagraph. 
Perkel, Manley. A Characterization of PSL(2, 31) and its Geometry. Canadian journal of mathematics, Tome 32 (1980) no. 1, pp. 155-164. doi: 10.4153/CJM-1980-012-5
@article{10_4153_CJM_1980_012_5,
     author = {Perkel, Manley},
     title = {A {Characterization} of {PSL(2,} 31) and its {Geometry}},
     journal = {Canadian journal of mathematics},
     pages = {155--164},
     year = {1980},
     volume = {32},
     number = {1},
     doi = {10.4153/CJM-1980-012-5},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1980-012-5/}
}
TY  - JOUR
AU  - Perkel, Manley
TI  - A Characterization of PSL(2, 31) and its Geometry
JO  - Canadian journal of mathematics
PY  - 1980
SP  - 155
EP  - 164
VL  - 32
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1980-012-5/
DO  - 10.4153/CJM-1980-012-5
ID  - 10_4153_CJM_1980_012_5
ER  - 
%0 Journal Article
%A Perkel, Manley
%T A Characterization of PSL(2, 31) and its Geometry
%J Canadian journal of mathematics
%D 1980
%P 155-164
%V 32
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1980-012-5/
%R 10.4153/CJM-1980-012-5
%F 10_4153_CJM_1980_012_5

[1] 1. Coxeter, H. S. M. and Moser, W. O. J., Generators and relations for discrete, groups (Third edition, Springer, Berlin, 1972). Google Scholar

[2] 2. Higman, D. G., Finite permutation groups of rank 3, Math. Z. 86 (1964). 145–156. Google Scholar

[3] 3. Huppert, B., Endliche Gruppen I, Grundlehren der math. Wissenschaften 134 (Springer, Berlin, 1968). Google Scholar

[4] 4. Perkel, M., Bounding the valency of polygonal graphs with odd girth, to appear in Can. J. Math. Google Scholar

[5] 5. Scott, R., Coset enumeration program, University of Michigan, Ann Arbor, Mich., private communication. Google Scholar

Cité par Sources :