A bijection between classes of fully packed loops and plane partitions.
A large dihedral symmetry of the set of alternating sign matrices.
A note on domino shuffling.
A reciprocity theorem for domino tilings.
About some Riemann surfaces and plane tilings.
About the domino problem in the hyperbolic plane from an algorithmic point of view
This paper is a contribution to the general tiling problem for the hyperbolic plane. It is an intermediary result between the result obtained by R. Robinson [Invent. Math.44 (1978) 259–264] and the conjecture that the problem is undecidable.
An algorithm for deciding if a polyomino tiles the plane
For polyominoes coded by their boundary word, we describe a quadratic O(n2) algorithm in the boundary length n which improves the naive O(n4) algorithm. Techniques used emanate from algorithmics, discrete geometry and combinatorics on words.
An edge-minimization problem for regular polygons.
Aperiodic Tiles.
Around the Razumov-Stroganov conjecture: proof of a multi-parameter sum rule.
Asymptotic estimates for best and stepwise approximation of convex bodies II.
Aztec diamonds and Baxter permutations.