1.2k citations
- California Institute of TechnologyUS29 papers
- Pennsylvania State UniversityUS28 papers
- Massachusetts Institute of TechnologyUS26 papers
- Rutherford Appleton LaboratoryGB22 papers
- Yale UniversityUS22 papers
- The University of Texas at AustinUS21 papers
- Max Planck Institute for Gravitational PhysicsDE20 papers
- Indiana University BloomingtonUS19 papers
- Northwestern UniversityUS19 papers
- University of California, BerkeleyUS19 papers
- University of WashingtonUS19 papers
- Michigan State UniversityUS18 papers
6 papers · 1 filter
On a Quasi-Phan Theorem for Orthogonal Groups
Corneliu Hoffman, Adam Roberts
This paper constructs a presentation for the orthogonal groups. The amalgam is contained in that constructed by Ralf Gramlich Hendrik Van Maldeghem and arXiv:0708.1583 but it's sho…
Characterizations of the Solvable Radical
Paul Flavell, Simon Guest, Robert Guralnick
We prove that there exists a constant with the property: if $\calC$ is a conjugacy class of a finite group such that every elements of $\calC$\ generate a solvable subg…
On strongly -embedded subgroups of Lie rank 2
Chris Parker, Gernot Stroth
Suppose that is a prime, is a finite group and is a strongly -embedded subgroup in . We consider the possibility that is a simple group of Lie rank 2 def…
Symmetric generation of Coxeter groups
Ben Fairbairn, Jürgen Müller
We provide involutory symmetric generating sets of finitely generated Coxeter groups, fulfilling a suitable finiteness condition, which in particular is fulfilled in the finite, af…
A Quasi Curtis-Tits-Phan theorem for the symplectic group
Rieuwert J. Blok Corneliu Hoffman
We obtain the symplectic group $\SP(V)$ as the universal completion of an amalgam of low rank subgroups akin to Levi components. We let $\SP(V)$ act flag-transitively on the geomet…
Semisymmetric cubic graphs of twice odd order
Chris Parker
The groups which can act semisymmetrically on a cubic graph of twice odd order are determined modulo a normal subgroup which acts semiregularly on the vertices of the graph.