Hector Flores Callisaya
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Hector Flores Callisaya has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Hans Nina
Departamento de Matemáticas, Facultad de Ciencias Básicas, Universidad de Antofagasta, Antofagasta 1240000, Chile
3 shared publications - Harold Blas
Universidade Federal de Mato Grosso
2 shared publications - Hubert Pickmann-Soto
Departamento de Matemática, Universidad de Tarapacá, Arica 1000000, Chile
2 shared publications - Elvis R. Valero Kari
Department of Mathematics, Universidad de Tarapac, Arica-Chile
1 shared publication - Ernesto G. Birgin
Department of Computer Science, Institute of Mathematics and Statistics, University of São Paulo, São Paulo, Brazil
1 shared publication - Geisiane Vettorazzi1 shared publication
Latest Publications
- Open Access
- 23 February 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (4) , 743
Inverse Extremal Eigenvalue Problems for Multi-Arrowhead Pentadiagonal Matrices
We address the inverse extremal eigenvalue problem (IEEP) for multi-arrowhead pentadiagonal matrices, a structured class that combines pentadiagonal bandwidth with an alternating arrowhead structure. We identify four distinct structural classes based on the orientation and configuration of arrowhead blocks. For symmetric matrices, we establish sufficient conditions for reconstruction from extremal (smallest, largest, or both) eigenvalues of leading principal submatrices. For certain classes, we prove these conditions are also necessary, providing a complete characterization. Nonsymmetric matrices require one additional prescribed eigenvector. Our results are constructive and yield algorithmic procedures. Numerical examples illustrate our theoretical findings. This work generalizes inverse extremal eigenvalue theory for arrowhead matrices to these pentadiagonal structures.
- 23 February 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (4) , 743
Open AccessInverse Extremal Eigenvalue Problems for Multi-Arrowhead Pentadiagonal Matrices
We address the inverse extremal eigenvalue problem (IEEP) for multi-arrowhead pentadiagonal matrices, a structured class that combines pentadiagonal bandwidth with an alternating arrowhead structure. We identify four distinct structural classes based on the orientation and configuration of arrowhead blocks. For symmetric matrices, we establish sufficient conditions for reconstruction from extremal (smallest, largest, or both) eigenvalues of leading principal submatrices. For certain classes, we prove these conditions are also necessary, providing a complete characterization. Nonsymmetric matrices require one additional prescribed eigenvector. Our results are constructive and yield algorithmic procedures. Numerical examples illustrate our theoretical findings. This work generalizes inverse extremal eigenvalue theory for arrowhead matrices to these pentadiagonal structures.
- 1 January 2026
- Published by Sociedade Brasileira de Matematica in Revista Professor de Matemática On line
- Vol. 14 (39)
Aplicação da teoria clássica dos testes no diagnóstico de itens e desempenho de estudantes
- 1 January 2026
- Published by Sociedade Brasileira de Matematica in Revista Professor de Matemática On line
- Vol. 14 (39)
Aplicação da teoria clássica dos testes no diagnóstico de itens e desempenho de estudantes
- Open Access
- 4 February 2025
- Published by Brazilian Society for Computational and Applied Mathematics (SBMAC) in Trends in Computational and Applied Mathematics
- Vol. 26 (1)
Packing Polyhedra within Convex Sets
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.
- 4 February 2025
- Published by Brazilian Society for Computational and Applied Mathematics (SBMAC) in Trends in Computational and Applied Mathematics
- Vol. 26 (1)
Open AccessPacking Polyhedra within Convex Sets
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
- Published by Sociedade Brasileira de Matematica in Revista Professor de Matemática On line
- Vol. 12 (40)
Empacotamento de retângulos em polígonos
- 1 January 2024
- Published by Sociedade Brasileira de Matematica in Revista Professor de Matemática On line
- Vol. 12 (40)
Empacotamento de retângulos em polígonos
- Open Access
- 27 September 2020
- Published by MDPI AG in Mathematics
- Vol. 8 (10) , 1662
Nonnegative Inverse Elementary Divisors Problem for Lists with Nonnegative Real Parts
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.
- 27 September 2020
- Published by MDPI AG in Mathematics
- Vol. 8 (10) , 1662
Open AccessNonnegative Inverse Elementary Divisors Problem for Lists with Nonnegative Real Parts
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.
- Open Access
- 1 January 2020
- Published by Elsevier in Nuclear Physics B
- Vol. 950
Riccati-type pseudo-potentials, conservation laws and solitons of deformed sine-Gordon models
- 1 January 2020
- Published by Elsevier in Nuclear Physics B
- Vol. 950
Open AccessRiccati-type pseudo-potentials, conservation laws and solitons of deformed sine-Gordon models
- 1 February 2018
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 55, 105-126
Quasi-integrability in deformed sine-Gordon models and infinite towers of conserved charges
- 1 February 2018
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 55, 105-126
Quasi-integrability in deformed sine-Gordon models and infinite towers of conserved charges
- 7 February 2013
- Published by Wiley in International Transactions in Operational Research
- Vol. 20 (3) , 365-389
Packing circles within ellipses
The problem of packing circles within ellipses is considered in the present paper. A new ellipse‐based system of coordinates is introduced by means of which a closed formula to compute the distance of an arbitrary point to the boundary of an ellipse exists. Nonlinear programming models for some variants of 2D and 3D packing problems involving circular items and elliptical objects are given. The resulting models are medium‐sized highly challenging nonlinear programming problems for which a global solution is sought. For this purpose, multistart strategies are carefully and thoroughly explored. Numerical experiments are exhibited.
- 7 February 2013
- Published by Wiley in International Transactions in Operational Research
- Vol. 20 (3) , 365-389
Packing circles within ellipses
The problem of packing circles within ellipses is considered in the present paper. A new ellipse‐based system of coordinates is introduced by means of which a closed formula to compute the distance of an arbitrary point to the boundary of an ellipse exists. Nonlinear programming models for some variants of 2D and 3D packing problems involving circular items and elliptical objects are given. The resulting models are medium‐sized highly challenging nonlinear programming problems for which a global solution is sought. For this purpose, multistart strategies are carefully and thoroughly explored. Numerical experiments are exhibited.