On the number of Sudoku squares
type: Item
instance of: scholarly article
title: On the number of Sudoku squares
zbMATH Open document ID: 1395.05010
published in: Discrete Mathematics
publication date: 2018-09-21T00:00:00Z
Mathematics Subject Classification ID: 05A15
zbMATH DE Number: 6941048
zbMATH Keywords: Latin squares
zbMATH Keywords: Sudoku squares
zbMATH Keywords: permanents
zbMATH Keywords: upper bounds on permanents
Wikidata QID: Q60692163
author: Daniel Berend
describes a project that uses: OEIS
MaRDI profile type: Publication
full work available at URL: j.disc.2018.08.005
OpenAlex ID: W2890212064
cites work: Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges
cites work: Some upper bounds for permanents of (0, 1)-matrices
cites work: Q4044717
cites work: Q3936847
cites work: Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
cites work: Asymptotic enumeration of Latin rectangles
cites work: Q5450091
cites work: On the number of \(6 \times 6\) Sudoku grids
cites work: An upper bound for the permanent of \((0,1)\)-matrices.
cites work: An upper bound on the number of high-dimensional permutations
cites work: There Is No 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem via Hitting Set Enumeration
cites work: On the number of Latin squares
cites work: Q4184984
cites work: Groups of orthogonal row-latin squares
cites work: Q5072813
cites work: The many formulae for the number of Latin rectangles
cites work: A course in combinatorics.
cites work: Maximising the permanent and complementary permanent of (0,1)-matrices with constant line sum
cites work: A note on some upper bounds for permanents of (0, 1)-matrices
DOI: 10.1016/J.DISC.2018.08.005
description: scientific article; zbMATH DE number 6941048