Improved LP lower bounds for difference triangle sets

Abstract

In 1991 Lorentzen and Nilsen showed how to use linear programming to prove lower bounds on the size of difference triangle sets. In this note we show how to improve these bounds by including additional valid linear inequalities in the LP formulation. We also give some new optimal di erence triangle sets found by computer search.