Determinant Formulae for some Tiling Problems and Application to Fully Packed Loops
classification
🧮 math-ph
math.COmath.MP
keywords
determinantformulaefullypackedalternatingapplicationdomainsenumeration
read the original abstract
We present determinant formulae for the number of tilings of various domains in relation with Alternating Sign Matrix and Fully Packed Loop enumeration.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.