Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum
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.
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011
Imran Nasim, Melanie Weber
SCML 2024
M. Shub, B. Weiss
Ergodic Theory and Dynamical Systems