基本信息
浏览量:45
职业迁徙
个人简介
Prof Wanless has published over 100 papers across a wide range of discrete mathematical disciplines including graph theory, design theory, combinatorics, enumeration and algebra. He is a recognised authority on matrix permanents and Latin squares, having been invited to write chapters in CRC handbooks on both topics. He loves everything to do with the combinatorics of permutations including Latin hypercubes, permutation arrays, permutation polynomials and orthomorphisms.
He has worked on a wide range of combinatorial designs including Steiner triple systems, Hadamard matrices, orthogonal arrays, frequency squares and Heffter arrays. In graph theory he was worked on matchings, coverings, factorisations, graph polynomials and random graphs. His favourite problem in graph theory is the challenge of maximising the number of matchings in regular bipartite graphs. In algebra he has worked on combinatorial properties of Cayley tables, loops and quasigroups, cyclotomic properties of finite fields, Cayley graphs. He has worked on enumerations of many kind, both computational and asymptotic. He also has an interest in number theoretic properties of combinatorial numbers. One of his favourite results is that, mod n, the number of reduced Latin squares of order n is an indicator function for primality of n.
He has worked on a wide range of combinatorial designs including Steiner triple systems, Hadamard matrices, orthogonal arrays, frequency squares and Heffter arrays. In graph theory he was worked on matchings, coverings, factorisations, graph polynomials and random graphs. His favourite problem in graph theory is the challenge of maximising the number of matchings in regular bipartite graphs. In algebra he has worked on combinatorial properties of Cayley tables, loops and quasigroups, cyclotomic properties of finite fields, Cayley graphs. He has worked on enumerations of many kind, both computational and asymptotic. He also has an interest in number theoretic properties of combinatorial numbers. One of his favourite results is that, mod n, the number of reduced Latin squares of order n is an indicator function for primality of n.
研究兴趣
论文共 140 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
arxiv(2024)
引用0浏览0引用
0
0
PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETYno. 1 (2024)
SCIPOST PHYSICSno. 1 (2024): 010
引用0浏览0引用
0
0
arXiv (Cornell University) (2023)
引用0浏览0引用
0
0
PROCEEDINGS OF THE EDINBURGH MATHEMATICAL SOCIETY (2023)
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn