The t‐designs with prescribed automorphism group, new simple 6‐designs

DOI10.1002/jcd.3180010204zbMath0819.05011OpenAlexW2039560557MaRDI QIDQ4698400

Bernd Schmalz

Publication date: 27 August 1995

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.3180010204

zbMATH Keywords

algorithmautomorphism groupenumerationsymmetric group\(t\)-designsisomorphism types

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Arithmetic and combinatorial problems involving abstract finite groups (20D60)

Related Items

Construction of discrete structures, especially isomers ⋮ EXISTENCE OF -ANALOGS OF STEINER SYSTEMS ⋮ Steiner systems with automorphism groups \(PSL(2,71)\), \(PSL(2,83)\), and \(P\Sigma L(2,3^5)\) ⋮ Unnamed Item ⋮ Simple \(8\)-\((31,12,3080)\), \(8\)-\((40,12,16200)\) and \(8\)-\((40,12,16520)\) designs from \(\mathrm{PSL}(3,5)\) and \(\mathrm{PSL}(4,3)\) ⋮ A recursive construction for simple \(t\)-designs using resolutions ⋮ Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs ⋮ The Kramer-Mesner method with tactical decompositions: some new unitals on 65 points ⋮ Graphical \(t\)-designs via polynomial Kramer-Mesner matrices ⋮ New \(t\)-designs and large sets of \(t\)-designs

Cites Work

• An infinite family of (simple) 6‐designs
• Endliche Gruppen I
• Unnamed Item
• Unnamed Item