3-enumerated alternating sign matrices
Yu. G. Stroganov
Abstract
Let A(n,r;3) be the total weight of the alternating sign matrices of order n whose sole `1' of the first row is at the rth column and the weight of an individual matrix is 3k if it has k entries equal to -1. Define the sequence of the generating functions Gn(t)=Σr=1n A(n,r;3)tr-1. Results of two different kind are obtained. On the one hand I made the explicit expression for the even subsequence G2ν(t) in terms of two linear homogeneous second order recurrence in ν (Theorem 1). On the other hand I brought to light the nice connection between the neighbouring functions G2ν+1(t) and G2ν(t) (Theorem 2). The 3-enumeration A(n;3) Gn(1) which was found by Kuperberg is reproduced as well.
Create a lesson
Related papers
Phase transitions in non-Hermitian spherical integrals
Pierre Bousseyroux, Marc Potters
Factorization method for a clamped obstacle from near-field measurements via a far-field transformation
General Ozochiawaeze, Isaac Harris
Asymmetric phase transitions in random noncommutative geometries
Benedek Bukor, Masoud Khalkhali, Samuel Kováčik et al.
A Cumulative Framework for Solid Deformation
Lev Steinberg
Classification of pairs of second-order Hamiltonian operators and hydrodynamic type systems in six components
Giorgio Gubbiotti, Lambertus Van Geemen, Pierandrea Vergallo
Reconstructability of Inverse Problems under Symmetry: Separating Structural, Effective, and Physical Upper Bounds
Isshin Arai