Greg Kuperberg
Robbins conjectured, and Zeilberger recently proved, that there are 1!4!7!...(3n-2)!/n!/(n+1)!/.../(2n-1)! alternating sign matrices of order n. We give a new proof of this result using an analysis of the six-vertex state model (also called square ice) based on the Yang-Baxter equation.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Yet another doubly refined enumeration of Alternating Sign Matrices
本文通过引入三个参数重新审视交替符号矩阵的双重细化计数，并推导出新的行列式公式，同时改进了分解猜想。
We introduce a family of planar regions, called Aztec diamonds, and study the ways in which these regions can be tiled by dominoes. Our main result is a generating function that not only gives the number of domino tilings of the Aztec diamond of order $n$ but also provides information about the orientation of the dominoes (vertical versus horizontal) and the accessibility of one tiling from another by means of local modifications. Several proofs of the formula are given. The problem turns out to have connections with the alternating sign matrices of Mills, Robbins, and Rumsey, as well as the s…
We give a bijective proof of an identity relating primed shifted gl(n)-standard tableaux to the product of a gl(n) character in the form of a Schur function and a product of sums of x and y terms. This result generalises a number of well--known results due to Robbins and Rumsey, Chapman, Tokuyama, Okada and Macdonald. An analogous result is then obtained in the case of primed shifted sp(2n)-standard tableaux which are bijectively related to the product of a t-deformed sp(2n) character and another x and y product. All results are also interpreted in terms of alternating sign matrix identities, …
Alternating sign triangles were introduced by Carroll and Speyer in relation to cube recurrence, by analogy to alternating sign matrices for octahedron recurrence. In this paper, we prove the connectivity of alternating sign triangles, which is analogous to the connectivity of alternating sign matrices.
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 either 0 or 1, by analogy with permutation matrices. In this paper, we prove a simple characterization of permutation triangles, originally conjectured by Glick. We will also prove some properties of alternating sign triangles.
This article introduces and investigates a refinement of alternating sign trapezoids by means of Catalan objects and Motzkin paths. Alternating sign trapezoids are a generalisation of alternating sign triangles, which were recently introduced by Ayyer, Behrend and Fischer. We show that the number of alternating sign trapezoids associated with a Catalan object (resp. Motzkin path) is a polynomial function in the length of the shorter base of the trapezoid. We also study the rational roots of the polynomials and formulate several conjectures and derive some partial results. Lastly, we deduce a c…
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, we find the minimum number of nonzero entries and characterize the case of equality. We also study symmetric alternating sign matrices, in particular, those with only zeros on the main diagonal. These give rise to alternating signed graphs without loops, and we determine the maximum number of edges in such graphs. We also consider n by n alternating sign mat…
We extend the author's formula (2011) of weighted counting of inversions on permutations to the one on alternating sign matrices. The proof is based on the sequential construction of alternating sign matrices from the unit matrix recently shown by Brualdi-Schroeder and the author (both 2017) independently.
We exhibit a bijection between Dyck paths and alternating sign matrices which are determined by their antidiagonal sums.
Alternating sign trapezoids have recently been introduced as a generalisation of alternating sign triangles. Fischer established a threefold refined enumeration of alternating sign trapezoids and provided three statistics on column strict shifted plane partitions with the same joint distribution. In this paper, we are able to add a new pair of statistics to these results. More precisely, we consider the number of $-1$s on alternating sign trapezoids and introduce a corresponding statistic on column strict shifted plane partitions that has the same distribution. More generally, we show that the…
In the early 1980s, Mills, Robbins and Rumsey conjectured, and in 1996 Zeilberger proved a simple product formula for the number of $n \times n$ alternating sign matrices with a 1 at the top of the $i$-th column. We give an alternative proof of this formula using our operator formula for the number of monotone triangles with prescribed bottom row. In addition, we provide the enumeration of certain 0-1-(-1) matrices generalizing alternating sign matrices.
The aim of this work is to enumerate alternating sign matrices (ASM) that are quasi-invariant under a quarter-turn. The enumeration formula (conjectured by Duchon) involves, as a product of three terms, the number of unrestricted ASM's and the number of half-turn symmetric ASM's.
Partial Alternating Sign Matrix Bijections and Dynamics
本文研究部分交替符号矩阵，建立其与多种组合对象的双射，并借助Wieland回转、toggles与序理想，证明偏序集上的rowmotion和部分完全填充回路构型上的回转等变双射。
Lascoux and Schützenberger introduced a notion of key associated to any Young tableau. More recently Lascoux defined the key of an alternating sign matrix by recursively removing all -1's in such matrices. But alternating sign matrices are in bijection with monotone triangles, which form a subclass of Young tableaux. We show that in this case these two notions of keys coincide. Moreover we obtain an elegant and direct way to compute the key of any Young tableau, and discuss consequences of our result.
We prove a determinantal identity concerning Schur functions for 2-staircase diagrams lambda=(ln+l',ln,l(n-1)+l',l(n-1),...,l+l',l,l',0). When l=1 and l'=0 these functions are related to the partition function of the 6-vertex model at the combinatorial point and hence to enumerations of Alternating Sign Matrices. A consequence of our result is an identity concerning the doubly-refined enumerations of Alternating Sign Matrices.
Sign-balance of excedances over mod-k-alternating permutations and gamma-positivity
本文研究了mod-k-alternating排列及其错排关于excedance统计量的符号平衡，通过构造矩阵联系行列式求解，并证明了特定条件下excedance枚举多项式的gamma-正性。
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 in each row and column to be either a +1 or a -1. We determine necessary and sufficient conditions for such matrices to exist.
The aim of this work is to enumerate alternating sign matrices (ASM) that are quasi-invariant under a quarter-turn. The enumeration formula (conjectured by Duchon) involves, as a product of three terms, the number of unrestricted ASM's and the number of half-turn symmetric ASM's.
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 the convex hull of the permutation matrices equals the set of all nonnegative doubly stochastic matrices. We count the facets and vertices of the alternating sign matrix polytope and describe its projection to the permutohedron as well as give a complete characterization of its face lattice in terms of modified square ice configurations. Furthermore we prove t…
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 where in addition a number of left and right columns are fixed. The main result is a simple linear relation between the number of $n \times n$ alternating sign matrices where the top row as well as the left and the right column is fixed and the number of $n \times n$ alternating sign matrices where the two top rows and the bottom row is fixed. This may be seen …
We compute 2-enumerations of certain halved alternating sign matrices. In one case the enumeration equals the number of perfect matchings of a halved Aztec diamond. In the other case the enumeration equals the number of perfect matchings of a halved fortress graph. Our results prove three conjectures by Jim Propp.
Alternating sign matrices with a U-turn boundary (UASMs) are a recent generalization of ordinary alternating sign matrices. Here we show that variations of these matrices are in bijective correspondence with certain symplectic shifted tableaux that were recently introduced in the context of a symplectic version of Tokuyama's deformation of Weyl's denominator formula. This bijection yields a formula for the weighted enumeration of UASMs. In this connection use is made of the link between UASMs and certain square ice configuration matrices.
We construct weight-preserving bijections between column strict shifted plane partitions with one row and alternating sign trapezoids with exactly one column in the left half that sums to $1$. Amongst other things, they relate the number of $-1$s in the alternating sign trapezoids to certain elements in the column strict shifted plane partitions that generalise the notion of special parts in descending plane partitions. The advantage of these bijections is that they include configurations with $-1$s, which is a feature that many of the bijections in the realm of alternating sign arrays lack.
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 symmetry classes of alternating sign matrices and their variations, G. Kuperberg associate square ice models with appropriate boundary conditions, and give determinanat and Pfaffian formulae for the partition functions. In this paper, we utilize several determinant and Pfaffian identities to evaluate Kuperberg's determinants and Pfaffians, and express the round p…
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.
For an integer $n\geq 1$, we display a poset $Φ_n$ whose maximal chains are in bijection with the $n\times n$ alternating sign matrices. The Hasse diagram $\widehat Φ_n$ is obtained from the $n$-cube by adding some edges. We show that the dihedral group $D_{2n}$ acts on $\widehat Φ_n$ as a group of automorphisms.
On nu Faces of Partial Alternating Sign Matrix Polytopes
本文定义了$(ν/ λ)$-部分交错符号矩阵多面体，给出其不等式描述，证明它是部分ASM多面体的面，且同时为序多面体和流多面体。
We define a bijection that transforms an alternating sign matrix A with one -1 into a pair (N,E) where N is a (so called) ``neutral'' alternating sign matrix (with one -1) and E is an integer. The bijection preserves the classical parameters of Mills, Robbins and Rumsey as well as three new parameters (including E). It translates vertical reflection of A into vertical reflection of N. A hidden symmetry allows the interchange of E with one of the remaining two new parameters. A second bijection transforms (N,E) into a configuration of lattice paths called ``mixed configuration''.
Halved monotone triangles are a generalisation of vertically symmetric alternating sign matrices (VSASMs). We provide a weighted enumeration of halved monotone triangles with respect to a parameter which generalises the number of $-1$s in a VSASM. Among other things, this enables us to establish a generating function for vertically symmetric alternating sign trapezoids. Our results are mainly presented in terms of constant term expressions. For the proofs, we exploit Fischer's method of operator formulae as a key tool.
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 triangles, tetrahedral order ideals, square ice, gasket-and-basket tilings and full packings of loops.
We study the Schur polynomial expansion of a family of symmetric polynomials related to the refined enumeration of alternating sign matrices with respect to their inversion number, complementary inversion number and the position of the unique $1$ in the top row. We prove that the expansion can be expressed as a sum over totally symmetric plane partitions and we are also able to determine the coefficients. This establishes a new connection between alternating sign matrices and a class of plane partitions, thereby complementing the fact that alternating sign matrices are equinumerous with totall…
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 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\times n\times n$ ASHM, and properties related to Latin squares. Moreover, we investigate completion problems, in which one asks if a subhypermatrix …
We settle a question of Bressoud concerning the existence of an explicit bijection from a class of oriented square-ice graphs to a class of tournaments. We give an algorithm constructing such a bijection.
Enumeration of pattern-avoiding alternating sign matrices: An asymptotic dichotomy
本文对经典避免单个置换模式的交错符号矩阵的计数渐近行为给出完整分类，证明十一个特殊模式有指数上界，其余有超指数下界，并精确枚举同时避免2143和3412且含3个负一的矩阵。
Analysis of moments and cumulants in alternating sign matrices
本文通过伯努利多项式、生成函数和可积核方法，研究了交替符号矩阵中矩和累积量的精确公式及计算方法。
A Bruhat order for Latin squares and alternating sign hypermatrices
本文定义了拉丁方和交错符号超矩阵上的Bruhat序，通过角点和超矩阵的逐点支配关系刻画该序，并证明了角点和超矩阵构成分配格，但不同于二维情形，它不是拉丁方偏序集的Dedekind-MacNeille完备化。
We introduce a new directed graph structure into the set of alternating sign matrices. This includes Bruhat graph (Bruhat order) of the symmetric groups as a subgraph (subposet). Drake-Gerrish-Skandera (2004, 2006) gave characterizations of Bruhat order in terms of total nonnegativity (TNN) and subtraction-free Laurent (SFL) expressions for permutation monomials. With our directed graph, we extend their idea in two ways: first, from permutations to alternating sign matrices; second, $q$-analogs (which we name $q$TNN and $q$SFL properties). %In our discussion, essential sets, introduced by Fult…
The number of $n \times n$ matrices whose entries are either -1, 0, or 1, whose row- and column- sums are all 1, and such that in every row and every column the non-zero entries alternate in sign, is proved to be $[1!4! >... (3n-2)!]/[n!(n+1)! ... (2n-1)!]$, as conjectured by Mills, Robbins, and Rumsey.
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 permutohedra that we show arise naturally as projections of these polytopes. We enumerate facets and also characterize the face lattices of partial permutohedra in terms of chains in the Boolean lattice. Finally, we have a result and a conjecture on the volume of partial permutohedra when one parameter is fixed to be two.
The characterization of an Alternating Sign Matrix using a triplet
本文通过定义三元组并建立交错符号矩阵、六顶点模型与高度函数之间的双射，刻画了交错符号矩阵并揭示了其更多性质。
In a previous article [math.CO/9712207], we derived the alternating-sign matrix (ASM) theorem from the Izergin-Korepin determinant for a partition function for square ice with domain wall boundary. Here we show that the same argument enumerates three other symmetry classes of alternating-sign matrices: VSASMs (vertically symmetric ASMs), even HTSASMs (half-turn-symmetric ASMs), and even QTSASMs (quarter-turn-symmetric ASMs). The VSASM enumeration was conjectured by Mills; the others by Robbins [math.CO/0008045]. We introduce several new types of ASMs: UASMs (ASMs with a U-turn side), UUASMs (t…
A note on near alternating sign matrices with prescribed row and column weights
本文研究具有指定行和列权重的近交替符号矩阵的存在性，通过图论刻画将其转化为二进制数组的邻接图是否为二部图，并指出Gale--Ryser条件不充分，提出猜想并给出基于凸数组和复合构造的正面结果。
Fischer provided a new type of binomial determinant for the number of alternating sign matrices involving the third root of unity. In this paper we prove that her formula, when replacing the third root of unity by an indeterminate $q$, is actually the $(2+q+q^{-1})$-enumeration of alternating sign matrices. By evaluating a generalisation of this determinant we are able to reprove a conjecture of Mills, Robbins and Rumsey stating that the $Q$-enumeration is a product of two polynomials in $Q$. Further we provide a closed product formula for the generalised determinant in the 0-,1- 2- and 3-enum…
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 square, called an alternating sign hypermatrix Latin-like square (ASHL), by replacing $P$ with an alternating sign hypermatrix (ASHM). An ASHM is an $n \times n \times n$ (0,1,-1)-hypermatrix in which the non-zero elements in each row, column, and vertical line alternate in sign, beginning and ending with $1$. Since every sequence of $n$ mutually orthogonal pe…
Mills, Robbins, and Rumsey conjectured, and Zeilberger proved, that the number of alternating sign matrices of order $n$ equals $A(n):={{1!4!7! ... (3n-2)!} \over {n!(n+1)! ... (2n-1)!}}$. Mills, Robbins, and Rumsey also made the stronger conjecture that the number of such matrices whose (unique) `1' of the first row is at the $r^{th}$ column, equals $A(n) {{n+r-2} \choose {n-1}}{{2n-1-r} \choose {n-1}}/ {{3n-2} \choose {n-1}}$. Standing on the shoulders of A.G. Izergin, V. E. Korepin, and G. Kuperberg, and using in addition orthogonal polynomials and $q$-calculus, this stronger conjecture is …
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 been the focus of recent study. Here we explore counting weighted HTSASMs with respect to a number of statistics to derive an orthogonal group version of Tokuyama's factorisation formula, which involves a deformation and expansion of Weyl's denominator formula multiplied by a general linear group character. Deformations of Weyl's original denominator formula…
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 certain poset, proving that they are in bijection with a variety of interesting combinatorial objects, including ASMs, totally symmetric self--complementary plane partitions (TSSCPPs), Catalan objects, tournaments, semistandard Young tableaux, and totally symmetric plane partitions. We use this perspective to prove an expansion of the tournament generating funct…
Monotone triangles are plane integer arrays of triangular shape with certain monotonicity conditions along rows and diagonals. Their significance is mainly due to the fact that they correspond to $n \times n$ alternating sign matrices when prescribing $(1,2,...,n)$ as bottom row of the array. We define monotone $(d,m)$--trapezoids as monotone triangles with $m$ rows where the $d-1$ top rows are removed. (These objects are also equivalent to certain partial alternating sign matrices.) It is known that the number of monotone triangles with bottom row $(k_1,...,k_n)$ is given by a polynomial $α(n…
In 2007, the first author gave an alternative proof of the refined alternating sign matrix theorem by introducing a linear equation system that determines the refined ASM numbers uniquely. Computer experiments suggest that the numbers appearing in a conjecture concerning the number of vertically symmetric alternating sign matrices with respect to the position of the first 1 in the second row of the matrix establish the solution of a linear equation system similar to the one for the ordinary refined ASM numbers. In this paper we show how our attempt to prove this fact naturally leads to a more …
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 of the square acts in an obvious way on square matrices. For any subgroup of the group of symmetries of the square we may consider the subset of matrices invariant under elements of this subgroup. There are 8 conjugacy classes of these subgroups giving rise to 8 symmetry classes of matrices. R. P. Stanley suggested the study of those alternating sign matrices…
We consider various properties and manifestations of some sign-alternating univariate polynomials borne of right-triangular integer arrays related to certain generalizations of the Fibonacci sequence. Using a theory of the root geometry of polynomial sequences developed by J. L. Gross, T. Mansour, T. W. Tucker, and D. G. L. Wang, we show that the roots of these `sign-alternating Gibonacci polynomials' are real and distinct, and we obtain explicit bounds on these roots. We also derive Binet-type closed expressions for the polynomials. Some of these results are applied to resolve finiteness ques…
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 a certain tetrahedral poset and its subposets. We prove the order ideals of these subposets are in bijection with a variety of interesting combinatorial objects, including ASMs, totally symmetric self-complementary plane partitions (TSSCPPs), staircase shaped semistandard Young tableaux, Catalan objects, tournaments, and totally symmetric plane partitions. …
Generalising Latin square orthogonality and Frobenius-König with alternating sign matrices
引入意大利方阵作为拉丁方阵的推广，定义正交性概念，解决Brualdi-Dahl定义的不一致性，并得到正交集最大规模上界、正交伴侣存在条件、无穷正交族和横截等结果，同时证明了一类(0,±1)-矩阵的Frobenius-König型定理。
In their work on the infinite flag variety, Lam, Lee, and Shimozono (2018) introduced objects called bumpless pipe dreams and used them to give a formula for double Schubert polynomials. We extend this formula to the setting of K-theory, giving an expression for double Grothendieck polynomials as a sum over a larger class of bumpless pipe dreams. Our proof relies on techniques found in an unpublished manuscript of Lascoux (2002). Lascoux showed how to write double Grothendieck polynomials as a sum over alternating sign matrices. We explain how to view the Lam-Lee-Shimozono formula as a disguis…
Off-diagonally symmetric alternating sign matrices
本研究给出了奇数阶非对角对称交替符号矩阵（OSASM）计数的乘积公式，还代数证明了偶数阶OSASM的对称性质，解决了相关的全部三个计数猜想。
Heaps of rhombic dodecahedra, catalan congruences on alternating sign matrices, and bases of the Temperley-Lieb algebra
研究了交替符号矩阵格上的卡坦 congruences，证明其与covexillary排列和避免321模式排列的关系，并扩展了温度利布代数的基础。
The weighted projection of an alternating sign matrix (ASM) was introduced by Brualdi and Dahl (2018) as a step towards characterising a generalisation of Latin squares they introduced using alternating sign hypermatrices. If $z_n = (n,\dots,2,1)$, then the weighted projection of an ASM $A$ is equal to $z_n^TA$. Brualdi and Dahl proved that the weighted projection of an $n \times n$ ASM is majorized by the vector $z_n$, and conjectured that any positive integer vector majorized by $z_n$ is the weighted projection of some ASM. The main result of this paper presents a proof of this conjecture, v…
Generalized rank functions and quilts of alternating sign matrices
本文引入了基于两个给定偏序集的交替符号矩阵拼图概念，扩展了多个数学常用概念，并证明了当其中一个偏序集为反链或链时的拼图计数结果。
A conjugacy class $C$ of a finite group $G$ is a sign conjugacy class if every irreducible character of $G$ takes value 0, 1 or -1 on $C$. In this paper we classify the sign conjugacy classes of alternating groups.
For a spanning tree T of a connected graph G and for a labelling ϕ: E(T) \rightarrow {+, -}, ϕis called an alternating sign on a spanning tree T of a graph G if for any cotree edge e \in E(G)-E(T), the unique path in T joining both end vertices of e has alternating signs. In the present note, we prove that any graph has a spanning tree T and an alternating sign on T.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。