Eber Javier Lenes Puello

Prof. Dr. Eber Javier Lenes Puello


Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 October 2021 in Symmetry
Verified
Journal Article
Open access
PDF file
EBEvgenii S. Baranovskii
Evgenii S. Baranovskii
EPEber Javier Lenes Puello
Eber Javier Lenes Puello
EMExequiel Mallea-Zepeda
Exequiel Mallea-Zepeda
JRJonnathan Rodriguez
Jonnathan Rodriguez
LVLautaro Vásquez
Lautaro Vásquez
We study an optimal control problem for the stationary Stokes equations with variable density and viscosity in a 2D bounded domain under mixed boundary conditions. On in-flow and out-flow parts of the boundary, nonhomogeneous Dirichlet boundary conditions are used, while on the solid walls of the flow domain, the impermeability condition and the Navier slip condition are provided. We control the system by the external forces (distributed control) as well as the velocity boundary control acting on a fixed part of the boundary. We prove the existence of weak solutions of the state equations, by firstly expressing the fluid density in terms of the stream function (Frolov formulation). Then, we analyze the control problem and prove the existence of global optimal solutions. Using a Lagrange multipliers theorem in Banach spaces, we derive an optimality system. We also establish a second-order sufficient optimality condition and show that the marginal function of this control system is lower semi-continuous.

1 December 2015 in Proyecciones (Antofagasta)
Verified
Journal Article
Open access
PDF file
NANair Abreu
Nair Abreu
EPEber Javier Lenes Puello
Eber Javier Lenes Puello
OROscar Rojo
Oscar Rojo
A bug Bugp,r1r2 is a graph obtained from a complete graph Kp by deleting an edge uv and attaching the paths Priand Pr2 by one of their end vertices at u and v, respectively. Let Q(G) be the signless Laplacian matrix of a graph G and q1(G) be the spectral radius of Q(G). It is known that the bug maximizes q1(G) among all graphs G of order n and diameter d. For a bug B of order n and diameter d, n - d is an eigenvalue of Q(B) with multiplicity n - d - 1. In this paper, we prove that remainder d +1 eigenvalues of Q(B), among them q1(B), can be computed as the eigenvalues of a symmetric tridiagonal matrix of order d +1. Finally, we show that q1(B0) can be computed as the largest eigenvalue of a symmetric tridiagonal matrix of order whenever d is even.

28 September 2020 in Mathematics
Verified
Journal Article
Open access
PDF file
EPEber Javier Lenes Puello
Eber Javier Lenes Puello
EMExequiel Mallea-Zepeda
Exequiel Mallea-Zepeda
JRJonnathan Rodriguez
Jonnathan Rodriguez
Let G be a graph, for any real 0≤α≤1, Nikiforov defines the matrix Aα(G) as Aα(G)=αD(G)+(1−α)A(G), where A(G) and D(G) are the adjacency matrix and diagonal matrix of degrees of the vertices of G. This paper presents some extremal results about the spectral radius ρα(G) of the matrix Aα(G). In particular, we give a lower bound on the spectral radius ρα(G) in terms of order and independence number. In addition, we obtain an upper bound for the spectral radius ρα(G) in terms of order and minimal degree. Furthermore, for n>l>0 and 1≤p≤⌊n−l2⌋, let Gp≅Kl∨(Kp∪Kn−p−l) be the graph obtained from the graphs Kl and Kp∪Kn−p−l and edges connecting each vertex of Kl with every vertex of Kp∪Kn−p−l. We prove that ρα(Gp+1)<ρα(Gp) for 1≤p≤⌊n−l2⌋−1.

26 May 2025 in Mathematics
Verified
Journal Article
Open access
PDF file
EPEber Javier Lenes Puello
Eber Javier Lenes Puello
LMLuis Medina
Luis Medina
MRMaría Robbiano
María Robbiano
JRJonnathan Rodriguez
Jonnathan Rodriguez
Let G be a graph with n vertices, and let dG(u) denote the degree of vertex u in G. The maximum degree matrix MG of G is the square matrix of order n whose (u,v)-entry is equal to maxdG(u),dG(v) if vertices u and v are adjacent in G, and zero otherwise. Let Bp,q,r be the graph obtained from the complete graph Kp by removing an edge uv, and identifying vertices u and v with the end vertices u′ and v′ of the paths Pq and Pr, respectively. Let Gn,d denote the set of simple, connected graphs with n vertices and diameter d. A graph in Gn,d that attains the largest spectral radius of the maximum degree matrix is called a maximizing graph. In this paper, we first characterize the spectrum of the maximum degree matrix for graphs of the form Bn−i+2,i,d−i, where 1≤i≤⌊d2⌋. Furthermore, for d≥2, we prove that the maximizing graph in Gn,d is Bn−d+2,⌊d2⌋,⌈d2⌉. Finally, if d≥4 is an even integer, then the spectral radius of the maximum degree matrix in Bn−d+2,⌊d2⌋,⌈d2⌉ can be computed as the largest eigenvalue of a symmetric tridiagonal matrix of order d2+1.

14 August 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
EPEber Javier Lenes Puello
Eber Javier Lenes Puello
EMExequiel Mallea-Zepeda
Exequiel Mallea-Zepeda
LMLuis Medina
Luis Medina
JRJonnathan Rodriguez
Jonnathan Rodriguez
Let G be a simple undirected graph on n vertices. V. Nikiforov studied hybrids of AG and DG and defined the matrix AαG for every real α∈[0,1] as AαG=αDG+(1−α)AG. In this paper, we define the generalized Randić matrix for graph G, and we introduce and establish bounds for the Estrada index of this new matrix. Furthermore, we find the smallest value of α for which the generalized Randić matrix is positive semidefinite. Finally, we present the solution to the problem proposed by V. Nikiforov. The problem consists of the following: for a given simple undirected graph G, determine the smallest value of α for which AαG is positive semidefinite.

28 October 2024 in Computational and Applied Mathematics
Verified
Journal Article
Closed access
PDF file
EAEnide Andrade
Enide Andrade
EPEber Javier Lenes Puello
Eber Javier Lenes Puello
CMCatalina Monroy
Catalina Monroy
MRMaría Robbiano
María Robbiano