Determinant formulae for some tiling problems and application to fully packed loops

5Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

We present a number of determinant formulae for the number of tilings of various domains in relation with Alternating Sign Matrix and Fully Packed Loop enumeration.

Cite

CITATION STYLE

APA

Di Francesco, P., Zinn-Justin, P., & Zuber, J. B. (2005). Determinant formulae for some tiling problems and application to fully packed loops. In Annales de l’Institut Fourier (Vol. 55). Association des Annales de l’Institut Fourier. https://doi.org/10.5802/aif.2150

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free