Construction of a class of loops via graphs.
The author proposes a constructive technique in order to obtain an involutorial difference loop (ID-loop) of order \(2n\) starting from one of order \(n\) exploiting either the properties of the associated graph or those of the involution set \(I\) acting transitively on a set \(P\) [\textit{H. Karzel} and \textit{H. Wefelscheid}, Result. Math. 23, No. 3-4, 338-354 (1993; Zbl 0788.20034); \textit{H. Karzel, S. Pianta} and \textit{E. Zizioli}, Proceedings of the conference on nearrings and nearfields, Hamburg 2003. Dordrecht: Springer. 235-252 (2005; Zbl 1097.20054), Result. Math. 42, No. 1-2, 74-80 (2002; Zbl 1046.20043)]. After recalling some basic notions and the fundamental relationships among ID-loops, colored graphs and the set \(I\) of involutions the author proceeds to the duplication of the ID-loop \((P,+)\), to investigate the case wherein the new loops inherits from \((P,+)\) the K-loop property, to some examples of loops of order 8 obtained via this procedure. Finally she presents a possible generalization of this method to triplicate an ID-loop.
- Connections between loops of exponent 2, reflection structures and complete graphs with parallelism
- Finite Bol loops
- Groups with an involutory antiautomorphism and \(K\)-loops; application to space-time-world and hyperbolic geometry. I
- scientific article; zbMATH DE number 47663 (Why is no real title available?)
- scientific article; zbMATH DE number 2196206 (Why is no real title available?)
- scientific article; zbMATH DE number 3328200 (Why is no real title available?)
- Inner mappings of Bruck loops
- Left loops, bipartite graphs with parallelism and bipartite involution sets.
- Loops, reflection structures and graphs with parallelism.
- On \(K\)-loops of finite order
- One-factorizations of the complete graph—A survey
- Polar graphs and corresponding involution sets, loops and Steiner triple systems.
- Theory of K-loops
- Loops, reflection structures and graphs with parallelism.
- Connections between loops of exponent 2, reflection structures and complete graphs with parallelism
- Left loops, bipartite graphs with parallelism and bipartite involution sets.
- Construction of graphs with given circular flow numbers
- Slid product of loops: a generalization.
- scientific article; zbMATH DE number 2196206 (Why is no real title available?)
- Amalgam of a loop over an idempotent quasigroup.
- Loops with two-sided inverses constructed by a class of regular permutation sets.
- Polar graphs and corresponding involution sets, loops and Steiner triple systems.
This page was built for publication: Construction of a class of loops via graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380490)