Skip to main content
Erschienen in: Designs, Codes and Cryptography 1/2019

23.04.2018

Sets of mutually orthogonal Sudoku frequency squares

verfasst von: John T. Ethier, Gary L. Mullen

Erschienen in: Designs, Codes and Cryptography | Ausgabe 1/2019

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

We discuss sets of mutually orthogonal frequency Sudoku squares. In particular, we provide upper bounds for the maximum number of such mutually orthogonal squares. In addition, we provide constructions for sets of such squares. We also briefly discuss an extension of these ideas to sets of higher dimensional mutually orthogonal frequency hypercubes.
Literatur
1.
Zurück zum Zitat Bailey R.A., Cameron P.J., Connelly R.: Sudoku, gerechte designs, resolutions, affine space, spreads, reguli, and Hamming codes. Am. Math. Mon. 115, 383–404 (2008).MathSciNetCrossRefMATH Bailey R.A., Cameron P.J., Connelly R.: Sudoku, gerechte designs, resolutions, affine space, spreads, reguli, and Hamming codes. Am. Math. Mon. 115, 383–404 (2008).MathSciNetCrossRefMATH
3.
Zurück zum Zitat Colbourn C.J., Dinitz J.H. (eds.): Handbook of Combinatorial Designs, 2nd edn. CRC Press, Boca Raton (2007). Colbourn C.J., Dinitz J.H. (eds.): Handbook of Combinatorial Designs, 2nd edn. CRC Press, Boca Raton (2007).
4.
Zurück zum Zitat Dénes J., Keedwell A.D.: Latin Squares and Their Applications. Academic Press, New York (1974).MATH Dénes J., Keedwell A.D.: Latin Squares and Their Applications. Academic Press, New York (1974).MATH
5.
Zurück zum Zitat D’haeseleer J., Metsch K., Storme L., Van de Voorde G.: On the maximality of a set of mutually orthogonal Sudoku latin squares. Des. Codes Cryptogr. 84, 143–152 (2017).MathSciNetCrossRefMATH D’haeseleer J., Metsch K., Storme L., Van de Voorde G.: On the maximality of a set of mutually orthogonal Sudoku latin squares. Des. Codes Cryptogr. 84, 143–152 (2017).MathSciNetCrossRefMATH
6.
Zurück zum Zitat Laywine C.F., Mullen G.L.: Discrete Mathematics Using Latin Squares. Wiley, New York (1998).MATH Laywine C.F., Mullen G.L.: Discrete Mathematics Using Latin Squares. Wiley, New York (1998).MATH
7.
Zurück zum Zitat Lidl R., Niederreiter H.: Finite Fields, Encyclopedia of Mathematics and Its Applications, 2nd edn. Cambridge University Press, Cambridge (1997). Lidl R., Niederreiter H.: Finite Fields, Encyclopedia of Mathematics and Its Applications, 2nd edn. Cambridge University Press, Cambridge (1997).
8.
Zurück zum Zitat Mullen G.L.: Polynomial representation of complete sets of frequency squares of prime power order. Discret. Math. 69, 79–84 (1988).MathSciNetCrossRefMATH Mullen G.L.: Polynomial representation of complete sets of frequency squares of prime power order. Discret. Math. 69, 79–84 (1988).MathSciNetCrossRefMATH
9.
Zurück zum Zitat Pederson R., Vis T.: Sets of mutually orthogonal Sudoku Latin Squares. Coll. Math. J. 40(3), 174–180 (2009).MathSciNetCrossRef Pederson R., Vis T.: Sets of mutually orthogonal Sudoku Latin Squares. Coll. Math. J. 40(3), 174–180 (2009).MathSciNetCrossRef
10.
Zurück zum Zitat Street A.P., Street D.J.: Combinatorics of Experimental Design. Oxford University Press, New York (1987).MATH Street A.P., Street D.J.: Combinatorics of Experimental Design. Oxford University Press, New York (1987).MATH
Metadaten
Titel
Sets of mutually orthogonal Sudoku frequency squares
verfasst von
John T. Ethier
Gary L. Mullen
Publikationsdatum
23.04.2018
Verlag
Springer US
Erschienen in
Designs, Codes and Cryptography / Ausgabe 1/2019
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-018-0487-0

Weitere Artikel der Ausgabe 1/2019

Designs, Codes and Cryptography 1/2019 Zur Ausgabe