Irregular arrays and randomization

DOI10.1073/PNAS.95.4.1363MaRDI QIDQ3838466zbMATH OpenOpenAlexWikidataFDO

Authors Steve Pincus, Burton H. Singer

Publication date 13 August 1998

Published in Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1073/pnas.95.4.1363

zbMATH Keywords

approximate entropyirregular arrangementsirregular permutationsLatin square arrangementsplanar arrangementsrandomization

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Recommendations

• Randomness and degrees of irregularity.
• Observations on the generation of permutations from random sequences
• A recipe for randomness
• Not all (possibly) “random” sequences are created equal

Cites work

• A Unified Approach to Design of Experiments
• Approximate entropy as a measure of system complexity.
• New Kinds of Systematic Designs for Spacing Experiments
• Not all (possibly) “random” sequences are created equal
• Randomness and degrees of irregularity.
• Restricted randomization
• Solutions to two problems of Denes and Keedwell on row-complete latin squares
• Valid randomization

Cited in

(5)

• Intrinsic chaos and external noise in population dynamics
• scientific article; zbMATH DE number 721906 (Why is no real title available?)
• Some comments on Latin squares and on Graeco-Latin squares, illustrated with postage stamps and old playing cards
• Latin squares at Rothamsted in the time of Fisher and Yates
• On the number of transversals in Cayley tables of cyclic groups

This page was built for publication: Irregular arrays and randomization

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