Proof of Razumov-Stroganov conjecture for some infinite families of link patterns

Simple item page
dc.creatorZinn-Justin, P.
dc.date2006-07-07
dc.date.accessioned2026-07-07T07:18:08Z
dc.date.available2026-07-07T07:18:08Z
dc.descriptionWe prove the Razumov--Stroganov conjecture relating ground state of the O(1) loop model and counting of Fully Packed Loops in the case of certain types of link patterns. The main focus is on link patterns with three series of nested arches, for which we use as key ingredient of the proof a generalization of the Mac Mahon formula for the number of plane partitions which includes three series of parameters.
dc.identifierhttps://arxiv.org/abs/math/0607183
dc.identifierhttp://arxiv.org/abs/math/0607183
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/114192
dc.subjectCombinatorics
dc.subjectMathematical Physics
dc.titleProof of Razumov-Stroganov conjecture for some infinite families of link patterns
dc.typetext

Files

Collections

arXiv