Abstract
In Chap. 3 we discussed the various ways to order subsets, partitions and permutations. Similarly, there are various ways to order the blocks of a design. A listing of the blocks of a design such that there is a minimal change between the content of consecutive blocks is a combinatorial Gray code. Note that the minimal change definition will depend on the design parameters. A listing of points such that the blocks of a design are induced by the consecutive subwords is a more structural way of defining minimal change. Universal cycles (Ucycles) are sequences that adhere to such a definition. Another rule for ordering blocks of designs that relates both to content and structure employs configurations. A configuration describes a pattern of intersection for a set of blocks. Unlike Gray codes and Ucycles, configuration ordering is a paradigm unique to designs and can include orderings which are neither Gray codes nor Ucycles. In this chapter we formally introduce the various ways to order the blocks of a design and illustrate them with examples. We include basic results on such orderings, including bounds and fundamental enumerations. This chapter is recommended both to the researcher introducing themselves to this subject, and to the researcher familiar with some previous literature on block design orderings who is interested in generalizations of previous orderings and new ordering definitions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bryce, R.C., Colbourn, C.J.: Prioritized interaction testing for pairwise coverage with seeding and constraints. Inform. Software Tech. 48, 960–970 (2006)
Buhler, J., Jackson, B.: Private communication (2006)
Cohen, M.B., Colbourn, C.J.: Optimal and pessimal orderings of Steiner triple systems in disk arrays. Theoret. Comput. Sci. 297, 103–117 (2003)
Dewar, M.: Gray codes, universal cycles and configuration orderings for block designs. Ph.D. thesis, Carleton University, Ottawa, ON (2007)
Horák, P., Rosa, A.: Decomposing Steiner triple systems into small configurations. Ars Combin. 26, 91–105 (1988)
Jackson, B.W.: Universal cycles of k-subsets and k-permutations. Discrete Math. 117, 141–150 (1993)
Jackson, B.W., Buhler, J., Mayer, R.: A recursive construction for universal cycles of 2-subspaces. Discrete Math. 309(17), 5328–5331 (2009)
McSorley, J.P.: Single-change circular covering designs. Discrete Math. 197/198, 561–588 (1999)
Rothermel, G., Untch, R.H., Chu, C., Harrold, M.J.: Prioritizing test cases for regression testing. IEEE Trans. Software Eng. 27(10), 929–948 (2001)
Wallis, W., Yucas, J.L., Zhang, G.H.: Single-change covering designs. Des. Codes Cryptogr. 3, 9–19 (1992)
Wallis, W.D.: Sequential covering designs. In: Graph Theory, Combinatorics, and Algorithms, (Kalamazoo, MI, 1992), Wiley-Interscience Publication, vol. 1–2, pp. 1203–1210. Wiley, New York (1995)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media New York
About this chapter
Cite this chapter
Dewar, M., Stevens, B. (2012). Ordering the Blocks of Designs. In: Ordering Block Designs. CMS Books in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-4325-4_3
Download citation
DOI: https://doi.org/10.1007/978-1-4614-4325-4_3
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-4324-7
Online ISBN: 978-1-4614-4325-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)