DIVISION SUDOKUS: INVARIANTS, ENUMERATION, AND MULTIPLE PARTITIONS

DOI10.1017/S0017089519000375zbMath1445.05020arXiv2101.03995OpenAlexW2978221078WikidataQ127173593 ScholiaQ127173593MaRDI QIDQ5116563

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)

Related Items

Extreme nonassociativity in order nine and beyond

Uses Software

• GAP
• Mace4
• LOOPS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Commutator theory for loops.
• Homogeneous quasigroups
• There Is No 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem via Hitting Set Enumeration
• An analogue of Ryser's Theorem for partial Sudoku squares
• Generalizing Sudoku to three dimensions
• Sudoku, Gerechte Designs, Resolutions, Affine Space, Spreads, Reguli, and Hamming Codes
• Magic Squares and Sudoku
• High nonassociativity in order 8 and an associative index estimate
• Computing with small quasigroups and loops