DIVISION SUDOKUS: INVARIANTS, ENUMERATION, AND MULTIPLE PARTITIONS
From MaRDI portal
Publication:5116563
DOI10.1017/S0017089519000375zbMATH Open1445.05020arXiv2101.03995OpenAlexW2978221078WikidataQ127173593 ScholiaQ127173593MaRDI QIDQ5116563FDOQ5116563
Aleš Drápal, Petr Vojtěchovský
Publication date: 18 August 2020
Published in: Glasgow Mathematical Journal (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/2101.03995
Exact enumeration problems, generating functions (05A15) Orthogonal arrays, Latin squares, Room squares (05B15) Loops, quasigroups (20N05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing with small quasigroups and loops
- Sudoku, Gerechte Designs, Resolutions, Affine Space, Spreads, Reguli, and Hamming Codes
- Magic Squares and Sudoku
- Commutator theory for loops.
- There Is No 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem via Hitting Set Enumeration
- Homogeneous quasigroups
- An analogue of Ryser's theorem for partial Sudoku squares
- High nonassociativity in order 8 and an associative index estimate
- Generalizing Sudoku to three dimensions
Cited In (1)
Uses Software
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)
