Loops of order p^ n+1 with transitive automorphism groups
DOI10.1006/AIMA.1997.1624zbMATH Open0879.20039OpenAlexW2041403920MaRDI QIDQ1362612FDOQ1362612
Authors: Arthur A. Drisko 
Publication date: 25 January 1998
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/aima.1997.1624
Recommendations
isomorphismsSylow theoremsisotopismstransitive automorphism groupsadditive loopsisotopic loopsneofields
Semifields (12K10) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Loops, quasigroups (20N05)
Cites Work
- Title not available (Why is that?)
- On the number of even and odd Latin squares of order \(p+1\)
- Generalized complete mappings, neofields, sequenceable groups and block designs. I
- Title not available (Why is that?)
- Some Results in the Theory of Quasigroups
- Neofields
- Loops with transitive automorphism groups
- Planar Division Neo-Rings
- Cyclic neofields and combinatorial designs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (9)
- Computing Autotopism Groups of Partial Latin Rectangles
- Refining invariants for computing autotopism groups of partial Latin rectangles
- Enumerating partial Latin rectangles
- The Alon-Tarsi conjecture: a perspective on the main results
- On the number of even and odd Latin squares of order \(p+1\)
- PROPER LOOPS OF ORDER η IN WHICH EACH NON-IDENTITY ELEMENT HAS LEFT ORDER η
- On existence of AIP neofields of odd order
- Classification of highly symmetrical translation loops of order \(2p\), \(p\) prime.
- Cycle structure of autotopisms of quasigroups and Latin squares
This page was built for publication: Loops of order \(p^ n+1\) with transitive automorphism groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362612)
