Related papers: The many faces of alternating-sign matrices
We provide a generalization of the Littlewood identity, both sides of which are related to alternating sign matrices. The classical Littlewood identity establishes a nice product formula for the sum of all Schur polynomials. Compared to the…
Cohen--Suciu proved that the cohomology ring of the boundary manifold of a complex projective line arrangement is isomorphic to the double of the cohomology ring of the complement. In this paper, we generalize this result to arbitrary…
A diagonally symmetric alternating sign matrix (DSASM) is a symmetric matrix with entries $-1$, $0$ and $1$, where the nonzero entries alternate in sign along each row and column, and the sum of the entries in each row and column equals…
Half turn symmetric alternating sign matrices (HTSASMs) are special variations of the well-known alternating sign matrices which have a long and fascinating history. HTSASMs are interesting combinatorial objects in their own right and have…
This article is a short review on the relationship between convergent matrix integrals, formal matrix integrals, and combinatorics of maps. We briefly summarize results developed over the last 30 years, as well as more recent discoveries.…
The ensemble of antagonistic matrices is introduced and studied. In antagonistic matrices the entries $\mathcal A_{i,j}$ and $\mathcal A_{j,i}$ are real and have opposite signs, or are both zero, and the diagonal is zero. This…
Three combinatorial matrices are considered and their LU-decompositions were found. This is typically done by (creative) guessing, and necessary proofs are more or less routine calculations.
Hypersubstitutions are mappings which map operation symbols to terms. Terms can be visualized by trees. Hypersubstitutions can be extended to mappings defined on sets of trees. The nodes of the trees, describing terms, are labelled by…
We present a detailed study of the combinatorial interpretation of matrix integrals, including the examples of tessellations of arbitrary genera, and loop models on random surfaces. After reviewing their methods of solution, we apply these…
We prove a conjecture of Cohn and Propp, which refines a conjecture of Bosley and Fidkowski about the symmetry of the set of alternating sign matrices (ASMs). We examine data arising from the representation of an ASM as a collection of…
We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…
The enumeration of diagonally symmetric alternating sign matrices (DSASMs) is studied, and a Pfaffian formula is obtained for the number of DSASMs of any fixed size, where the entries for the Pfaffian are positive integers given by simple…
The Bruhat order on permutation matrices extends to alternating sign matrices via corner-sum matrices, where the order is given by entrywise domination. A classical result of Lascoux and Sch\"utzenberger states that alternating sign…
To a given nonsingular triangular matrix A with entries from a ring, we associate a weighted bipartite graph G(A) and give a combinatorial description of the inverse of A by employing paths in G(A). Under a certain condition, nonsingular…
An identity that is reminiscent of the Littlewood identity plays a fundamental role in recent proofs of the facts that alternating sign triangles are equinumerous with totally symmetric self-complementary plane partitions and that…
In this paper we settle a weak version of a conjecture (i.e. Conjecture 6) by Mills, Robbins and Rumsey in the paper "Self-complementary totally symmetric plane partitions" (J. Combin. Theory Ser. A 42, 277-292). In other words we show that…
Polynomial composites were introduced by Anderson, Anderson, and Zafrullah. Over time, composites have appeared in many different papers, but they have not been sorted out in the algebra world. This paper is another part of the study of…
Checkerboard surfaces in alternating link complements are used frequently to determine information about the link. However, when many crossings are added to a single twist region of a link diagram, the geometry of the link complement…
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…
Colored tensor models have recently burst onto the scene as a promising conceptual and computational tool in the investigation of problems of random geometry in dimension three and higher. We present a snapshot of the cutting edge in this…