Cut-and-paste of quadriculated disks and arithmetic properties of the adjacency matrix

From MaRDI portal
Publication:962133

DOI10.1016/J.LAA.2009.09.003zbMATH Open1219.05038arXiv0904.4814OpenAlexW2100325739MaRDI QIDQ962133FDOQ962133

Nicolau C. Saldanha, Carlos Tomei

Publication date: 6 April 2010

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: We define cut-and-paste, a construction which, given a quadriculated disk obtains a disjoint union of quadriculated disks of smaller total area. We provide two examples of the use of this procedure as a recursive step. Tilings of a disk Delta receive a parity: we construct a perfect or near-perfect matching of tilings of opposite parities. Let BDelta be the black-to-white adjacency matrix: we factor BDelta=LildeDU, where L and U are lower and upper triangular matrices, ildeD is obtained from a larger identity matrix by removing rows and columns and all entries of L, ildeD and U are equal to 0, 1 or -1.


Full work available at URL: https://arxiv.org/abs/0904.4814




Recommendations




Cites Work


Cited In (1)





This page was built for publication: Cut-and-paste of quadriculated disks and arithmetic properties of the adjacency matrix

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