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

DOI10.1002/jcd.3180010204zbMath0819.05011MaRDI 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

algorithm; automorphism group; enumeration; symmetric group; \(t\)-designs; isomorphism types

Mathematics Subject Classification ID

05B05: Combinatorial aspects of block designs

20B25: Finite automorphism groups of algebraic, geometric, or combinatorial structures

20D60: Arithmetic and combinatorial problems involving abstract finite groups

Related Items

Graphical \(t\)-designs via polynomial Kramer-Mesner matrices, New \(t\)-designs and large sets of \(t\)-designs, A recursive construction for simple \(t\)-designs using resolutions, Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs, Construction of discrete structures, especially isomers, Steiner systems with automorphism groups \(PSL(2,71)\), \(PSL(2,83)\), and \(P\Sigma L(2,3^5)\), 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)\), EXISTENCE OF -ANALOGS OF STEINER SYSTEMS, The Kramer-Mesner method with tactical decompositions: some new unitals on 65 points, Unnamed Item

Cites Work

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