Brendan McKay

From Wikipedia, the free encyclopedia
Jump to: navigation, search
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, and was appointed Assistant Professor of Computer Science at Vanderbilt University, Nashville in the same year (1980-1983.[1] His thesis, Topics in Computational Graph Theory, was written under the direction of Derek Holton.[2] He was awarded the Australian Mathematical Society Medal in 1990.[1] He was elected a Fellow of the Australian Academy of Science in 1997,[1] and appointed Professor of Computer Science at the ANU in 2000.[3]

Mathematics[edit]

McKay is the author of at least 127 refereed articles.[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; He also proved 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. Together with Brinkmann, he also developed the Plantri programme for generating planar triangulations and planar cubic graphs.[4]

Biblical Cyphers[edit]

Outside of this specialty, McKay is best known for his collaborative work with a group of Israeli mathematicians such as Dror Bar-Natan and Gil Kalai, together with Maya Bar-Hillel, who rebutted a Bible code theory which maintained that the Hebrew text of the Bible enciphered predictive details of future historical events. The paper in question had been accepted for publication in a scientific peer-reviewed journal in 1994.[5][6] .[7] Their rebuttal, together with a paper written by an anonymous mathematician, argued 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.[8] The discredited theory was taken up by Michael Drosnin.[9][10]Drosnin was convinced of this theory when one of its exponents stated that the Torah predicted the Iraqi wars. He expressed his certainly publicly that such coded messages could not be found in any other work than the Bible, and, in an interview with Newsweek, threw down the gauntlet:

When my critics find a message about the assassination of a prime minister encrypted in Moby Dick, I'll believe them.'

McKay quickly found, using the Bible decryption method espoused by the group led by Eliyahu Rips, some 9 references to Yitzhak Rabin's assassination in Herman Melville's masterpiece. He also showed that the same technique allowed him to find ostensible mentions of Diana, Princess of Wales, her lover Dodi Fayed, and their chauffeur Henri Paul in the same novel.[11]

This debunking disproof of a theory that the bible encrypts secret messages containing future world history secured for McKay world-wide fame outside of his specific field of combinatorics.[12]

Further[edit]

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

References[edit]

External links[edit]