On the counting of fully packed loop configurations: some new conjectures.
Zuber, J.-B. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Refined counting of fully packed loop configurations.”
On the counting of fully packed loop configurations: some new conjectures.
Around the Razumov-Stroganov conjecture: proof of a multi-parameter sum rule.
Di Francesco, P., Zinn-Justin, P. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dihedral -tilings of the sphere by equilateral and scalene triangles. II.
d'Azevedo Breda, A.M., Ribeiro, Patrícia S., Santos, Altino F. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Equidimensionality of the Brauer loop scheme.
Rothbach, Brian (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dihedral f-tilings of the sphere by equilateral and scalene triangles. III.
D'Azevedo Breda, A.M., Ribeiro, Patrícia S., Santos, Altino F. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bounding the number of edges in permutation graphs.
Keevash, Peter, Loh, Po-Shen, Sudakov, Benny (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Spherical F-tilings by triangles and -sided regular polygons, .
Avelino, Catarina P., Santos, Altino F. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A simple proof of the Aztec diamond theorem.
Eu, Sen-Peng, Fu, Tung-Shan (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Using homological duality in consecutive pattern avoidance.
Khoroshkin, Anton, Shapiro, Boris (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Representing lattices by homotopy groups of graphs
Jiří Tůma (1999)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
In this paper we represent every lattice by subgroups of free groups using the concept of the homotopy group of a graph.