arXiv Analytics

Sign in

arXiv:1409.2745 [math.CO]AbstractReferencesReviewsResources

Signed polyomino tilings by n-in-line polyominoes and Groebner bases

Manuela Muzika Dizdarević, Marinko Timotijević, Rade T. Živaljević

Published 2014-09-09Version 1

Conway and Lagarias observed that a triangular region T(m) in a hexagonal lattice admits signed tiling by three-in-line polyominoes (tribones) if and only if m=9d-1 or m=9d for some integer d. We apply the theory of Groebner bases over integers to show that T(m) admits a signed tiling by n-in-line polyominoes (n-bones) if and only if m=dn^2-1 or m=dn^2 for some integer d. Explicit description of the Groebner basis allows us to calculate the "Groebner discrete volume" of a lattice region by applying the division algorithm to its `Newton polynomial'. Among immediate consequences is a description of the tile homology group of the $n$-in-line polyomino.

Related articles: Most relevant | Search more
arXiv:math/0509164 [math.CO] (Published 2005-09-08)
Groebner bases and combinatorics for binary codes
arXiv:1407.2015 [math.CO] (Published 2014-07-08)
Symmetric polyomino tilings, tribones, ideals, and Groebner bases
arXiv:1907.01217 [math.CO] (Published 2019-07-02)
Characterization of Gaps and Elements of a Numerical Semigroup Using Groebner Bases