Division sudokus: invariants, enumeration, and multiple partitions

DOI10.1017/S0017089519000375zbMATH Open1445.05020OpenAlexW2978221078WikidataQ127173593 ScholiaQ127173593MaRDI QIDQ5116563FDOQ5116563

Authors Aleš Drápal, Petr Vojtěchovský

Publication date 18 August 2020

Published in Glasgow Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2101.03995

zbMATH Keywords

Latin squaresudoku partitions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Orthogonal arrays, Latin squares, Room squares (05B15) Loops, quasigroups (20N05)

Abstract: 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.

Recommendations

• scientific article; zbMATH DE number 5178940
• scientific article; zbMATH DE number 5879559
• Fractions of permutations. An application to Sudoku
• Constructing \((3,b)\)-Sudoku pair Latin squares
• On the number of Sudoku squares

Cites work

• scientific article; zbMATH DE number 3132783 (Why is no real title available?)
• scientific article; zbMATH DE number 3693578 (Why is no real title available?)
• scientific article; zbMATH DE number 5879559 (Why is no real title available?)
• scientific article; zbMATH DE number 3391068 (Why is no real title available?)
• An analogue of Ryser's theorem for partial Sudoku squares
• Commutator theory for loops.
• Computing with small quasigroups and loops
• Generalizing Sudoku to three dimensions
• High nonassociativity in order 8 and an associative index estimate
• Homogeneous quasigroups
• Magic squares and sudoku
• Sudoku, Gerechte Designs, Resolutions, Affine Space, Spreads, Reguli, and Hamming Codes
• The CRC handbook of combinatorial designs
• There is no 16-clue sudoku: solving the sudoku minimum number of clues problem via hitting set enumeration

Cited in

(1)

• Extreme nonassociativity in order nine and beyond

Describes a project that uses

Uses Software

• GAP
• Mace4
• LOOPS

This page was built for publication: Division sudokus: invariants, enumeration, and multiple partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5116563)