Given a fixed set of identical or different-sized circular items, the problem we deal with consists on finding the smallest object within which the items can be packed. Circular, triangular, squared, rectangular and also ...

The aim of this work is to propose an algorithm to simulate the packed bed structure of mono-sized spheres in cylindrical containers. The approach employed is called soft spheres algorithm, because it allows some degree ...

Let m and n be integers greater than 1. Given lattices A and B of dimensions m and n, respectively, a technique for constructing a lattice from them of dimension m+n-1 is introduced. Furthermore, if A and B possess bases ...

Let m and n be integers greater than 1. Given lattices A and B of dimensions m and n, respectively, a technique for constructing a lattice from them of dimension m+n-1 is introduced. Furthermore, if A and B possess bases ...

A new constructive family of asymptotically good lattices with respect to sphere packing density is presented. The family has a lattice in every dimension n >= 1. Each lattice is obtained from a conveniently chosen integral ...

Four-dimensional lattices with block circulant generator matrices are constructed from submodules of the ring of integers of the totally real number field ℚ(√2,√5). The obtained lattices are of full diversity and their ...