Generating uniformly distributed random latin squares
From MaRDI portal
Publication:4221860
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6610(1996)4:6<405::AID-JCD3>3.0.CO;2-J" /><405::AID-JCD3>3.0.CO;2-J 10.1002/(SICI)1520-6610(1996)4:6<405::AID-JCD3>3.0.CO;2-JzbMath0913.05027OpenAlexW2056965013WikidataQ56874453 ScholiaQ56874453MaRDI QIDQ4221860
No author found.
Publication date: 8 June 1999
Full work available at URL: https://doi.org/10.1002/(sici)1520-6610(1996)4:6<405::aid-jcd3>3.0.co;2-j
Related Items (38)
Generating Uniformly Distributed Random 2-Designs with Block Size 3 ⋮ Constructing flag-transitive, point-imprimitive designs ⋮ The impact of search heuristics on heavy-tailed behaviour ⋮ Designs on the web ⋮ Mappings of Latin squares ⋮ Half-regular factorizations of the complete bipartite graph ⋮ Generation of proper families of functions ⋮ Exact sampling algorithms for Latin squares and Sudoku matrices via probabilistic divide-and-conquer ⋮ Computing the autotopy group of a Latin square by cycle structure ⋮ Computing Autotopism Groups of Partial Latin Rectangles ⋮ Substructures in Latin squares ⋮ Markov degree of the Birkhoff model ⋮ Switching in one-factorisations of complete graphs ⋮ Pasch trades with a negative block ⋮ Sequential importance sampling for estimating expectations over the space of perfect matchings ⋮ Large deviations in random latin squares ⋮ Monotone Subsequences in High-Dimensional Permutations ⋮ A Markov chain on the solution space of edge colorings of bipartite graphs ⋮ Efficient verification of polynomial completeness of quasigroups ⋮ Multicanonical MCMC for sampling rare events: an illustrative review ⋮ Efficient, local and symmetric Markov chains that generate one-factorizations ⋮ A Novel Quasigroup Substitution Scheme for Chaos Based Image Encryption ⋮ Switching codes and designs ⋮ The cycle switching graph of the Steiner triple systems of order 19 is connected ⋮ On the number of transversals in Cayley tables of cyclic groups ⋮ Random strongly regular graphs? ⋮ Random strongly regular graphs? ⋮ The Sudoku completion problem with rectangular hole pattern is NP-complete ⋮ The cycle structure of two rows in a random Latin square ⋮ Symmetries of partial Latin squares ⋮ Random Latin squares and Sudoku designs generation ⋮ Research problems from the 18th British Combinatorial Conference ⋮ The Glauber dynamics for edge‐colorings of trees ⋮ Refining invariants for computing autotopism groups of partial Latin rectangles ⋮ Most Latin squares have many subsquares ⋮ A generalisation of \(t\)-designs ⋮ Completions of ε-Dense Partial Latin Squares ⋮ Strong polynomial completeness of almost all quasigroups
This page was built for publication: Generating uniformly distributed random latin squares
