1976
DOI: 10.4153/cjm-1976-124-6
|View full text |Cite
|
Sign up to set email alerts
|

Abelian Steiner Triple Systems

Abstract: A neofield of order v, Nv( + , •), is an algebraic system of v elements including 0 and 1,0 ≠ 1, with two binary operations + and • such that (Nv, + ) is a loop with identity element 0; (Nv*, •) is a group with identity element 1 (where Nv* = Nv\﹛0﹜) and every element of Nv is both right and left distributive (i.e., (y + z)x = yx + zx and x(y + z) = xy + xz for all y, z∈ Nv).

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
5
0

Year Published

1980
1980
2010
2010

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 1 publication
0
5
0
Order By: Relevance
“…For v = 25, the CycleStructurePerm command allows us to see that if G is not an abelian group of order 25 then G possesses at least one permutation g satisfying one of the following properties: It is known that for v = 25 there is a sharply transitive STS(25) with respect to G, when G is an abelian group of order 25, [19]. By Proposition 14 an STS(25) which is invariant under a sharply transitive abelian group G of order 25 yields a bowtie decomposition which is sharply transitive with respect to G. Hence, for v = 25 the only examples of transitive bowtie decompositions are the sharply transitive decompositions under one of the abelian groups of order 25 (cyclic or elementary abelian).…”
Section: The Electronic Journal Of Combinatorics 17 (2010) #R101mentioning
confidence: 99%
See 2 more Smart Citations
“…For v = 25, the CycleStructurePerm command allows us to see that if G is not an abelian group of order 25 then G possesses at least one permutation g satisfying one of the following properties: It is known that for v = 25 there is a sharply transitive STS(25) with respect to G, when G is an abelian group of order 25, [19]. By Proposition 14 an STS(25) which is invariant under a sharply transitive abelian group G of order 25 yields a bowtie decomposition which is sharply transitive with respect to G. Hence, for v = 25 the only examples of transitive bowtie decompositions are the sharply transitive decompositions under one of the abelian groups of order 25 (cyclic or elementary abelian).…”
Section: The Electronic Journal Of Combinatorics 17 (2010) #R101mentioning
confidence: 99%
“…For the other admissible values of v, the existence of a sharply transitive decomposition B v turns out to be equivalent to the existence of a sharply transitive STS(v) (see Proposition 14). In this way, a large class of examples for sharply transitive bowtie decompositions of K v , with v ≡ 1 (mod 12), can be obtained from the abelian STS(v)'s constructed in [19].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…253-255. We are grateful to D. G. Rogers (private communication) for pointing out this result as informing us of the following 3-regular complete mapping of Z 2h \ φ = (1,8,5) (2,10,11) (3,6,24) (4,14,16) (7,19,17) (9,15,20) (12, 23, 18) (13, 22, 21). The above partition was obtained by D. G. Rogers and F. W. Roush by means of a computer search.…”
Section: Note Added In Proofmentioning
confidence: 99%
“…Π For the case k = 6, a 6-regular complete mapping of Z Λ for WΞI (mod 6) can be constructed from a C/P-neofield N v of order v = 2 (mod 6) [1] or from an £ΓP /-matrix of order m Ξ 0 (mod 6) [8]. This result can be extended to show the existence of a 6-regular complete mapping of any abelian group of order = 1 (mod 6) [14]. 4* A related number theoretic problem* Let φ: G -> G be a complete mapping of G, normalized (as in the introduction) so that φ fixes the identity element of G. Then as already noted, φ can be regarded as a permutation ( 1 2 n ) of the elements of G with the property that α έ ~h~i 1 c i (i = 1, , w -1) also constitute all the nonidentity elements of G. We now decompose this permutation into a product of disjoint cycles, and suppose that (b 1 b 2 b r ) is a typical one of these cycles.…”
mentioning
confidence: 99%