Fractions of permutations. An application to Sudoku
From MaRDI portal
Publication:719456
DOI10.1016/J.JSPI.2011.06.001zbMATH Open1235.62105OpenAlexW2059077566MaRDI QIDQ719456FDOQ719456
Authors: Roberto Fontana
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
Recommendations
- Algebraic Generation of Orthogonal Fractional Factorial Designs
- Random Latin squares and Sudoku designs generation
- Construction of Sudoku designs and Sudoku-based uniform designs
- Sudoku-based space-filling designs
- Sudoku, Gerechte Designs, Resolutions, Affine Space, Spreads, Reguli, and Hamming Codes
Cites Work
- Title not available (Why is that?)
- Sudoku, Gerechte Designs, Resolutions, Affine Space, Spreads, Reguli, and Hamming Codes
- Classification of two-level factorial fractions
- Algebraic Generation of Orthogonal Fractional Factorial Designs
- Permutation matrices related to Sudoku
- Title not available (Why is that?)
- 2-level fractional factorial designs which are the union of non trivial regular designs
Cited In (14)
- Bipartite graphs related to mutually disjoint \(S\)-permutation matrices
- Construction of Sudoku-based uniform designs with mixed levels
- On the number of disjoint pairs of S-permutation matrices
- On the probability of two randomly generated \(S\)-permutation matrices to be disjoint
- The linear system for Sudoku and a fractional completion threshold
- Division sudokus: invariants, enumeration, and multiple partitions
- Statistical aspects of SuDoKu-based experimental designs
- Exact sampling algorithms for Latin squares and Sudoku matrices via probabilistic divide-and-conquer
- Construction of Sudoku designs and Sudoku-based uniform designs
- Random Latin squares and Sudoku designs generation
- Sudoku, Gerechte Designs, Resolutions, Affine Space, Spreads, Reguli, and Hamming Codes
- A new algorithm for enumerating all possible Sudoku squares
- On the number of mutually disjoint pairs of \(S\)-permutation matrices
- Calculation of the number of all pairs of disjoint S-permutation matrices
Uses Software
This page was built for publication: Fractions of permutations. An application to Sudoku
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q719456)