𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Series of Hadamard Designs with Large Automorphism Groups

✍ Scribed by Dieter Held; Mario-Osvin Pavčević

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
78 KB
Volume
234
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

✦ Synopsis

for helmut wielandt on his 90th birthday Whilst studying a certain symmetric 99 49 24 -design acted upon by a Frobenius group of order 21, it became clear that the design would be a member of an infinite series of symmetric 2q 2 + 1 q 2 q 2 -1 /2 -designs for odd prime powers q. In this note, we present the definition of the series and give some information about the automorphism groups of its members.

📜 SIMILAR VOLUMES

Classification of designs with nontrivia
Classification of designs with nontrivial automorphism groups
✍ Ziba Eslami 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 103 KB

## Abstract In this article, we introduce a new orderly backtrack algorithm with efficient isomorph rejection for classification of __t__‐designs. As an application, we classify all simple 2‐(13,3,2) designs with nontrivial automorphism groups. The total number of such designs amounts to 1,897,386.

New large sets of t-designs with prescri
New large sets of t-designs with prescribed groups of automorphisms
✍ R. Laue; G. R. Omidi; B. Tayfeh-Rezaie; A. Wassermann 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB 👁 1 views

## Abstract In this article, we investigate the existence of large sets of 3‐designs of prime sizes with prescribed groups of automorphisms PSL(2,__q__) and PGL(2,__q__) for __q__ < 60. We also construct some new interesting large sets by the use of the computer program DISCRETA. The results obtain

Classification of 6-(14,7,4) designs wit
Classification of 6-(14,7,4) designs with nontrivial automorphism groups
✍ G. B. Khosrovshahi; M. Mohammad-Noori; B. Tayfeh-Rezaie 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 103 KB

## Abstract In this paper, we introduce some intersection matrices for __t__‐designs. Utilizing these matrices together with a modified version of a backtracking algorithm, we classify all 6‐(14,7,4) and 5‐(13,6,4) designs with nontrivial automorphism groups and obtain 13 and 21 such designs, respe

Loops of Orderpn+1 with Transitive Autom
Loops of Orderpn+1 with Transitive Automorphism Groups
✍ Arthur A. Drisko 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 239 KB

It is shown that isotopic loops of order p n +1, p a prime, which have transitive automorphism groups are in fact isomorphic. The proof uses the Sylow theorems to obtain an isomorphism from an arbitrary isotopism. The result is applied to the additive loops of neofields of order p n +1. ## 1997 Aca