Fractions of permutations. An application to Sudoku
From MaRDI portal
Publication:719456
DOI10.1016/j.jspi.2011.06.001zbMath1235.62105OpenAlexW2059077566MaRDI QIDQ719456
Publication date: 10 October 2011
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jspi.2011.06.001
Related Items (9)
Construction of Sudoku-based uniform designs with mixed levels ⋮ On the number of mutually disjoint pairs of \(S\)-permutation matrices ⋮ Exact sampling algorithms for Latin squares and Sudoku matrices via probabilistic divide-and-conquer ⋮ Bipartite graphs related to mutually disjoint \(S\)-permutation matrices ⋮ On the number of disjoint pairs of S-permutation matrices ⋮ Construction of Sudoku designs and Sudoku-based uniform designs ⋮ 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 ⋮ Random Latin squares and Sudoku designs generation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- 2-level fractional factorial designs which are the union of non trivial regular designs
- Permutation matrices related to Sudoku
- Classification of two-level factorial fractions
- Algebraic Generation of Orthogonal Fractional Factorial Designs
- Sudoku, Gerechte Designs, Resolutions, Affine Space, Spreads, Reguli, and Hamming Codes
This page was built for publication: Fractions of permutations. An application to Sudoku