Jamming coverage of blocks on a cubic lattice

In this paper the discrete block jamming model on a cubic lattice is investigated by means of mathematical and computer simulation. A block (-mer) with side length represents occupied nodes on the lattice. The start coordinates of the blocks are randomly generated uniformly distributed integers. The blocks do not overlap with each other. Periodic boundary conditions are used in the modelling. A blocks maximum packing algorithm is developed and a computer program is written to implement the mathematical model. A method for estimating of critical values by maximum lattice fill is proposed. The values of the jamming thresholds for many in the range from 2 to 80 were determined. Several estimates of the jamming threshold at are obtained. The results of the paper suggest that the jamming threshold does not depend on the linear size of the lattice.