This work addresses two problems related to packing identical regular polyhedra, focusing on triangles and squares. The first problem seeks to maximize the number of identical regular polyhedra that can be packed within a convex set or container.The second problem focuses on achieving the densest possible packing of a fixed number of identical regular polyhedra within a container of a given type. Both problems are modeled as nonlinear differentiable programming problems.
1 January 2024 in Revista Professor de Matemática On line
In this paper, sufficient conditions for the existence and construction of nonnegative matrices with prescribed elementary divisors for a list of complex numbers with nonnegative real part are obtained, and the corresponding nonnegative matrices are constructed. In addition, results of how to perturb complex eigenvalues of a nonnegative matrix while keeping its elementary divisors and its nonnegativity are derived.