In this paper we study various approaches for exploiting symmetries in polynomial optimization problems within the framework of semidefinite programming relaxations. Our special focus is on… (More)

An n× n partial Latin square P is called α-dense if each row and column has at most αn non-empty cells and each symbol occurs at most αn times in P . An n× n array A where each cell contains a subset… (More)

This thesis consists of the four papers listed below and a survey of the research area. Avoiding arrays of odd order by Latin squares Papers I, III and IV are all concerned with a conjecture by… (More)

An (m,m,m)-array of order n is an n×n array such that each cell is assigned a set of at most m symbols from {1, . . . , n} such that no symbol occurs more than m times in any row or column. An… (More)