The cubical matching complex revisited

Combinatorial aspects of tessellation and tiling problems (05B45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Abstract: Ehrenborg noted that all tilings of a bipartite planar graph are encoded by its cubical matching complex and claimed that this complex is collapsible. We point out to an oversight in his proof and explain why these complexes can be the union of collapsible complexes. Also, we prove that all links in these complexes are suspensions up to homotopy. Furthermore, we extend the definition of a cubical matching complex to planar graphs that are not necessarily bipartite, and show that these complexes are either contractible or a disjoint union of contractible complexes. For a simple connected region that can be tiled with dominoes (

2 i m e s 1

and

1 i m e s 2

) and

2 i m e s 2

squares, let

f_{i}

denote the number of tilings with exactly

i

squares. We prove that

f_{0} - f_{1} + f_{2} - f_{3} + c d o t s = 1

(established by Ehrenborg) is the only linear relation for the numbers

f_{i}

.

Recommendations

Cites work

Cited in

(6)

This page was built for publication: The cubical matching complex revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5074223)