Irregular arrays and randomization
From MaRDI portal
Publication:3838466
DOI10.1073/pnas.95.4.1363zbMath0901.05018WikidataQ35858340 ScholiaQ35858340MaRDI QIDQ3838466
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
randomization; planar arrangements; approximate entropy; irregular arrangements; irregular permutations; Latin square arrangements
05B15: Orthogonal arrays, Latin squares, Room squares
Related Items
Some comments on Latin squares and on Graeco-Latin squares, illustrated with postage stamps and old playing cards, On the number of transversals in Cayley tables of cyclic groups, Intrinsic chaos and external noise in population dynamics
Cites Work
- Solutions to two problems of Denes and Keedwell on row-complete latin squares
- New Kinds of Systematic Designs for Spacing Experiments
- Restricted randomization
- Valid randomization
- A Unified Approach to Design of Experiments
- Approximate entropy as a measure of system complexity.
- Not all (possibly) “random” sequences are created equal
- Randomness and degrees of irregularity.