{ "id": "1407.5174", "version": "v2", "published": "2014-07-19T11:58:59.000Z", "updated": "2015-03-16T03:06:14.000Z", "title": "On the intersection of three or four transversals of the back circulant latin square B_n", "authors": [ "Trent Gregory Marbach" ], "comment": "24 pages", "categories": [ "math.CO" ], "abstract": "A paper by Cavenagh and Wanless diagnosed the possible intersection of any two transversals of the back circulant Latin square B_n, and used the result to completely determine the spectrum for 2-way k-homogeneous latin trades. We give a generalization of this problem for the intersection of \\mu transversals of B_n and provide a construction for this problem, as well as providing base designs for the construction in the cases \\mu= 3, 4 found by a computational search. This result is then applied to the problem of finding \\mu-way k-homogeneous Latin trades. We generalize this problem to the intersection of \\mu transversals of B_n such that the transversals intersect stably (that is, the intersection of any pair of transversals is independent of the choice of the pair) and show that these structures can be used to construct \\mu-way k-homogeneous circulant latin trades of odd order. We provide a number of basic existence and non-existence results for \\mu transversals of B_n that intersect stably, as well as the results of a computational search for small n. This is followed by the principal results of this paper; a construction that covers a large portion of the spectrum when n is sufficiently large, which requires certain base designs. These base designs are provided in the cases \\mu= 3,4, which were found by a computational search. We use this result to find the existence of \\mu-way k-homogeneous circulant latin trades of odd order, for \\mu= 3, 4.", "revisions": [ { "version": "v1", "updated": "2014-07-19T11:58:59.000Z", "title": "The μ-way intersection problem for transversals in Latin squares", "abstract": "A paper by Cavenagh and Wanless diagnosed the possible intersection of any two transversals of the back circulant Latin square Bn. We give a generalization of this problem for the intersection of {\\mu} transversals of Bn and provide a construction for this problem, as well as providing base designs for the construction in the cases {\\mu} = 3, 4 found by a computational search. This result is then applied to the problem of finding {\\mu}-way k-homogeneous Latin trades.", "comment": "21 pages", "journal": null, "doi": null }, { "version": "v2", "updated": "2015-03-16T03:06:14.000Z" } ], "analyses": { "subjects": [ "05B15" ], "keywords": [ "intersection problem", "transversals", "circulant latin square bn", "k-homogeneous latin trades", "computational search" ], "note": { "typesetting": "TeX", "pages": 24, "language": "en", "license": "arXiv", "status": "editable", "adsabs": "2014arXiv1407.5174M" } } }