Cornell University
Library
Cornell UniversityLibrary

eCommons

Help
Log In(current)
  1. Home
  2. Cornell Computing and Information Science
  3. Computing and Information Science
  4. Computing and Information Science Technical Reports
  5. Polynomial Time Construction for Spatially Balanced Latin Squares

Polynomial Time Construction for Spatially Balanced Latin Squares

File(s)
LeBras_TR_SBLS.pdf (362.14 KB)
Main Technical Report
Permanent Link(s)
https://hdl.handle.net/1813/28697
Collections
Computing and Information Science Technical Reports
Author
Le Bras, Ronan
Perrault, Andrew
Gomes, Carla P.
Abstract

In this paper we propose a construction that generates spatially balanced Latin squares (SBLSs) in polynomial time. These structures are central to the design of agronomic experiments, as they avoid biases that are otherwise unintentionally introduced due to spatial auto-correlation. Previous approaches were able to generate SBLSs of order up to 35 and required about two weeks of computation. Our algorithm runs in O(n2) and generates SBLSs of arbitrary order n where 2n + 1 is prime. For example, this algorithm generates a SBLS of order 999 in a fraction of a second.

Sponsorship
National Science Foundation (NSF Expeditions
in Computing award for Computational Sustainability, grant 0832782;
NSF IIS award, grant 0514429), Intelligent Information Systems Institute, Cornell University (Air Force O ce of Scienti c Research, AFOSR,
grant FA9550-04-1-0151), Natural Sciences and Engineering Research Council of Canada (NSERC)
Date Issued
2012-04-17
Keywords
Quasigroup
•
Latin Square
•
Spatially Balanced
•
Combinatorial Design
•
Agronomic Field Experiments
Type
technical report

Site Statistics | Help

About eCommons | Policies | Terms of use | Contact Us

copyright © 2002-2026 Cornell University Library | Privacy | Web Accessibility Assistance