Computing random \(r\)-orthogonal Latin squares

DOI10.1007/978-3-031-49614-1_12MaRDI QIDQ6606227

Sergey Bereg

Publication date: 16 September 2024

zbMATH Keywords

Latin squaresLatin rectangles\(r\)-orthogonal Latin squares

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 25 new \(r\)-self-orthogonal Latin squares
• Sets of partially orthogonal Latin squares and projective planes
• Cycle switches in Latin squares
• The complexity of completing partial Latin squares
• Latin squares without orthogonal mates
• The existence of Latin squares without orthogonal mates
• Completing the spectrum of \(r\)-orthogonal Latin squares
• Mutually orthogonal Latin squares based on cellular automata
• On representatives of subsets.
• Latin Squares with Restricted Transversals
• Small latin squares, quasigroups, and loops
• Generating uniformly distributed random latin squares
• On the maximum number of different ordered pairs of symbols in sets of latin squares
• An existence theorem for latin squares
• On orthogonal Latin squares

This page was built for publication: Computing random \(r\)-orthogonal Latin squares

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606227)