Our research group focuses on arithmetic and discrete structures, combining techniques from number theory, algebra, and combinatorics. A central research area is the study of Diophantine equations, with emphasis on the existence and distribution of integer and rational solutions. The group also investigates Lucas sequences and their generalizations, analyzing divisibility properties, primitive divisors, and their connections to exponential Diophantine problems and recurrence phenomena.
In combinatorics, the group is active in Spectral Graph Theory, examining how eigenvalues of graphs encode structural and combinatorial properties with applications to networks and coding theory. Another key direction is the study of the Discrete Logarithm Problem on algebraic surfaces, linking arithmetic geometry with cryptographic complexity. Collectively, the group’s work integrates arithmetic, combinatorial, and geometric methods to address both foundational questions and contemporary challenges in computational number theory.
Department Members in This Field
Faculty
- Dr Benedict Vasco Normenyo Diophantine Equations, Lucas Sequences and their Generalizations
- Dr Kenneth Dadedzi Spectral Graph Theory
- Dr Ralph Agyei Twum Discrete Logarithm, Algebraic Surfaces
Graduate Students
- Ephraim Nii Amon Poncho-Kotey (Ph.D. Candidate -- Current), The Discrete Logarithm Problem on Algebraic Surfaces
Publications
- TBA