On the number of Sudoku squares

D. Berend

doi:10.1016/j.disc.2018.08.005

On the number of Sudoku squares

D. Berend

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

Abstract

We provide an upper bound on the number of n²×n² 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.

Original language	English
Pages (from-to)	3241-3248
Number of pages	8
Journal	Discrete Mathematics
Volume	341
Issue number	11
DOIs	https://doi.org/10.1016/j.disc.2018.08.005
State	Published - 1 Nov 2018

Keywords

Latin squares
Permanents
Sudoku squares
Upper bounds on permanents

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2018.08.005

Cite this

@article{c1c8c56426124822a60dce3d4238cf8d,

title = "On the number of Sudoku squares",

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, Permanents, Sudoku squares, Upper bounds on permanents",

author = "D. Berend",

note = "Publisher Copyright: {\textcopyright} 2018 Elsevier B.V.",

year = "2018",

month = nov,

day = "1",

doi = "10.1016/j.disc.2018.08.005",

language = "English",

volume = "341",

pages = "3241--3248",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "11",

}

TY - JOUR

T1 - On the number of Sudoku squares

AU - Berend, D.

PY - 2018/11/1

Y1 - 2018/11/1

N2 - 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.

AB - 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.

KW - Latin squares

KW - Permanents

KW - Sudoku squares

KW - Upper bounds on permanents

UR - http://www.scopus.com/inward/record.url?scp=85052865586&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2018.08.005

DO - 10.1016/j.disc.2018.08.005

M3 - Article

AN - SCOPUS:85052865586

SN - 0012-365X

VL - 341

SP - 3241

EP - 3248

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 11

ER -

On the number of Sudoku squares

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this