The research interests of the group include the development and implementation of symbolic and algebraic algorithm for computer algebra problems,
graph theory and number theory. In the search for efficient procedures for the involved problems, new techniques and mathematical properties of the
objects are obtained. Sample problems studied by the group are polynomial factorization, graph theory, primality, Chebyshev polynomials and spectral
- The design and implementation of polynomial factorization algorithm.
- The study of algebraic properties of polynomials: decomposition, resultants, aplications to number theory.
- Graph algorithms; characteristic polynomials for trees, eigenvalues localization.
- Spectral graph theory: studies on energy of graphs, characterization of eigenvalues and algebraic connectivity.