DIVISION SUDOKUS: INVARIANTS, ENUMERATION, AND MULTIPLE PARTITIONS

被引:1
|
作者
Drapal, Ales [1 ]
Vojtechovsky, Petr [2 ]
机构
[1] Charles Univ Prague, Dept Math, Sokolovska 83, Prague 18675 8, Czech Republic
[2] Univ Denver, Dept Math, 2390 S York St, Denver, CO 80208 USA
关键词
05B15; 20N05;
D O I
10.1017/S0017089519000375
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A division sudoku is a latin square whose all six conjugates are sudoku squares. We enumerate division sudokus up to a suitable equivalence, introduce powerful invariants of division sudokus, and also study latin squares that are division sudokus with respect to multiple partitions at the same time. We use nearfields and affine geometry to construct division sudokus of prime power rank that are rich in sudoku partitions.
引用
收藏
页码:600 / 630
页数:31
相关论文
共 50 条