Gerechte designs with rectangular regions

DOI10.1002/JCD.20300MaRDI QIDQ3165562zbMATH OpenOpenAlexFDO

Authors Julien Courtiel, Emil R. Vaughan

Publication date 29 October 2012

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1104.0637

zbMATH Keywords

gerechte designLatin squareSudoku

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Abstract: A emph{gerechte framework} is a partition of an $nimesn$ array into $n$ regions of $n$ cells each. A emph{realization} of a gerechte framework is a latin square of order $n$ with the property that when its cells are partitioned by the framework, each region contains exactly one copy of each symbol. A emph{gerechte design} is a gerechte framework together with a realization. We investigate gerechte frameworks where each region is a rectangle. It seems plausible that all such frameworks have realizations, and we present some progress towards answering this question. In particular, we show that for all positive integers $s$ and $t$, any gerechte framework where each region is either an $simest$ rectangle or a $timess$ rectangle is realizable.

Recommendations

• The complexity of constructing gerechte designs
• Mutually orthogonal rectangular gerechte designs
• Latin squares
• Latin squares with disjoint subsquares of two orders
• Perpendicular rectangular Latin arrays

Cites work

• scientific article; zbMATH DE number 4025452 (Why is no real title available?)
• Problems from CGCS Luminy, May 2007
• Sudoku, Gerechte Designs, Resolutions, Affine Space, Spreads, Reguli, and Hamming Codes
• The complexity of constructing gerechte designs

Cited in

(3)

• The complexity of constructing gerechte designs
• Balanced equi-n-squares
• Mutually orthogonal rectangular gerechte designs

This page was built for publication: Gerechte designs with rectangular regions

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