Dinitz, Jeffrey H. and Lamken, Esther R. (2000) HOPs and COPs: Room frames with partitionable transversals. Designs, Codes and Cryptography, 19 (1). pp. 5-26. ISSN 0925-1022. doi:10.1023/A:1008334412968. https://resolver.caltech.edu/CaltechAUTHORS:20170408-155932537
![]() |
PDF
- Submitted Version
See Usage Policy. 260kB |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20170408-155932537
Abstract
In this paper, we construct Room frames with partitionable transversals. Direct and recursive constructions are used to find sets of disjoint complete ordered partitionable (COP) transversals and sets of disjoint holey ordered partitionable (HOP) transversals for Room frames. Our main results include upper and lower bounds on the number of disjoint COP transversals and the number of disjoint HOP transversals for Room frames of type 2n. This work is motivated by the large number of applications of these designs.
Item Type: | Article | |||||||||
---|---|---|---|---|---|---|---|---|---|---|
Related URLs: |
| |||||||||
Additional Information: | © 2000 Kluwer. Received March 5, 1997; Accepted November 13, 1998. Communicated by: J. D. Key. | |||||||||
Subject Keywords: | Room squares, room frames | |||||||||
Issue or Number: | 1 | |||||||||
DOI: | 10.1023/A:1008334412968 | |||||||||
Record Number: | CaltechAUTHORS:20170408-155932537 | |||||||||
Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:20170408-155932537 | |||||||||
Official Citation: | Dinitz, J.H. & Lamken, E.R. Designs, Codes and Cryptography (2000) 19: 5. doi:10.1023/A:1008334412968 | |||||||||
Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | |||||||||
ID Code: | 76106 | |||||||||
Collection: | CaltechAUTHORS | |||||||||
Deposited By: | 1Science Import | |||||||||
Deposited On: | 12 Jun 2017 23:36 | |||||||||
Last Modified: | 03 Oct 2019 16:57 |
Repository Staff Only: item control page