Completions of alternating sign matrices (Q2345517)

An alternating sign matrix \(A\) is a square \((0,\pm 1)\)-matrix such that, ignoring the \(0\)'s, in each row and column, the \(+1\)'s and \(-1\)'s alternate, beginning and ending with a \(+1\). Any matrix obtained from \(A\) by replacing some \(0\)'s by \(+1\) is a completion of \(A\). The authors prove that any bordered-permutation \((0,-1)\)-matrix can be completed to an alternating sign matrix. The uniqueness case is fully characterize.