Stephen Glasby

Stephen Glasby is an Honorary Research Fellow at the University of Western Australia (UWA), affiliated with the School of Physics, Mathematics and Computing. His research focuses on algorithms for groups and algebras, group theory, and combinatorics. He has contributed to areas such as linear groups, matrix theory, and finite geometries, with a focus on structural properties and computational methods.

His work includes studies on automorphism groups, irreducible linear groups, and combinatorial structures like generalized polygons and bipartite graphs. Recent articles highlight his exploration of derangements in permutation groups, probabilistic analysis of subspaces, and optimization of binomial coefficients using continued fractions. Glasby has also investigated functional equations in group theory and random generation techniques in finite geometries.

Collaborations span international researchers, and his research has been supported by grants such as the ARC-funded project on finite linearly representable geometries. Despite no listed awards, his extensive publication record (over 45 peer-reviewed articles) and contributions to computational algebra tools (e.g., Magma programs) underscore his scholarly impact. Advising and grant activities include co-investigator roles in projects exploring symmetry and geometry.

His work frequently intersects algebra, combinatorics, and probability, with applications in coding theory and cryptography. Ongoing research trends include the study of minimal distance in linear codes and the classification of finite groups with specific automorphism properties.