Unifying some known infinite families of combinatorial 3-designs

DOI10.1016/J.JCTA.2010.10.007zbMATH Open1232.05028OpenAlexW2007455979MaRDI QIDQ2431267FDOQ2431267

Authors: Masakazu Jimbo, Yuta Kunihara, Reinhard Laue, Masanori Sawa 

Publication date: 11 April 2011

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2010.10.007

Recommendations

• Recursive constructions for 3-designs and resolvable 3-designs
• A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs
• On simple 3-designs having 2-resolutions
• A Construction of a Resolvable 3-Design
• scientific article; zbMATH DE number 91012

zbMATH Keywords

simplicityautomorphism3-designresolvabilityJungnickel-Vanstone methodRahilly methodVan Tran methodKöhler theory

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Structural characterization of families of graphs (05C75)

Cites Work

• The Magma algebra system. I: The user language
• A course in combinatorics.
• The CRC handbook of combinatorial designs
• The fundamental construction for 3-designs
• Title not available (Why is that?)
• On Some Tactical Configurations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Candelabra systems and designs
• On Orthogonal Matrices
• On resolvable designs \(S_ 3(3;4,v)\)
• The existence of simple \(S_ 3(3,4,\nu)\)
• Resolvable \(t\)-designs
• Construction of 3-designs using parallelism
• Title not available (Why is that?)
• Recursive constructions for 3-designs and resolvable 3-designs
• An extension theorem for \(t\)-designs
• Title not available (Why is that?)
• An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
• Cyclic one-factorization of the complete graph
• \(k\)-cycle free one-factorizations of complete graphs
• A new class of designs which protect against quantum jumps
• The existence of resolvable Steiner quadruple systems
• Resolvable Steiner Quadruple Systems for the Last 23 Orders
• \(3\)-designs from PGL\((2,q)\)
• On t-Designs and Groups
• New infinite families of simple 5-designs
• k-difference-cycles and the construction of cyclic t-designs
• Orbits on the projective line
• A remark on the action of \(\text{PGL}(2,q)\) and \(\text{PSL}(2,q)\) on the projective line
• A construction for Steiner 3-designs
• Finite topologies and Hamiltonian paths
• Symmetry groups of some perfect 1-factorizations of complete graphs
• Einige einfache fahnenhomogene 3-Blockpläne
• Title not available (Why is that?)
• A construction of designs on \(n+1\) points from multiply homogeneous permutation groups of degree \(n\)
• Title not available (Why is that?)

Cited In (14)

• Infinite families of 3-designs from o-polynomials
• Resolvability of infinite designs
• A new result on Sylvester's problem
• A Construction of a Resolvable 3-Design
• Title not available (Why is that?)
• A construction for infinite families of Steiner 3-designs
• New infinite families of 3-designs from algebraic curves of higher genus over finite fields
• Construction of 3-designs using \((1,\sigma)\)-resolution
• Recursive constructions for 3-designs and resolvable 3-designs
• On simple 3-designs having 2-resolutions
• Point-missing \(s\)-resolvable \(t\)-designs: infinite series of 4-designs with constant index
• A recursive construction for simple \(t\)-designs using resolutions
• Simple \(t\)-designs: a recursive construction for arbitrary \(t\)
• A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs

Uses Software

• Magma

This page was built for publication: Unifying some known infinite families of combinatorial 3-designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431267)