The partition function of the inhomogeneous six-vertex model on an square with domain-wall boundary conditions is given by the Izergin–Korepin determinant. Yu. G. Stroganov (Theoretical and Mathematical Physics 146 (2006) 53–62) showed that when the crossing parameter is a root of unity, , this partition function satisfies a linear functional equation; at it collapses to a three-term relation that determines the partition function by interpolation up to a constant, implies the striking symmetry of the partition function in the union of all spectral parameters, and yields refined and doubly-refined enumeration formulae for alternating sign matrices. The paper derives its basic functional equation for every integer and remarks that it 'appears to be useful for the study of the partition function ', but limits its analysis to the case ('In this paper we limit ourselves to the case '); within that case it left the normalization constants, the closed form of the adjacent-boundary doubly-refined numbers , and the treatment of coincident spectral parameters undetermined. The problem posed is this root-of-unity extension, retaining the generality in of the source's basic functional equation.
Background
The six-vertex model (also called square ice) places arrows on the edges of a square lattice, allowing only the six vertex configurations in which two arrows point into and two out of each site (the ice rule); it is the archetype of an exactly solved two-dimensional lattice model. On an square with domain-wall boundary conditions (DWBC) — all boundary arrows pointing inward on the horizontal sides and outward on the vertical ones — and with spectral parameters and attached to the horizontal and vertical lines, the partition function is given by the Izergin–Korepin determinant: a determinant of the matrix times explicit trigonometric prefactors, found by Izergin on the basis of Korepin's work and recorded in the standard monograph of Korepin, Bogoliubov and Izergin. In the trigonometric weights used by Stroganov, , , , the anisotropy is , where is the crossing parameter. Inhomogeneous DWBC partition functions are also weighted enumerators of alternating sign matrices (ASMs): square matrices with entries in whose nonzero entries alternate in sign along every row and column and sum to one in each. The famous ASM count of Mills, Robbins and Rumsey, and its refinements recording the column of the 1 in the first row, arise as homogeneous specializations of at the so-called combinatorial point (the specialization where all three vertex weights are equal).
Stroganov's paper (the source of this problem) observes that when is a root of unity, satisfies a linear functional equation: summing the Izergin–Korepin determinants with the spectral parameter shifted by , , with explicit trigonometric coefficients, gives identically zero. This basic equation is derived for every integer , but it becomes tractable at , where the identity collapses it to the three-term relation for , the being the remaining spectral parameters. Since is a trigonometric polynomial of degree at most which vanishes at each (its product factor does) and satisfies , the three-term relation and the vanishing conditions determine , hence , up to a multiplicative constant, by interpolation — under the assumption that the are distinct. Two far-reaching consequences follow at . First, is symmetric not only within the sets and separately (true for all ) but in the union of all spectral parameters. Second, homogeneous specializations reproduce the refined ASM enumeration and give formulae for doubly-refined enumerations: , the number of ASMs whose top-row and bottom-row 1s sit in columns and (opposite boundaries), and , the number whose top-row 1 sits in column and whose left-column 1 sits in row (adjacent boundaries). Stroganov proved the linear relation but did not determine in closed form.
The modern understanding of the third-root points is complete. Independently of Stroganov, Okada showed that there equals an explicit prefactor times the Schur function (the irreducible character of the general linear group, a symmetric polynomial) of the double-staircase partition evaluated at all spectral parameters; this single identity fixes every normalization constant, makes the total symmetry manifest, and underlies the subsequent closed theory of doubly-, triply- and quadruply-refined ASM enumerations built by Karklinsky–Romik, Fischer, Ayyer–Romik and Behrend. Aval later gave an elementary proof of the total symmetry that avoids determinants and extends it to half-turn-symmetric ice models (models invariant under a rotation of the lattice). The two third-root points and are related by the standard parameter transformation (with , ), so both are settled.
What has no known analogue is every other root of unity: with , a list that includes the free-fermion point (, ) and, apart from , is untouched by the functional-equation and interpolation machinery. Galleas derived general- functional relations for the DWBC partition function by Yang–Baxter-algebra methods (functional relations for the algebra generated by the model's row monodromy matrix — a different type of equation, not the root-of-unity interpolation), and Garbali carried out the analogous root-of-unity program for the nineteen-vertex Izergin–Korepin model (the integrable spin-1 generalization of the six-vertex model); neither addresses the six-vertex case at . The enhanced total symmetry of the theory does not persist at these points: it already fails at for , where the Izergin–Korepin determinant (equivalently, the domain-wall state sum) takes different values under the swap of one horizontal with one vertical spectral parameter; consequently no representation of as a single symmetric function of all parameters, comparable to the double-staircase Schur formula, can exist there. The free-fermion point , where the Izergin–Korepin matrix becomes a Cauchy-type matrix and an elementary treatment is therefore expected, is the natural entry point; for no tool of comparable power is currently available.
Problem Statement
Carry out, for general roots of unity of the crossing parameter, the program that the source paper develops only at : extend its functional-equation analysis beyond the third root of unity, retaining its basic functional equation, which is valid for every integer . For the inhomogeneous six-vertex model on the square with domain-wall boundary conditions and weights , , , take the crossing parameter with integer (this includes the free-fermion point , , ; the case , , is excluded as settled, being related to the case by the standard transformation (which maps , and leaves the state sum unchanged)):
(1) Start from the basic root-of-unity equation, valid for every :
and reduce it — as the identity does at — to a tractable closed functional equation for a modified partition function analogous to , and solve it by interpolation or an equivalent closed form (determinant, symmetric-function representation, or other exact formula) valid for distinct spectral parameters, with the overall multiplicative constant fixed as an explicit function of and .
The objective is the extension of the root-of-unity functional-equation evaluation of the Izergin–Korepin determinant beyond the third root of unity. If the closed form obtained in part (1) admits specialization or enumeration consequences at those roots of unity — analogues of the refined and doubly-refined boundary-statistics distributions of the theory — they may be reported, but they are not a required part of the target. The other issues left undetermined in the source (the normalization constants and the closed-form determination of at ) are settled by later work and are not part of the target; a solution may use them freely as the reference point.
References
- Yu. G. Stroganov, 'Izergin–Korepin Determinant at a Third Root of Unity', Theoretical and Mathematical Physics 146 (2006), no. 1, 53–62, DOI 10.1007/s11232-006-0006-8 (preprint arXiv:math-ph/0204042, under the title 'A new way to deal with Izergin–Korepin determinant at root of unity'), https://doi.org/10.1007/s11232-006-0006-8
- V. E. Korepin, 'Calculation of norms of Bethe wave functions', Communications in Mathematical Physics 86 (1982) 391–418, DOI 10.1007/BF01212176, https://doi.org/10.1007/BF01212176
- V. E. Korepin, N. M. Bogoliubov, A. G. Izergin, 'Quantum Inverse Scattering Method and Correlation Functions', Cambridge University Press, Cambridge, 1993, DOI 10.1017/CBO9780511628832 (ISBN 9780511628832), https://doi.org/10.1017/CBO9780511628832
- W. H. Mills, D. P. Robbins, H. Rumsey, 'Alternating sign matrices and descending plane partitions', Journal of Combinatorial Theory, Series A 34 (1983) 340–359, DOI 10.1016/0097-3165(83)90068-7, https://doi.org/10.1016/0097-3165(83)90068-7
- Soichi Okada, 'Enumeration of symmetry classes of alternating sign matrices and characters of classical groups', Journal of Algebraic Combinatorics 23 (2006), no. 1, 43–69, DOI 10.1007/s10801-006-6028-3 (preprint arXiv:math/0408234), https://doi.org/10.1007/s10801-006-6028-3
- A. V. Razumov, Yu. G. Stroganov, 'Three-coloring statistical model with domain wall boundary conditions: Functional equations', Theoretical and Mathematical Physics 161 (2009), no. 1, 1325–1339, DOI 10.1007/s11232-009-0119-y (preprint arXiv:0805.0669), https://doi.org/10.1007/s11232-009-0119-y
- J.-C. Aval, 'The symmetry of the partition function of some square ice models', Theoretical and Mathematical Physics 161 (2009), no. 3, 1582–1589, DOI 10.1007/s11232-009-0146-8 (preprint arXiv:0903.0777, under the title 'On the symmetry of the partition function of some square ice models'), https://doi.org/10.1007/s11232-009-0146-8
- Matan Karklinsky, Dan Romik, 'A formula for a doubly refined enumeration of alternating sign matrices', Advances in Applied Mathematics 45 (2010), no. 1, 28–35, DOI 10.1016/j.aam.2009.11.005 (preprint arXiv:0906.3405), https://doi.org/10.1016/j.aam.2009.11.005
- W. Galleas, 'Functional relations for the six-vertex model with domain wall boundary conditions', Journal of Statistical Mechanics: Theory and Experiment (2010) P06008, DOI 10.1088/1742-5468/2010/06/p06008 (preprint arXiv:1002.1623), https://doi.org/10.1088/1742-5468/2010/06/p06008
- Ilse Fischer, 'Linear relations of refined enumerations of alternating sign matrices', Journal of Combinatorial Theory, Series A 119 (2012), no. 3, 556–578, DOI 10.1016/j.jcta.2011.11.005 (preprint arXiv:1008.0527), https://doi.org/10.1016/j.jcta.2011.11.005
- Arvind Ayyer, Dan Romik, 'New enumeration formulas for alternating sign matrices and square ice partition functions', Advances in Mathematics 235 (2013) 161–186, DOI 10.1016/j.aim.2012.11.006 (preprint arXiv:1202.3651), https://doi.org/10.1016/j.aim.2012.11.006
- Roger E. Behrend, 'Multiply-refined enumeration of alternating sign matrices', Advances in Mathematics 245 (2013) 439–499, DOI 10.1016/j.aim.2013.05.026 (preprint arXiv:1203.3187), https://doi.org/10.1016/j.aim.2013.05.026
- Alexander Garbali, 'The domain wall partition function for the Izergin–Korepin nineteen-vertex model at a root of unity', Journal of Statistical Mechanics: Theory and Experiment (2016) 033112, DOI 10.1088/1742-5468/2016/03/033112 (preprint arXiv:1411.2903), https://doi.org/10.1088/1742-5468/2016/03/033112
- P. Zinn-Justin, 'Six-vertex, Loop and Tiling models: Integrability and Combinatorics' (review, 2009), arXiv:0901.0665, https://arxiv.org/abs/0901.0665
- Paul Zinn-Justin, 'Integrability and Combinatorics', in Encyclopedia of Mathematical Physics, Elsevier, 2025, pp. 127–144, DOI 10.1016/B978-0-323-95703-8.00261-5 (preprint arXiv:2404.13221), https://doi.org/10.1016/B978-0-323-95703-8.00261-5
- Guo-Niu Han, Lihong Yang, 'Yet another doubly refined enumeration of Alternating Sign Matrices' (2026), arXiv:2601.10870, https://arxiv.org/abs/2601.10870