Show simple item record  

dc.contributor.authorCavenagh, Nicholas J.en_NZ
dc.contributor.authorRaass, Vaipunaen_NZ
dc.date.accessioned2017-08-31T02:28:05Z
dc.date.available2016en_NZ
dc.date.available2017-08-31T02:28:05Z
dc.date.issued2016en_NZ
dc.identifier.citationCavenagh, N. J., & Raass, V. (2016). Critical sets of 2-balanced Latin rectangles. Annals of Combinatorics, 1–14. https://doi.org/10.1007/s00026-016-0322-0en
dc.identifier.issn0218-0006en_NZ
dc.identifier.urihttps://hdl.handle.net/10289/11297
dc.description.abstractAn (m, n, 2)-balanced Latin rectangle is an (Formula presented.) array on symbols 0 and 1 such that each symbol occurs n times in each row and m times in each column, with each cell containing either two 0’s, two 1’s or both 0 and 1. We completely determine the structure of all critical sets of the full (m, n, 2)-balanced Latin rectangle (which contains 0 and 1 in each cell). If m, (Formula presented.), the minimum size for such a structure is shown to be (Formula presented.). Such critical sets in turn determine defining sets for (0, 1)-matrices.en_NZ
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.rightsThis is an author’s accepted version of an article published in the journal: Annals of Combinatorics. © 2016 Springer International Publishing.
dc.subjectMathematicsen_NZ
dc.subjectfull designen_NZ
dc.subjectcritical seten_NZ
dc.subject(0, 1)-matrixen_NZ
dc.subjectbalanced Latin rectangleen_NZ
dc.subjectLatin squareen_NZ
dc.titleCritical sets of 2-balanced Latin rectanglesen_NZ
dc.typeJournal Article
dc.identifier.doi10.1007/s00026-016-0322-0en_NZ
dc.relation.isPartOfAnnals of Combinatoricsen_NZ
pubs.begin-page1
pubs.elements-id139585
pubs.end-page14
pubs.publication-statusAccepteden_NZ
dc.identifier.eissn0219-3094en_NZ


Files in this item

This item appears in the following Collection(s)

Show simple item record