Extreme weights in Steinhaus triangles

Let {0=w0<w1<w2<…<wm0=w0<w1<w2<…<wm} be the set of weights of binary Steinhaus triangles of size n , and let Wibe the set of sequences in F2n that generate triangles of weight wi. In this paper we obtain the values of wi and the corresponding sets Wi for i¿{2,3,m}i¿{2,3,m}, and partial results for i=m-1i=m-1.Peer ReviewedPostprint (author's final draft

Satins, lattices, and extended Euclid's algorithm

Motivated by the design of satins with draft of period m and step a, we draw our attention to the lattices L(m,a)=¿(1,a),(0,m)¿ where 1=a<m are integers with gcd(m,a)=1. We show that the extended Euclid's algorithm applied to m and a produces a shortest no null vector of L(m, a) and that the algorithm can be used to find an optimal basis of L(m, a). We also analyze square and symmetric satins. For square satins, the extended Euclid's algorithm produces directly the two vectors of an optimal basis. It is known that symmetric satins have either a rectangular or a rombal basis; rectangular basis are optimal, but rombal basis are not always optimal. In both cases, we give the optimal basis directly in terms of m and a.Postprint (published version