English

Latin bitrades, dissections of equilateral triangles and abelian groups

Combinatorics 2009-07-13 v1

Abstract

Let T=(T,T)T = (T^{\textstyle \ast}, T^{\scriptscriptstyle \triangle}) be a spherical latin bitrade. With each a=(a1,a2,a3)Ta=(a_1,a_2,a_3)\in T^{\textstyle \ast} associate a set of linear equations \eq(T,a)\eq(T,a) of the form b1+b2=b3b_1+b_2=b_3, where b=(b1,b2,b3)b = (b_1,b_2,b_3) runs through T{a}T^{\textstyle \ast} \setminus \{a\}. Assume a1=0=a2a_1 = 0 = a_2 and a3=1a_3 = 1. Then \eq(T,a)\eq(T,a) has in rational numbers a unique solution bi=bˉib_i = \bar b_i. Suppose that bˉicˉi\bar b_i \ne \bar c_i for all b,cTb,c \in T^{\textstyle \ast} such that bicib_i \ne c_i and i{1,2,3}i \in \{1,2,3\}. We prove that then TT^{\scriptscriptstyle \triangle} can be interpreted as a dissection of an equilateral triangle. We also consider group modifications of latin bitrades and show that the methods for generating the dissections can be used for a proof that TT^{\textstyle \ast} can be embedded into the operational table of a finite abelian group, for every spherical latin bitrade TT.

Keywords

Cite

@article{arxiv.0907.1789,
  title  = {Latin bitrades, dissections of equilateral triangles and abelian groups},
  author = {Ales Drapal and Carlo Hamalainen and Viteslav Kala},
  journal= {arXiv preprint arXiv:0907.1789},
  year   = {2009}
}