Generating Uniformly Distributed Random 2-Designs with Block Size 3

DOI10.1002/JCD.21301zbMATH Open1253.05045OpenAlexW1489233943MaRDI QIDQ3167102FDOQ3167102

A. L. Drizen

Publication date: 2 November 2012

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

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

Recommendations

• Class-uniformly resolvable designs with block sizes 2 and 3
• Uniformly resolvable pairwise balanced designs with blocksizes two and three
• scientific article
• Uniform group divisible designs with block sizes three and \(n\)
• scientific article; zbMATH DE number 1488316
• Splitting balanced incomplete block designs with block size 3 × 2
• Simple 3-designs with block size \(d\) where \(d|2^n-1\)
• Generalized neighbor designs with block size 3
• Class-uniformly resolvable pairwise balanced designs with block size two and three

zbMATH Keywords

Markov chainfactorizationuniform2-designuniformly distributed random Latin squares

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15)

Cites Work

• Generating uniformly distributed random latin squares
• A generalisation of \(t\)-designs
• Title not available (Why is that?)
• The cycle switching graph of the Steiner triple systems of order 19 is connected
• Mappings of Latin squares
• Pasch trades with a negative block
• Cycle switches in Latin squares
• THE 7 × 7 SQUARES
• An Omission in Norton's List of $7 \times 7$ Squares

Cited In (1)

• Efficient, local and symmetric Markov chains that generate one-factorizations

This page was built for publication: Generating Uniformly Distributed Random 2-Designs with Block Size 3

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