๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Domino Tilings on Orientable Surfaces

โœ Scribed by Kenichi Ito


Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
332 KB
Volume
84
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

โœฆ Synopsis


This paper considers the possibility of tiling surfaces using dominoes. Orientable surfaces consisting of unit squares are studied. It presents more generalized discussions than the necessary and sufficient condition given for the multiply connected surfaces on the author's previous paper (Ito, 1996, J. Combin. Theory Ser. A 75, No. 2, 173 186).

1998 Academic Press

Theorem. An orientable checkerboard-like surface can be tiled with dominoes if and only if the values of all the null-homologous admissible l-cycles are nonnegative.


๐Ÿ“œ SIMILAR VOLUMES


Domino Tilings on Planar Regions
โœ Kenichi Ito ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 465 KB

This paper considers the possibility of tiling regions using dominoes. Multiplyconnected planar regions consisting of unit squares are studied. These regions include subsets of the checkerboard, but other variants are also discussed. It presents more generalized discussions than Thurston's necessary

Embedding Digraphs on Orientable Surface
โœ C.Paul Bonnington; Marston Conder; Margaret Morton; Patricia McKenna ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 166 KB

We consider a notion of embedding digraphs on orientable surfaces, applicable to digraphs in which the indegree equals the outdegree for every vertex, i.e., Eulerian digraphs. This idea has been considered before in the context of compatible Euler tours or orthogonal A-trails by Andersen and by Bouc

On orientable real algebraicM-surfaces
โœ V. A. Krasnov ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› SP MAIK Nauka/Interperiodica ๐ŸŒ English โš– 342 KB
Matchings in Graphs on Non-orientable Su
โœ Glenn Tesler ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 345 KB

We generalize Kasteleyn's method of enumerating the perfect matchings in a planar graph to graphs embedding on an arbitrary compact boundaryless 2-manifold S. Kasteleyn stated that perfect matchings in a graph embedding on a surface of genus g could be enumerated as a linear combination of 4 g Pfaff