首页 | 本学科首页   官方微博 | 高级检索  
     检索      


3-Homogeneous latin trades
Authors:Nicholas Cavenagh  Diane Donovan  Ale&#x; Drpal
Institution:

aInstitute for Theoretical Computer Science ITI, Charles University, Malostranské Naměsti 25, 11800, Praha 1, Czech Republic

bDepartment of Mathematics, Centre for Discrete Mathematics and Computing, The University of Queensland, Brisbane, 4072 Qld., Australia

cThe Department of Mathematics, Charles University, Sokolovská 83, 186 75, Praha 8, Czech Republic

Abstract:Let T be a partial latin square and L be a latin square with Tsubset of or equal toL. We say that T is a latin trade if there exists a partial latin square T with TT=empty set such that (L-45 degree ruleT)union or logical sumT is a latin square. A k-homogeneous latin trade is one which intersects each row, each column and each entry either 0 or k times. In this paper, we construct 3-homogeneous latin trades from hexagonal packings of the plane with circles. We show that 3-homogeneous latin trades of size 3 m exist for each mgreater-or-equal, slanted3. This paper discusses existence results for latin trades and provides a glueing construction which is subsequently used to construct all latin trades of finite order greater than three.
Keywords:Latin square  Latin trade  Circle packing
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号