Cut-and-paste of quadriculated disks and arithmetic properties of the adjacency matrix
From MaRDI portal
(Redirected from Publication:962133)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorial aspects of tessellation and tiling problems (05B45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Special matrices (15B99)
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 receive a parity: we construct a perfect or near-perfect matching of tilings of opposite parities. Let be the black-to-white adjacency matrix: we factor , where and are lower and upper triangular matrices, is obtained from a larger identity matrix by removing rows and columns and all entries of , and are equal to 0, 1 or -1.
Recommendations
Cites work
- scientific article; zbMATH DE number 49719 (Why is no real title available?)
- Alternating-sign matrices and domino tilings. I
- Combinatorial approaches and conjectures for 2-divisibility problems concerning domino tilings of polyominoes
- Conway's Tiling Groups
- On the determinant of the adjacency matrix for a planar sublattice
- Spaces of domino tilings
- Tilings of quadriculated annuli
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)