Determinant Formulae for some Tiling Problems and Application to Fully Packed Loops

Simple item page
dc.creatorDi Francesco, P.
dc.creatorZinn-Justin, P.
dc.creatorZuber, J. -B.
dc.date2004-10-01
dc.date.accessioned2026-07-07T04:31:30Z
dc.date.available2026-07-07T04:31:30Z
dc.descriptionWe present determinant formulae for the number of tilings of various domains in relation with Alternating Sign Matrix and Fully Packed Loop enumeration.
dc.identifierhttps://arxiv.org/abs/math-ph/0410002
dc.identifierhttp://arxiv.org/abs/math-ph/0410002
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/57838
dc.subjectMathematical Physics
dc.subjectCombinatorics
dc.titleDeterminant Formulae for some Tiling Problems and Application to Fully Packed Loops
dc.typetext

Files

Collections

arXiv