There are various combinatorial questions on rectangular arrays consisting of points, numbers, fields or, in general, of symbols such as chessboards, lattices, and graphs. Many such problems in enumerative combinatorics come from other branches of science and technology like physics, chemistry, computer sciences and engineering; for example the following two very challenging problems from chemistry:Problem 1: Dimer problem (Domino tiling)In chemistry, a large molecule composed repeatedly from monomers as a long chain is called a polymer and a dimer is composed of two monomers (where: mono = 1, di = 2, poly = many and mer = part).