Configurations of the trees of Dirichlet polyominoes (Q4379569)

In our earlier publication on the method of discrete modeling of molecule packings we showed that it is possible to construct Dirichlet polyominoes by dividing the packing space with the aid of the graph tree with \(n\) vertices (in accordance with the number of polyomino cells). It is obvious that this representation can also be used in the general form for constructing polyominoes of arbitrary shapes including those not dividing the space periodically. Among the latter, we can expect the existence of prototypes of monohedral mosaics still never observed in practice that would provide aperiodic division of a plane and can be used for discrete modeling of ``quasicrystals'' and also molecules---polyominoes that cannot tile any plane without forming voids (an analog of monomolecular structures not forming crystalline states). The classification of polyominoes into those dividing the space only periodically, those dividing it periodically and nonperiodically, those dividing it only aperiodically, and those not dividing the space at all can be made only if one possesses the exhaustive information on the shape of Dirichlet \(n\)-minoes whose structure is based on the configurations of trees. We consider the calculation of the configurations and derive the formula for their calculation depending on the number of polyomino cells.