Daniel Hawtin

Dr. Daniel Hawtin is a Professor at the Faculty of Mathematics, University of Rijeka. His research focuses on algebraic combinatorics, graph theory, and coding theory with emphasis on group actions, symmetry properties of graphs, and combinatorial designs. He leads the UNIRI YOUNG SCIENTISTS PROJECT titled 'Neighbour-transitive codes in graphs' (2022), and previously contributed to 'Codes, groups and combinatorial structures' (2018). His work spans theoretical aspects of coding theory, distance-regular graphs, and algebraic approaches to combinatorial problems.

Research Interests:

• Algebraic symmetry in codes and graphs
• 2-arc-transitive graphs and Cayley graphs
• Combinatorial designs (q-Steiner systems, subspace designs)
• Error-correcting codes with transitive automorphism groups
• Finite geometry applications in coding theory

Publications Trends: Recent work emphasizes neighbour-transitive codes in Kneser graphs (2024), edge-affine graph constructions (2024), and non-existence proofs in combinatorial designs (2022). His research bridges abstract algebra with combinatorial structures, often using group theory to analyze graph symmetries and code properties.

Grants & Projects: Principal Investigator for UNIRI Young Scientists Project (2022) and collaborator in multiple combinatorial research initiatives. Active in international collaborations with experts like Cheryl Praeger and Jin-Xin Zhou.