Loops, Latin Squares and Strongly Regular Graphs: An Algorithmic Approach via Algebraic Combinatorics

Aiso Heinze () and Mikhail Klin ()
Additional contact information
Aiso Heinze: Leibniz Institute for Science Education, Department of Mathematics
Mikhail Klin: Ben-Gurion University of the Negev

A chapter in Algorithmic Algebraic Combinatorics and Gröbner Bases, 2009, pp 3-65 from Springer

Abstract: Summary Using in conjunction computer packages GAP and COCO we establish an efficient algorithmic approach for the investigation of automorphism groups of geometric Latin square graphs. With the aid of this approach an infinite series of proper loops is presented which have a sharply transitive group of collineations. The interest in such loops was expressed by A. Barlotti and K. Strambach.

Keywords: Latin square graph; Loop; Net; Transversal design; Regular subgroup; Computer algebra; Partial difference set; Association scheme (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-01960-9_1

Ordering information: This item can be ordered from
http://www.springer.com/9783642019609

DOI: 10.1007/978-3-642-01960-9_1

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().