When is a partial Latin square uniquely completable, but not its completable product? (Q924972)

Let \(P\) and \(Q\) be uniquely completable partial Latin squares. Determining necessary and sufficient conditions to ensure that the completable product \(P\otimes Q\) is itself uniquely completable remains an open problem. Previously some examples of \(P\) have been given such that \(P\otimes P\) does not have a unique completion. The authors provide a class of such examples by establishing that \(P\otimes P\) is not uniquely completable if the cells of the array of alternatives of \(P\), corresponding to cells of \(P\) not filled with an entry, all contain a set of size two except for one cell which has a set of size three.