首页 | 本学科首页   官方微博 | 高级检索  
     


On the number of Sudoku squares
Authors:D. Berend
Affiliation:Departments of Mathematics and Computer Science, Ben-Gurion University, Beer Sheva 84105, Israel
Abstract:We provide an upper bound on the number of n2×n2 Sudoku squares, and explain intuitively why there is reason to believe that the bound is tight up to a multiplicative factor of a much smaller order of magnitude. A similar bound is established for Sudoku squares with rectangular regions.
Keywords:Latin squares  Sudoku squares  Permanents  Upper bounds on permanents
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号