Summary
The intriguing similarity between the group multiplication table of a finite group and a Sudoku puzzle is worth exploring. A fundamental question arises: Can a Sudoku puzzle be induced from a group? The answer depends on the context. Our primary finding, established through computer programming, indicates that Sudoku puzzles generated by groups are rare, whereas group tables induced by Sudokus are more common.
Acknowledgment
We express our gratitude for the technical support provided by HPC (High Performance Computing) at West Texas A&M University, enabling the execution of computer programming experiments. This work relied on computations performed on the WTAMU HPC cluster, which was funded by the National Science Foundation (NSF CC* GROWTH 2018841). Furthermore, we extend our appreciation to the editor and the two anonymous reviewers whose invaluable suggestions significantly improved the quality of the paper.
Disclosure statement
No potential conflict of interest was reported by the author(s).
Additional information
Notes on contributors
Phillip Fowler
Phillip Fowler ([email protected]) received his Bachelor of Science in mathematics from West Texas A&M University in 2020.
Elliott Curio
Elliott Curio ([email protected]), formally Elliott McPherson, received his B.S. in mathematics at West Texas A&M University in 2020. Starting in 2021, he began his career in secondary education working as a teacher at Caprock High School.
Qingquan Wu
Qingquan Wu ([email protected]) received his Ph.D. in mathematics from University of Illinois at Urbana-Champaign. He held positions at University of Calgary and Texas A&M International University before joining West Texas A&M University, where he was appointed assistant professor of mathematics.
Yong Yang
Yong Yang ([email protected]) received his Ph.D. in applied mathematics from University of Texas at Arlington in 2017. He joined West Texas A&M University in 2017 and was appointed associate professor of mathematics in 2023.