6533b82cfe1ef96bd128eb6e

RESEARCH PRODUCT

Polyomino coloring and complex numbers

Jurijs Kirillovs

subject

Gaussian integersDiscrete mathematicsGeneral Computer SciencePolyominoGaussian integerPolyomino tilingLattice (group)Tileability criteriaType (model theory)Prime (order theory)Theoretical Computer ScienceCombinatoricssymbols.namesakeIntegersymbolsColoringFunction compositionAbelian groupComputer Science(all)Mathematics

description

AbstractUsually polyominoes are represented as subsets of the lattice Z2. In this paper we study a representation of polyominoes by Gaussian integers. Polyomino {(x1,y1),(x2,y2),…,(xs,ys)}⊂Z2 is represented by the set {(x1+iy1),(x2+iy2),…,(xs+iys)}⊂Z[i]. Then we consider functions of type f:P→G from the set P of all polyominoes to an abelian group G, given by f(x,y)≡(x+iy)m(modv), where v is prime in Z[i],1≤m<N(v) (N(v) is the norm of v). Using the arithmetic of the ring Z[i] we find necessary and sufficient conditions for such a function to be a coloring map.

https://doi.org/10.1016/j.tcs.2008.02.033