New enumeration formulas for alternating sign matrices and square ice partition functions

The refined enumeration of alternating sign matrices (ASMs) of given order having prescribed behavior near one or more of their boundary edges has been the subject of extensive study, starting with the Refined Alternating Sign Matrix Conjecture of Mills–Robbins–Rumsey (1983) [25], its proof by Zeilberger (1996) [31], and more recent work on doubly-refined and triply-refined enumerations by several authors. In this paper we extend the previously known results on this problem by deriving explicit enumeration formulas for the “top–left–bottom” (triply-refined) and “top–left–bottom–right” (quadruply-refined) enumerations. The latter case solves the problem of computing the full boundary correlation function for ASMs. The enumeration formulas are proved by deriving new representations, which are of independent interest, for the partition function of the square ice model with domain wall boundary conditions at the “combinatorial point” η=2π/3η=2π/3.