Permutation matrices related to Sudoku

DOI10.1016/j.laa.2008.12.023zbMath1173.05306OpenAlexW1970454743MaRDI QIDQ1014505

Geir Dahl

Publication date: 29 April 2009

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2008.12.023

zbMATH Keywords

permutation matrixSudokuinterchangesfixed positions

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Matrices of integers (15B36)

Related Items (15)

A new algorithm for enumerating all possible Sudoku squares ⋮ On the number of mutually disjoint pairs of \(S\)-permutation matrices ⋮ Set selection dynamical system neural networks with partial memories, with applications to Sudoku and KenKen puzzles ⋮ On the cardinality of a factor set of binary matrices ⋮ Exact sampling algorithms for Latin squares and Sudoku matrices via probabilistic divide-and-conquer ⋮ Combining Hopfield neural networks, with applications to grid-based mathematics puzzles ⋮ Sudoku associative memory ⋮ Bipartite graphs related to mutually disjoint \(S\)-permutation matrices ⋮ On an algorithm for receiving Sudoku matrices ⋮ On the number of disjoint pairs of S-permutation matrices ⋮ On the probability of two randomly generated \(S\)-permutation matrices to be disjoint ⋮ Calculation of the number of all pairs of disjoint S-permutation matrices ⋮ Fractions of permutations. An application to Sudoku ⋮ Random Latin squares and Sudoku designs generation ⋮ Latin Squares and their Bruhat Order

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Permutation matrices related to Sudoku