most citedOn the number of fully packed loop configurations with a fixed associated matching

1 citations · 1 across the 2 of their papers we have counts for

collaborators
Showing math.COShow all

2 papers · 1 filter

math.CO2008

A normalization formula for the Jack polynomials in superspace and an identity on partitions

Luc Lapointe, Yvan Le Borgne, Philippe Nadeau

We prove a previously conjectured closed form formula for the norm of the Jack polynomials in superspace with respect to a certain scalar product. The proof is mainly combinatorial…

math.CO2005★ 1 cited

On the number of fully packed loop configurations with a fixed associated matching

Fabrizio Caselli, Christian Krattenthaler, Bodo Lass +1

We show that the number of fully packed loop configurations corresponding to a matching with nested arches is polynomial in if is large enough, thus essentially proving…