8 research outputs found
Alternating Sign Matrices and Hypermatrices, and a Generalization of Latin Square
An alternating sign matrix, or ASM, is a -matrix where the
nonzero entries in each row and column alternate in sign. We generalize this
notion to hypermatrices: an hypermatrix is an
{\em 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 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.Comment: 39 page
Fundamental invariants of tensors, Latin hypercubes, and rectangular Kronecker coefficients
We study polynomial SL-invariants of tensors, mainly focusing on fundamental
invariants which are of smallest degrees. In particular, we prove that certain
3-dimensional analogue of the Alon--Tarsi conjecture on Latin cubes considered
previously by B\"urgisser and Ikenmeyer, implies positivity of (generalized)
Kronecker coefficients at rectangular partitions and as a result provides
values for degree sequences of fundamental invariants.Comment: Theorem 1.1 is improved, new sec. 8.3 and Theorem 8.12 are added in
v2. The final version (after referee's comments) to appear in IMR
Alternating Sign Hypermatrix Decompositions of Latin-like Squares
To any Latin square , we may associate a unique sequence of
mutually orthogonal permutation matrices such that . Brualdi and Dahl (2018) described a generalisation of a
Latin square, called an alternating sign hypermatrix Latin-like square (ASHL),
by replacing with an alternating sign hypermatrix (ASHM). An ASHM is an (0,1,-1)-hypermatrix in which the non-zero elements in each
row, column, and vertical line alternate in sign, beginning and ending with
. Since every sequence of mutually orthogonal permutation matrices forms
the planes of a unique ASHM, this generalisation of Latin
squares follows very naturally, with an ASHM having corresponding ASHL , where is the plane of . This paper
addresses some open problems posed in Brualdi and Dahl's article, firstly by
characterising how pairs of ASHMs with the same corresponding ASHL relate to
one another and providing a tight lower bound on for which two ASHMs can correspond to the same ASHL, and secondly by exploring the
maximum number of times a particular integer may occur as an entry of an ASHL. A general construction is given for an ASHL with
the same entry occurring times,
improving considerably on the previous best construction, which achieved the
same entry occuring times
Alternating sign matrices of finite multiplicative order
We investigate alternating sign matrices that are not permutation matrices, but have finite order in a general linear group. We classify all such examples of the form , where P is a permutation matrix and T has four non-zero entries, forming a square with entries 1 and −1 in each row and column. We show that the multiplicative orders of these matrices do not always coincide with those of permutation matrices of the same size. We pose the problem of identifying finite subgroups of general linear groups that are generated by alternating sign matrices
Alternating sign matrices of finite multiplicative order
We investigate alternating sign matrices that are not permutation matrices, but have finite order in a general linear group. We classify all such examples of the form P+T, where P is a permutation matrix and T has four non-zero entries, forming a square with entries 1 and −1 in each row and column. We show that the multiplicative orders of these matrices do not always coincide with those of permutation matrices of the same size. We pose the problem of identifying finite subgroups of general linear groups that are generated by alternating sign matrices
Sign-restricted matrices of 's, 's, and 's
We study {\em sign-restricted matrices} (SRMs), a class of rectangular -matrices generalizing the alternating sign matrices (ASMs). In an SRM
each partial column sum, starting from row 1, equals 0 or 1, and each partial
row sum, starting from column 1, is nonnegative. We determine the maximum
number of nonzeros in SRMs and characterize the possible row and column sum
vectors. Moreover, a number of results on interchange operations are shown,
both for SRMs and, more generally, for -matrices. The Bruhat order
on ASMs can be extended to SRMs with the result a distributive lattice. Also,
we study polytopes associated with SRMs and some relates decompositions
Alternating Signed Bipartite Graphs and Difference-1 Colourings
We investigate a class of 2-edge coloured bipartite graphs known as
alternating signed bipartite graphs (ASBGs) that encode the information in
alternating sign matrices. The central question is when a given bipartite graph
admits an ASBG-colouring; a 2-edge colouring such that the resulting graph is
an ASBG. We introduce the concept of a difference-1 colouring, a relaxation of
the concept of an ASBG-colouring, and present a set of necessary and sufficient
conditions for when a graph admits a difference-1 colouring. The relationship
between distinct difference-1 colourings of a particular graph is
characterised, and some classes of graphs for which all difference-1 colourings
are ASBG-colourings are identified. One key step is Theorem 3.4.6, which
generalises Hall's Matching Theorem by describing a necessary and sufficient
condition for the existence of a subgraph of a bipartite graph in which
each vertex of has some prescribed degree