✦ LIBER ✦

New large sets of t-designs with prescribed groups of automorphisms

✍ Scribed by R. Laue; G. R. Omidi; B. Tayfeh-Rezaie; A. Wassermann

Publisher: John Wiley and Sons
Year: 2007
Tongue: English
Weight: 128 KB
Volume: 15
Category: Article
ISSN: 1063-8539
DOI: 10.1002/jcd.20128

No coin nor oath required. For personal study only.

✦ Synopsis

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 obtained through these direct methods along with known recursive constructions are combined to prove more extensive theorems on the existence of large sets. © 2006 Wiley Periodicals, Inc. J Combin Designs 15: 210–220, 2007

📜 SIMILAR VOLUMES

New large sets of t-designs

✍ Reinhard Laue; Spyros S. Magliveras; Alfred Wassermann 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 170 KB

A Series of Hadamard Designs with Large

A Series of Hadamard Designs with Large Automorphism Groups

✍ Dieter Held; Mario-Osvin Pavčević 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 78 KB

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 pre

A few more large sets of t-designs

✍ Yeow Meng Chee; Spyros S. Magliveras 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 176 KB 👁 1 views

We construct several new large sets of t-designs that are invariant under Frobenius groups, and discuss their consequences. These large sets give rise to further new large sets by means of known recursive constructions including an infinite family of large sets of 3 -(v, 4, λ) designs.

Some Infinite Families of Large Sets of

Some Infinite Families of Large Sets of t-Designs

✍ B. Tayfeh-Rezaie 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 98 KB

A set of necessary conditions for the existence of a large set of t-designs, LS[N] (t, k, v), is N |( v&i k&i ) for i=0, 1, ..., t. We show that these conditions are sufficient for N=3, t=2, 3, or 4, and k 8.

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.

Some results on the existence of large s

Some results on the existence of large sets of t-designs

✍ G. B. Khosrovshahi; R. Tayfeh-Rezaie 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 96 KB 👁 1 views

## Abstract A set of trivial necessary conditions for the existence of a large set of __t__‐designs, __LS__[N](__t,k,__ν), is $N\big | {{\nu \hskip -3.1 \nu}-i \choose k-i}$ for __i__ = 0,…,__t__. There are two conjectures due to Hartman and Khosrovshahi which state that the trivial necessary condi