Row-complete latin squares of every composite order exist
From MaRDI portal
Recommendations
- A product theorem for row-complete Latin squares
- Complete Latin squares of order \(p^n\) exist for odd primes \(p\) and \(n>2\)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Some matrix constructions of L₂-type Latin square designs
- scientific article; zbMATH DE number 1529466
- scientific article; zbMATH DE number 1743825
- Sequenceable groups and related topics.
- scientific article; zbMATH DE number 3880723
Cited in
(15)- Choosing cross-over designs when few subjects are available
- Universal optimality of balanced uniform crossover designs
- Infinite Latin squares: neighbor balance and orthogonality
- The spectrum of group-based complete Latin squares
- Optimal and efficient crossover designs for comparing test treatments with a control treatment
- A review of uniform cross-over designs
- The construction of nearly balanced and nearly strongly balanced uniform cross-over designs
- scientific article; zbMATH DE number 54789 (Why is no real title available?)
- A product theorem for row-complete Latin squares
- Bounding the growth factor in Gaussian elimination for Buckley's class of complex symmetric matrices
- What (quilting) circles can be squared?
- On the growth factor in Gaussian elimination for generalized Higham matrices
- New complete Latin squares of odd order
- There are infinitely many Williams squares with circular structure and order a multiple of 4
- Large sets of Hamilton cycle and path decompositions
This page was built for publication: Row-complete latin squares of every composite order exist
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4222176)
