Alternating sign matrices and hypermatrices, and a generalization of Latin squares

An alternating sign matrix, or ASM, is a (0,±1)-matrix where the nonzero entries in each row and column alternate in sign. We generalize this notion to hypermatrices: an n×n×n hypermatrix A=[aijk] is an alternating sign hypermatrix, or ASHM, if each of its planes, obtained by fixing one of the three indices, is an ASM. Several results concerning ASHMs are shown, such as finding the maximum number of nonzeros of an n×n×n ASHM, and properties related to Latin squares. Moreover, we investigate completion problems, in which one asks if a subhypermatrix can be completed (extended) into an ASHM. We show several theorems of this type.