Determinant Formulae for some Tiling Problems and Application to Fully Packed Loops
P. Di Francesco, P. Zinn-Justin, J. -B. Zuber
Abstract
We present determinant formulae for the number of tilings of various domains in relation with Alternating Sign Matrix and Fully Packed Loop enumeration.
Create a lesson
Related papers
On the Geometric Structure of Hyperbolic Clifford Bundles and Associated Spin Groups
Eduardo Notte-Cuello
Koopman-von Neumann formalism meets contact Hamiltonian systems
Federico Zadra
Lossless propagation bounds for long-range fermionic interactions
Stefan Teufel
Supersymmetric Neuromorphic FitzHugh--Nagumo model
D. Maroulakos, A. Wal, S. K. Mishra et al.
Separatrix splitting in a multiferroic neuromorphic oscillator: toward Arnold diffusion
D. Maroulakos, Z. Toklikishvili, A. Wal et al.
Anderson localisation in infinite and finite resonator crystals with long-range interactions
Habib Ammari, Xin Fu, Wenjia Jing et al.