Character table sudokus (Q6110317)

It is proved that there are no finite groups whose character tables differ by only one row or only one column. The second part of the statement is elementary. The ``row theorem'' is more involved and relies on arguments in [\textit{S. M. Gagola}, Pacific J. Math. 109, 363--385 (1983; Zbl 0536.20005)], among other results. As the author points out, the difficulties in the proof of this result come from groups with a ``large'' character degree, in the sense of work of \textit{N. Snyder} [Proc. Am. Math. Soc. 136, No. 6, 1893--1903 (2008; Zbl 1145.20005)], \textit{C. Durfee} and \textit{S. Jensen} [J. Algebra 338, No. 1, 197--206 (2011; Zbl 1236.20005)], \textit{I. M. Isaacs} [J. Algebra 348, No. 1, 264--275 (2011; Zbl 1242.20011)] and \textit{H. N. Nguyen} et al. [Manuscr. Math. 149, No. 3--4, 523--546 (2016; Zbl 1344.20012)], among others. In the second part of the paper, the author determines the groups of order \(d(d+e)\) where \(2\leq e\leq 11\) and \(G\) has an irreducible character of degree \(d\). As could be expected, this relies on computations in GAP.