Division sudokus: invariants, enumeration, and multiple partitions
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)
Full work available at URL: https://arxiv.org/abs/2101.03995
Recommendations
Exact enumeration problems, generating functions (05A15) Orthogonal arrays, Latin squares, Room squares (05B15) Loops, quasigroups (20N05)
Cites Work
- Computing with small quasigroups and loops
- Title not available (Why is that?)
- Sudoku, Gerechte Designs, Resolutions, Affine Space, Spreads, Reguli, and Hamming Codes
- Magic Squares and Sudoku
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Commutator theory for loops.
- There Is No 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem via Hitting Set Enumeration
- Homogeneous quasigroups
- Title not available (Why is that?)
- 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)