✦ LIBER ✦

Transitive linear groups and nearfields with solubility conditions

✍ Scribed by Theo Grundhöfer

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 275 KB
Volume: 105
Category: Article
ISSN: 0021-8693
DOI: 10.1016/0021-8693(87)90195-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Finite Linear Spaces with Almost Simp

On Finite Linear Spaces with Almost Simple Flag-Transitive Automorphism Groups

✍ Jan Saxl 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 280 KB

This paper contains a classification of finite linear spaces with an automorphism group which is an almost simple group of Lie type acting flag-transitively. This completes the proof of the classification of finite flag-transitive linear spaces announced in [BDDKLS].

Finite soluble groups with an Engel cond

Finite soluble groups with an Engel condition

✍ T.A Peng 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 570 KB

The Classification of Finite Linear Spac

The Classification of Finite Linear Spaces with Flag-Transitive Automorphism Groups of Affine Type

✍ Martin W Liebeck 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 675 KB

Examples 1.1. (Desarguesian affine spaces). Here S is an affine space AG n (q), where n 2 and q n = p d ; we have G 0 1L n (q), and one of the following holds:

Periodic locally soluble groups with the

Periodic locally soluble groups with the minimal condition on centralizers

✍ R.M Bryant; B Hartley 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 368 KB

P-soluble linear groups with Sylow p-int

P-soluble linear groups with Sylow p-intersections of small rank

✍ Thomas J Laffey 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 772 KB

Hamiltonian cycles and paths in vertex-t

Hamiltonian cycles and paths in vertex-transitive graphs with abelian and nilpotent groups

✍ Marc J. Lipman 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 378 KB

In 1968, L. Lovfisz conjectured that every connected, vertex-transitive graph had a Hamiltonian path. In this paper the following results are proved: (1) If a connected graph has a transitive nilpotent group acting on it, then the graph has a Hamiltonian path; (2) a connected, vertex-transitive grap