arXiv:math/0607183 [math.CO]AbstractReferencesReviewsResources
Proof of Razumov-Stroganov conjecture for some infinite families of link patterns
Published 2006-07-07Version 1
We prove the Razumov--Stroganov conjecture relating ground state of the O(1) loop model and counting of Fully Packed Loops in the case of certain types of link patterns. The main focus is on link patterns with three series of nested arches, for which we use as key ingredient of the proof a generalization of the Mac Mahon formula for the number of plane partitions which includes three series of parameters.
Related articles: Most relevant | Search more
arXiv:1707.02003 [math.CO] (Published 2017-07-07)
Infinite families of 2-designs from GA_1(q) actions
arXiv:2010.12329 [math.CO] (Published 2020-10-22)
Erdös-Hajnal Conjecture for New Infinite Families of Tournaments
arXiv:1912.07531 [math.CO] (Published 2019-12-13)
Infinite families of $2$-designs from a class of linear codes related to Dembowski-Ostrom functions