Related papers: Symmetry Classes of Alternating Sign Matrices

While modern optics is largely a physics of harmonic oscillators and two-by-two matrices, it is possible to learn about some hidden properties of the two-by-two matrix from optical systems. Since two-by-two matrices can be divided into…

A set of permutations is called sign-balanced if the set contains the same number of even permutations as odd permutations. Let $S_n(\sigma_1, \sigma_2, \ldots, \sigma_r)$ be the set of permutations in the symmetric group $S_n$ which avoids…

A novel factorization for the sum of two single-pair matrices is established as product of lower-triangular, tridiagonal, and upper-triangular matrices, leading to semi-closed-form formulas for tridiagonal matrix inversion. Subsequent…

It is shown that each subgroup of odd index in an alternating group of degree at least 10 has all insoluble composition factors to be alternating. A classification is then given of 2-arc-transitive graphs of odd order admitting an…

Monodromy groups, i.e. the groups of isometries of the intersection lattice L_X:=H_2/torsion generated by the monodromy action of all deformation families of a given surface, have been computed in math.AG/0006231 for any minimal elliptic…

For a regular coupled cell network, synchrony subspaces are the polydiagonal subspaces that are invariant under the network adjacency matrix. The complete lattice of synchrony subspaces of an $n$-cell regular network can be seen as an…

In this paper, we present new objects, quilts of alternating sign matrices with respect to two given posets. Quilts generalize several commonly used concepts in mathematics. For example, the rank function on submatrices of a matrix gives…

We propose a specific class of matrices which participate in factorization problems that turn to be equivalent to constant and entwining (non-constant) pentagon, reverse-pentagon or Yang-Baxter maps, expressed in non-commutative variables.…

If a graph has a non-singular adjacency matrix, then one may use the inverse matrix to define a (labeled) graph that may be considered to be the inverse graph to the original one. It has been known that an adjacency matrix of a tree is…

We point out the existence of an arithmetical symmetry for the commutant of the modular matrices S and T. This symmetry holds for all affine simple Lie algebras at all levels and implies the equality of certain coefficients in any modular…

The piezoelectricity law is a constitutive model that describes how mechanical andelectric fields are coupled within a material. In its linear formulation this law comprises threeconstitutive tensors of increasing order: the second order…

Compared to the entrywise transforms which preserve positive semidefiniteness, those leaving invariant the inertia of symmetric matrices reveal a surprising rigidity. We first obtain the classification of negativity preservers by combining…

We analyze a combinatorial rule satisfied by the signs of principal minors of a real symmetric matrix. The sign patterns satisfying this rule are equivalent to uniform oriented Lagrangian matroids. We first discuss their structure and…

Symmetry is an important feature of many constraint programs. We show that any problem symmetry acting on a set of symmetry breaking constraints can be used to break symmetry. Different symmetries pick out different solutions in each…

We show that all spin groups of non-definite, quinary quadratic forms over a field with characteristic 0 can be represented as 2 by 2 matrices with entries in an associated quaternion algebra. Over local and global fields, we further study…

Using determinant representations for partition functions of the corresponding square ice models and the method proposed recently by one of the authors, we investigate refined enumerations of vertically symmetric alternating-sign matrices,…

Two matrices are said non-overlapping if one of them can not be put on the other one in a way such that the corresponding entries coincide. We provide a set of non-overlapping binary matrices and a formula to enumerate it which involves the…

The study of tilings is a major problem in many mathematical instances, which is studied in two main different approaches: when considering the existence (or obstructions to the existence) of a tiling with a given tile and the other…

If every element of a matrix group is similar to a permutation matrix, then it is called a permutation-like matrix group. References [4] and [5] showed that, if a permutation-like matrix group contains a maximal cycle of length equal to a…

We develop a structure theory for nilpotent symplectic alternating algebras. We then give a classification of all nilpotent symplectic alternating algebras of dimension up to 10 over any field. The study reveals a new subclasses of powerful…