On the number of fully packed loop configurations with a fixed associated matching (Q1773148)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the number of fully packed loop configurations with a fixed associated matching |
scientific article; zbMATH DE number 2161263
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of fully packed loop configurations with a fixed associated matching |
scientific article; zbMATH DE number 2161263 |
Statements
On the number of fully packed loop configurations with a fixed associated matching (English)
0 references
25 April 2005
0 references
Summary: We show that the number of fully packed loop configurations corresponding to a matching with \(m\) nested arches is polynomial in \(m\) if \(m\) is large enough, thus essentially proving two conjectures by \textit{J.-B. Zuber} [Electron. J. Comb. 11, Research paper R13 (2004; Zbl 1054.05011)].
0 references
0.9399937
0 references
0.9139197
0 references
0.9116177
0 references
0.8952492
0 references
0.89432454
0 references
0.88987505
0 references
0.8894886
0 references
0.8862667
0 references
0.87841475
0 references
