There exists a simple non trivial \(t\)-design with an arbitrarily large automorphism group for every \(t\)

DOI10.1023/A:1008377321928zbMath0979.05014MaRDI QIDQ5931252

Michel Sebille

Publication date: 21 February 2002

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

zbMATH Keywords

automorphism group\(t\)-designderived designrecursive constructionresidual design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Related Items (4)

A recursive construction for simple \(t\)-designs using resolutions ⋮ Simple \(t\)-designs: a recursive construction for arbitrary \(t\) ⋮ Hypergraphical \(t\)-designs ⋮ Simple non-trivial designs with an arbitrary automorphism group

This page was built for publication: There exists a simple non trivial \(t\)-design with an arbitrarily large automorphism group for every \(t\)