Abstract
A triple array is a row-column design which carries two balanced incomplete block designs (BIBDs) as substructures. McSorley et al. (Des Codes Cryptogr 35: 21–45, 2005), Section 8, gave one example of a triple array that also carries a third BIBD, formed by its row-column intersections. This triple array was said to be balanced for intersection, and they made a search for more such triple arrays among all potential parameter sets up to some limit. No more examples were found, but some candidates with suitable parameters were suggested. We define the notion of an inner design with respect to a block for a symmetric BIBD and present criteria for when this inner design can be balanced. As triple arrays in the canonical case correspond to SBIBDs, this in turn yields new existence criteria for triple arrays balanced for intersection. In particular, we prove that the residual design of the related SBIBD with respect to the defining block must be quasi-symmetric, and give necessary and sufficient conditions on the intersection numbers. This, together with our parameter bounds enable us to exclude the suggested triple array candidates in McSorley et al. (Des Codes Cryptogr 35: 21–45, 2005) and many others in a wide search. Further we investigate the existence of SBIBDs whose inner designs are balanced with respect to every block. We show as a key result that such SBIBDs must possess the quasi-3 property, and we answer the existence question for all known classes of these designs.
Similar content being viewed by others
References
Agrawal H.: Some methods of construction of designs for two-way elimination of heterogeneity. J. Am. Stat. Ass. 61(316), 1153–1171 (1966)
Bracken C., McGuire G.: Duals of quasi-3 designs are not necessarily quasi-3. Des. Codes Cryptogr. 44(1–3), 157–167 (2007)
Bracken C.: Pseudo quasi-3 designs and their applications to coding theory. J. Combin. Des. 17(5), 411–418 (2009)
Broughton W., McGuire G.: Some observations on quasi-3 designs and hadamard matrices. Des. Codes Cryptogr. 18(1–3), 55–61 (1999)
Broughton W., McGuire G.: On the non-existence of quasi-3 designs. Discr. Math. 262(1–3), 79–87 (2003)
Cameron P.J.: Biplanes. Math. Z. 131, 85–101 (1973)
Cameron P.J.: Near-regularity conditions for designs. Geom. Ded. 2, 213–223 (1973)
Colburn C.J., Dinitz J.H.: The CRC Handbook of Combinatorial Designs, 2nd edn. Chapman & Hall/CRC, Boca Raton (2007)
Eccleston J., Russell K.: Connectedness and orthogonality in multifactor designs. Biometrika 62, 341–345 (1975)
Goethals J.M., Seidel J.J.: Strongly regular graphs derived from combinatorial designs. Can. J. Math. 22, 597–614 (1970)
Hall M. Jr.: Combinatorial Theory, 2nd edn. Wiley, USA (1998)
Ionin Y.J., Shrikhande M.S.: Combinatorics of Symmetric Designs. Cambridge University Press, Cambridge (2006)
Kantor W.M.: Symplectic groups, symmetric designs and line ovals. J. Algebra 33, 43–58 (1975)
McSorley J.P., Phillips N.C.K., Wallis W.D., Yucas J.L.: Double arrays, triple arrays and balanced grids. Des. Codes Cryptogr. 35, 21–45 (2005)
Nilson T.: Pseudo-Youden designs balanced for intersection. J. Stat. Plan. Inference 141, 2030–2034 (2011)
Rosen K.H.: Elementary Number Theory, 5th edn. Addison-Wesley, USA (2004)
Shrikhande S.S., Bhagwandas S.S.: Duals of incomplete block designs. J. Indian Stat. Assoc. 3, 30–37 (1965)
Tonchev V.D.: Embedding of the Witt-Mathieu system S(3, 6, 22) in a symmetric 2−(78, 22, 6) design. Geom. Dedicata 22(1), 49–75 (1987)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by J. D. Key.
Rights and permissions
About this article
Cite this article
Nilson, T., Heidtmann, P. Inner balance of symmetric designs. Des. Codes Cryptogr. 71, 247–260 (2014). https://doi.org/10.1007/s10623-012-9730-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-012-9730-2
Keywords
- Symmetric design
- Triple array
- Balanced for intersection
- Quasi-3 design
- Inner design with respect to a block
- Quasi-symmetric design