Proof of two conjectures of Zuber on fully packed loop configurations (Q1881686): Difference between revisions

On the \(n\times n\) grid, we add \(2n\) external links, going outward from alternate points on the boundary. A fully packed loop configuration with periodic boundary conditions is a set of disconnected closed loops and paths joining external links such that each vertex is on exactly one loop or path. The configurations are of combinatorial interest because of bijections, such as a bijection with alternating sign matrices [\textit{J. de Gier}, Loops, matchings, and alternating sign matrices, Discrete Math., to appear]. The authors prove two conjectures of \textit{J.-B. Zuber} [On the counting of fully packed loop configurations: some new conjectures, Electron. J.\ Comb. 11, No. 1, Research paper R13, 15 p. (2004; Zbl 1054.05011)] on the enumeration of classes of configurations with certain pairs of external links connected by paths. The proofs are based on bijections between these classes of configurations, rhombus tilings of certain regions, non-intersecting lattice paths, and semi-standard Young tableaux, with the semi-standard Young tableaux enumerated by the hook content formula.