English
Related papers

Related papers: Alternating sign matrices of finite multiplicative…

200 papers

In alternating sign matrices the first and last nonzero entry in each row and column is specified to be +1. Such matrices always exist. We investigate a generalization by specifying independently the sign of the first and last nonzero entry…

Combinatorics · Mathematics 2013-09-05 Richard A. Brualdi , Hwa Kyung Kim

An alternating sign matrix is a square matrix satisfying (i) all entries are equal to 1, -1 or 0; (ii) every row and column has sum 1; (iii) in every row and column the non-zero entries alternate in sign. The 8-element group of symmetries…

Combinatorics · Mathematics 2007-05-23 David P. Robbins

An alternating sign matrix is a square matrix with entries 1, 0 and -1 such that the sum of the entries in each row and each column is equal to 1 and the nonzero entries alternate in sign along each row and each column. To some of the…

Combinatorics · Mathematics 2007-05-23 Soichi Okada

We initiate a study of the zero-nonzero patterns of n by n alternating sign matrices. We characterize the row (column) sum vectors of these patterns and determine their minimum term rank. In the case of connected alternating sign matrices,…

Combinatorics · Mathematics 2011-04-22 Richard A. Brualdi , Kathleen P. Kiernan , Seth A. Meyer , Michael W. Schroeder

An alternating sign matrix, or ASM, is a $(0, \pm 1)$-matrix where the nonzero entries in each row and column alternate in sign. We generalize this notion to hypermatrices: an $n\times n\times n$ hypermatrix $A=[a_{ijk}]$ is an {\em…

Combinatorics · Mathematics 2017-04-26 Richard A. Brualdi , Geir Dahl

We investigate multiplicative groups consisting entirely of singular alternating sign matrices (ASMs), and present several constructions of such groups. It is shown that every finite group is isomorphic to a group of singular ASMs, with a…

Rings and Algebras · Mathematics 2024-05-24 Cian O'Brien , Rachel Quinlan

Alternating sign matrices (ASMs) are square matrices with entries 0, 1, or -1 whose rows and columns sum to 1 and whose nonzero entries alternate in sign. We put ASMs into a larger context by studying the order ideals of subposets of a…

Combinatorics · Mathematics 2019-05-22 Jessica Striker

We define a higher spin alternating sign matrix to be an integer-entry square matrix in which, for a nonnegative integer r, all complete row and column sums are r, and all partial row and column sums extending from each end of the row or…

Combinatorics · Mathematics 2011-12-02 Roger E. Behrend , Vincent A. Knight

We consider the alternating sign matrices of the odd order that have some kind of central symmetry. Namely, we deal with matrices invariant under the half-turn, quarter-turn and flips in both diagonals. In all these cases, there are two…

Mathematical Physics · Physics 2008-07-17 Yu. G. Stroganov

I give a survey of different combinatorial forms of alternating-sign matrices, starting with the original form introduced by Mills, Robbins and Rumsey as well as corner-sum matrices, height-function matrices, three-colorings, monotone…

Combinatorics · Mathematics 2007-05-23 James Propp

In recent papers we have studied refined enumerations of alternating sign matrices with respect to a fixed set of top and bottom rows. The present paper is a first step towards extending these considerations to alternating sign matrices…

Combinatorics · Mathematics 2010-08-04 Ilse Fischer

The p-adic valuations of a sequence of integers T(n) counting alternating sign matrices is examined for p=2 and p=3. Symmetry properties of their graphs produce a new proof of the result that characterizes the indices for which T(n) is odd.

Number Theory · Mathematics 2009-01-30 Xinyu Sun , Victor H. Moll

Alternating sign triangles were introduced by Carroll and Speyer in relation to cube recurrence, by analogy to alternating sign matrices for octahedron recurrence. Permutation triangles are the alternating sign triangles whose entries are…

Combinatorics · Mathematics 2021-10-06 Son Nguyen

Alternating sign matrices (ASMs) are square matrices with entries 0, 1, or -1 whose rows and columns sum to 1 and whose nonzero entries alternate in sign. We present a unifying perspective on ASMs and other combinatorial objects by studying…

Combinatorics · Mathematics 2014-08-25 Jessica Striker

We define the alternating sign matrix polytope as the convex hull of nxn alternating sign matrices and prove its equivalent description in terms of inequalities. This is analogous to the well known result of Birkhoff and von Neumann that…

Combinatorics · Mathematics 2018-05-28 Jessica Striker

We completely classify the asymptotic behavior of the number of alternating sign matrices classically avoiding a single permutation pattern, in the sense of [Johansson and Linusson 2007]. In particular, we give a uniform proof of an…

Combinatorics · Mathematics 2025-09-15 Mathilde Bouvel , Eric S. Egge , Rebecca N. Smith , Jessica Striker , Justin M. Troyka

Let $A(n,r;3)$ be the total weight of the alternating sign matrices of order $n$ whose sole `1' of the first row is at the $r^{th}$ column and the weight of an individual matrix is $3^k$ if it has $k$ entries equal to -1. Define the…

Mathematical Physics · Physics 2007-05-23 Yu. G. Stroganov

We define and study a new family of polytopes which are formed as convex hulls of partial alternating sign matrices. We determine the inequality descriptions, number of facets, and face lattices of these polytopes. We also study partial…

Combinatorics · Mathematics 2022-03-09 Dylan Heuer , Jessica Striker

To any $n \times n$ Latin square $L$, we may associate a unique sequence of mutually orthogonal permutation matrices $P = P_1, P_2, ..., P_n$ such that $L = L(P) = \sum kP_k$. Brualdi and Dahl (2018) described a generalisation of a Latin…

Combinatorics · Mathematics 2020-08-18 Cian O'Brien

The alternating-runs polynomial enumerates alternating runs in the symmetric group. There are three formulae for the number of permutations, $R_{n,k}$ in $\mathfrak{S}_n$ with $k$ alternating runs, but all of them are complicated. We show…

Combinatorics · Mathematics 2020-10-20 Hiranya Kishore Dey , Sivaramakrishnan Sivasubramanian
‹ Prev 1 2 3 10 Next ›