z-logo
Premium
Generating Uniformly Distributed Random 2 ‐Designs with Block Size 3
Author(s) -
Drizen Andy L.
Publication year - 2012
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.21301
Subject(s) - mathematics , generalization , combinatorics , markov chain , factorization , block (permutation group theory) , latin square , discrete mathematics , statistics , algorithm , mathematical analysis , rumen , chemistry , food science , fermentation
Jacobson and Matthews introduced the most hopeful method known for efficiently generating uniformly distributed random Latin squares. Cameron conjectures that the same Markov chain will also generate all of the other generalized 2‐designs with block size 3 uniformly at random. For a generalization of Latin squares, we give an affirmative result for any admissible parameter values. We also give the first insight and analysis into a generalization of the 1‐factorization of the complete graph by giving an affirmative result for some admissible parameter values. © 2012 Wiley Periodicals, Inc. J. Combin. Designs 20: 368–380, 2012

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here