A class of fibered loops (Q1101834): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Partitionen endlicher Gruppen / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4769064 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3732452 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nicht-einfache Partitionen endlicher Gruppen / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5629640 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a finite group with a partition / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Projektive Inzidenzgruppoide und Fastalgebren / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fibered indidence loops and kinematic loops / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3786650 / rank | |||
Normal rank |
Revision as of 15:59, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A class of fibered loops |
scientific article |
Statements
A class of fibered loops (English)
0 references
1987
0 references
A fibered loop (P,\({\mathcal F},\cdot)\) is a loop (P,\(\cdot)\) together with a set \({\mathcal F}\) of its subloops pairwise intersecting only in the identity element of (P,\(\cdot)\) and such that \(\cup {\mathcal F}=P\). The aim of this paper is to determine fibered loops which are not groups. The author presents a method to construct such structures for any order \(n\geq 4\) and for countable order. The construction stems from a class of semi-diagonal latin squares \([a_{ij}]\) of order m (i.e. such that \(a_{ii}=i\) for any \(i\in \{1,2,...,m\})\) whose matrices are explicitly determined for any order m. Some properties of the so obtained fibered loops are investigated, in particular it turns out that this method gives proper fibered loops for any order \(n>4\) and that such fibered loops (P,\({\mathcal F},\cdot)\) carry a geometric structure of incidence space if and only if every element of \({\mathcal F}\) is a subgroup of order 2.
0 references
fibered loops
0 references
semi-diagonal latin squares
0 references
incidence space
0 references