Brendan McKay

For the baseball player, see Brendan McKay (baseball).

Brendan Damien McKay (born 26 October 1951 in Melbourne, Australia) is a Professor in the Research School of Computer Science at the Australian National University (ANU). He has published extensively in combinatorics.

McKay received a Ph.D. in mathematics from the University of Melbourne in 1980. His thesis, Topics in Computational Graph Theory, was written under the direction of Derek Holton.[1]

One of McKay's main contributions has been a practical algorithm for the graph isomorphism problem and its software implementation NAUTY (No AUTomorphisms, Yes?). Further achievements include proving with Stanisław Radziszowski that the Ramsey number R(4,5) = 25, proving with Radziszowski that no 4-(12, 6, 6) combinatorial designs exist, determining with Gunnar Brinkmann the number of posets on 16 points, and determining with Ian M. Wanless the number of Latin squares of size 11.

Outside of this specialty, McKay is best known for his collaborative work with a group of Israeli mathematicians that criticizes the Bible code hypothesis by arguing that the patterns in the Bible that supposedly indicate some hidden message from a divine source or have predictive power can be just as easily found in other works, such as War and Peace. Their work is used to challenge Michael Drosnin's arguments about a special Biblical code.[2][3]

He gave an invited talk at the International Congress of Mathematicians in 2010, on the topic of "Combinatorics".[4]

References

  1. ↑ Brendan McKay at the Mathematics Genealogy Project
  2. ↑ Begley, Sharon (8 June 1997). "Seek And Ye Shall Find". The Daily Beast. Retrieved 28 February 2012.
  3. ↑ "Botschaften des Allmächtigen oder zurechtgeschusterte Daten?". Neue Zürcher Zeitung. 18 August 2004. Retrieved 28 February 2012.
  4. ↑ "ICM Plenary and Invited Speakers since 1897". International Congress of Mathematicians.

External links

This article is issued from Wikipedia - version of the Sunday, November 01, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.