On FPL configurations with four sets of nested arches

The problem of counting the number of Fully Packed Loop (FPL) configurations with four sets of a,b,c,d nested arches is addressed. It is shown that it may be expressed as the problem of enumeration of tilings of a domain of the triangular lattice with a conic singularity. After reexpression in terms of non-intersecting lines, the Lindstr\"om-Gessel-Viennot theorem leads to a formula as a sum of determinants. This is made quite explicit when min(a,b,c,d)=1 or 2. We also find a compact determinant formula which generates the numbers of configurations with b=d.Comment: 22 pages, TeX, 16 figures; a new formula for a generating function adde

Inhomogeneous loop models with open boundaries

We consider the crossing and non-crossing O(1) dense loop models on a semi-infinite strip, with inhomogeneities (spectral parameters) that preserve the integrability. We compute the components of the ground state vector and obtain a closed expression for their sum, in the form of Pfaffian and determinantal formulas.Comment: 42 pages, 31 figures, minor corrections, references correcte