✦ LIBER ✦

Steiner triple systems with a doubly transitive automorphism group

✍ Scribed by Marshall Hall Jr.

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 490 KB
Volume: 38
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(85)90069-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

SGDs with doubly transitive automorphism

SGDs with doubly transitive automorphism group

✍ Cameron, Peter J. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 168 KB

Symmetric graph designs, or SGDs, were defined by Gronau et al. as a common generalization of symmetric BIBDs and orthogonal double covers. This note gives a classification of SGDs admitting a 2-transitive automorphism group. There are too many for a complete determination, but in some special cases

Steiner triple systems with transrotatio

Steiner triple systems with transrotational automorphisms

✍ Robert B. Gardner 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 373 KB

A Steiner triple system of order u is said to be k-transrotational if it admits an automorphism consisting of a fixed point, a transposition, and k cycles of length (u-3)/k. Necessary and sufficient conditions are given for the existence of l-and 2-transrotational Steiner triple systems.

On the groups of automorphisms of Steine

On the groups of automorphisms of Steiner triple and quadruple systems

✍ Eric Mendelsohn 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 405 KB

Generalized steiner triple systems with

Generalized steiner triple systems with group size five

✍ K. Chen; G. Ge; L. Zhu 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 2 views

Generalized Steiner triple systems, GS(2, 3, n, g) are used to construct maximum constant weight codes over an alphabet of size g 1 with distance 3 and weight 3 in which each codeword has length n. The existence of GS(2, 3, n, g) has been solved for g 2, 3, 4, 9. In this paper, by introducing a spec

On automorphism groups of non-associativ

On automorphism groups of non-associative algebras associated with doubly transitive groups

✍ Harry P Allen 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 299 KB

Constructing 4-Valent 12-Transitive Grap

Constructing 4-Valent 12-Transitive Graphs with a Nonsolvable Automorphism Group

✍ Aleksander Malnič; Dragan Marušič 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 149 KB

A graph is said to be 1 2 -transitive if its automorphism group acts transitively on vertices and edges but not on arcs. For each n 11, a 1 2 -transitive graph of valency 4 and girth 6, with the automorphism group isomorphic to A n \_Z 2 , is given.