A degree problem for two algebraic numbers and their sum (Q2248225)

The paper considers the following three related problems: Find the positive integers \(a, b, c\) for which there exist algebraic numbers \(\alpha, \beta, \gamma\) of degrees \(a, b, c,\) respectively, such that \(\alpha+\beta+ \gamma = 0\). If such \(\alpha, \beta, \gamma\) exists, the authors say that the triplet \((a, b, c)\) is sum-feasible. Similarly, if there are \(\alpha, \beta, \gamma\) with \(\alpha \beta \gamma = 1\), they say that \((a, b, c)\) is product-feasible. Finally, the triplet \((a, b, c)\) is called compositum-feasible, if there exist number fields \(K\) and \(L\) of degrees \(a\) and \(b\) over \(\mathbb{Q}\) such that their compositum has degree \(c\). It is easy to see, using the primitive element theorem, that if the triplet \((a, b, c)\) is compositum-feasible then it is sum-feasible and product-feasible. The main result of the paper gives a table of all \((a, b, c)\) with \(a \leq b \leq c\) and \(b \leq 6\), which are sum-feasible, with one possible exception \((6,6,8)\). The authors say that they will include in another paper the undecided case \((6,6,8)\).