Brendan McKay (mathematician)

Last updated
Brendan McKay Professor Brendan McKay.jpg
Brendan McKay

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

Contents

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

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?). [4] 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 Wanless the number of Latin squares of size 11. [5] Together with Brinkmann, he also developed the Plantri programme for generating planar triangulations and planar cubic graphs. [6]

The McKay–Miller–Širáň graphs, a class of highly-symmetric graphs with diameter two and many vertices relative to their degree, are named in part for McKay, who first wrote about them with Mirka Miller and Jozef Širáň in 1998. [7]

Biblical cyphers

Outside of his 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 by a scientific peer-reviewed journal in 1994. [8] [9] [10] 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 . [11] The discredited theory was taken up by US journalist Michael Drosnin. [12] [13] Drosnin said he was convinced of this theory when one of its exponents stated that the Torah predicted the Iraqi wars. He expressed his certainty publicly that such coded messages could not be found in any other work than the Bible, and, in an interview with Newsweek, he challenged: "When my critics find a message about the assassination of a prime minister encrypted in Moby Dick, I'll believe them." [12]

Using the Bible decryption method espoused by the group led by Eliyahu Rips, McKay quickly found some nine 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. [14]

This debunking disproof of a theory that the bible encrypts secret messages containing future world history achieved international fame for McKay outside of his specific field of combinatorics. [15] [16] [17]

Azzam Pasha quotation

McKay was involved in the uncovering of the original source of the Azzam Pasha quotation. The original source, an 11 October 1947 article in the Egyptian newspaper Akhbar al-Yom, was first referenced in an article by David Barnett and Efraim Karsh in the Fall 2011 issue of Middle East Quarterly without reference to McKay. [18] Tom Segev responded in an op-ed in Haaretz that McKay had in fact been the original source of the material and had uploaded it to Wikipedia. [19] McKay had notified the Wikipedia talk page of having found the original interview from which the quote was taken and later provided it to Barnett. According to Karsh, McKay was offered a co-author credit in the Middle East Quarterly article but he declined on the grounds of having a low opinion of the publication. [20]

Further

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

Related Research Articles

The Bible Code is a book by Michael Drosnin, first published by Simon & Schuster in 1997. A sequel, Bible Code II: The Countdown, was published by Penguin Random House in 2002, and also reached New York Times Best-Seller status. In 2010, Bible Code III: Saving the World was published by Worldmedia, Inc., completing a trilogy.

In combinatorics, Ramsey's theorem, in one of its graph-theoretic forms, states that one will find monochromatic cliques in any edge labelling of a sufficiently large complete graph. To demonstrate the theorem for two colours, let r and s be any two positive integers. Ramsey's theorem states that there exists a least positive integer R(r, s) for which every blue-red edge colouring of the complete graph on R(r, s) vertices contains a blue clique on r vertices or a red clique on s vertices.

The Bible code, also known as the Torah code, is a purported set of encoded words within a Hebrew text of the Torah that, according to proponents, has predicted significant historical events. The statistical likelihood of the Bible code arising by chance has been thoroughly researched, and it is now widely considered to be statistically insignificant, as similar phenomena can be observed in any sufficiently lengthy text. Although Bible codes have been postulated and studied for centuries, the subject has been popularized in modern times by Michael Drosnin's book The Bible Code and the movie The Omega Code.

<span class="mw-page-title-main">Eliyahu Rips</span> Israeli mathematician of Latvian origin (born 1948)

Eliyahu Rips is an Israeli mathematician of Latvian origin known for his research in geometric group theory. He became known to the general public following his co-authoring a paper on what is popularly known as Bible code, the supposed coded messaging in the Hebrew text of the Torah.

<span class="mw-page-title-main">Snark (graph theory)</span> 3-regular graph with no 3-edge-coloring

In the mathematical field of graph theory, a snark is an undirected graph with exactly three edges per vertex whose edges cannot be colored with only three colors. In order to avoid trivial cases, snarks are often restricted to have additional requirements on their connectivity and on the length of their cycles. Infinitely many snarks exist.

<span class="mw-page-title-main">Wheel graph</span> Cycle graph plus universal vertex

In the mathematical discipline of graph theory, a wheel graph is a graph formed by connecting a single universal vertex to all vertices of a cycle. A wheel graph with n vertices can also be defined as the 1-skeleton of an (n – 1)-gonal pyramid. Some authors write Wn to denote a wheel graph with n vertices ; other authors instead use Wn to denote a wheel graph with n + 1 vertices, which is formed by connecting a single vertex to all vertices of a cycle of length n. The rest of this article uses the former notation.

Stanisław P. Radziszowski is a Polish-American mathematician and computer scientist, best known for his work in Ramsey theory.

Michael Alan Drosnin (January 31, 1946 – June 9, 2020) was an American journalist and author, best known for his writings on the Bible Code, which is a purported set of secret messages encoded within the Hebrew text of the Torah.

Carsten Thomassen is a Danish mathematician. He has been a Professor of Mathematics at the Technical University of Denmark since 1981, and since 1990 a member of the Royal Danish Academy of Sciences and Letters. His research concerns discrete mathematics and more specifically graph theory.

<span class="mw-page-title-main">Dror Bar-Natan</span>

Dror Bar-Natan is a Professor at the University of Toronto Department of Mathematics, Canada. His main research interests include knot theory, finite type invariants, and Khovanov homology.

<span class="mw-page-title-main">Gil Kalai</span> Israeli mathematician and computer scientist

Gil Kalai is the Henry and Manya Noskwith Professor Emeritus of Mathematics at the Hebrew University of Jerusalem, Israel, Professor of Computer Science at the Interdisciplinary Center, Herzliya, and adjunct Professor of mathematics and of computer science at Yale University, United States.

In graph theory, the degree diameter problem is the problem of finding the largest possible graph for a given maximum degree and diameter. The Moore bound sets limits on this, but for many years mathematicians in the field have been interested in a more precise answer. The table below gives current progress on this problem.

<span class="mw-page-title-main">János Pach</span> Hungarian mathematician

János Pach is a mathematician and computer scientist working in the fields of combinatorics and discrete and computational geometry.

Dominique de Caen was a mathematician, Doctor of Mathematics, and professor of Mathematics, who specialized in graph theory, probability, and information theory. He is renowned for his research on Turán's extremal problem for hypergraphs.

Nicholas Charles Wormald is an Australian mathematician and professor of mathematics at Monash University. He specializes in probabilistic combinatorics, graph theory, graph algorithms, Steiner trees, web graphs, mine optimization, and other areas in combinatorics.

<span class="mw-page-title-main">Ian Wanless</span> Australian mathematician

Ian Murray Wanless is a professor in the School of Mathematics at Monash University in Melbourne, Australia. His research area is combinatorics, principally Latin squares, graph theory and matrix permanents.

<span class="mw-page-title-main">Combinatorial Mathematics Society of Australasia</span>

The Combinatorial Mathematics Society of Australasia (CMSA) is a professional society of mathematicians working in the field of combinatorics. It is the primary combinatorics society for Australasia, consisting of Australia, New Zealand and neighbouring countries. The CMSA existed as an informal group from 1972 until formal establishment in 1978. It became an incorporated association in 1996, and as of 2017, it has over 280 members including 110 life members.

Jeanette Claire McLeod is a New Zealand mathematician specialising in combinatorics, including the theories of Latin squares and random graphs. She is a senior lecturer in the School of Mathematics and Statistics at the University of Canterbury, a principal investigator for Te Pūnaha Matatini, a Centre of Research Excellence associated with the University of Auckland, an honorary senior lecturer at the Australian National University, and the president for three terms from 2018 to 2020 of the Combinatorial Mathematics Society of Australasia.

Mirka Miller was a Czech-Australian mathematician and computer scientist interested in graph theory and data security. She was a professor of electrical engineering and computer science at the University of Newcastle.

In graph theory, the McKay–Miller–Širáň graphs are an infinite class of vertex-transitive graphs with diameter two, and with a large number of vertices relative to their diameter and degree. They are named after Brendan McKay, Mirka Miller, and Jozef Širáň, who first constructed them using voltage graphs in 1998.

References

  1. 1 2 3 4 'Biography,'
  2. ↑ Brendan McKay at the Mathematics Genealogy Project
  3. ↑ 'McKay, Brendan Damien (1951– ),' in Encyclopedia of Australian Science.
  4. ↑ Pontifex Praeteritorum, Reading List: Graph Isomorphism The Quantum Pontiff (blog) 4 August 2010
  5. ↑ Brendan D. McKay, Ian M. Wanless, 'On the number of Latin squares,' Annaals of Combinatorics 9 (2009) pp. 335–344.
  6. ↑ Siemion Fajtlowicz (ed.), Graphs and Discovery: DIMACS Working Group, Computer-generated Conjectures from Graph Theoretical and Chemical Databases, American Mathematical Soc., 2005 p.x.
  7. ↑ McKay, Brendan D.; Miller, Mirka; Širáň, Jozef (1998), "A note on large graphs of diameter two and given maximum degree", Journal of Combinatorial Theory , Series B, 74 (1): 110–118, doi: 10.1006/jctb.1998.1828 , MR   1644043
  8. ↑ Doron Witztum, Eliyahu Rips, and Yoav Rosenberg, 'Equidistant Letter Sequences in the Book of Genesis,' Statistical Science, Vol. 9 (1994) 429–438.
  9. ↑ Brendan McKay, Dror Bar-Natan, Maya Bar-Hillel, Gil Kalai, 'Solving the Bible Code Puzzle,' Statistical Science, Vol. 14 (1999) 150–173.
  10. ↑ Jordan Ellenberg, How Not to Be Wrong: The Power of Mathematical Thinking, Penguin, 2014 pp. 99–101.
  11. ↑ Equidistant Letter Sequences in Tolstoy's War and Peace .
  12. 1 2 Sharon Begley and John Barry (9 June 1997). "Seek and ye shall find". Newsweek. 129 (23): 66–67.
  13. ↑ "Botschaften des Allmächtigen oder zurechtgeschusterte Daten?". Neue Zürcher Zeitung . 18 August 2004. Archived from the original on 22 January 2008. Retrieved 28 February 2012.
  14. ↑ Gérald Bronner, Belief and Misbelief Asymmetry on the Internet, John Wiley & Sons, 2016 pp.50-51.
  15. ↑ Persi Diaconis, Ronald L. Graham, Magical Mathematics: The Mathematical Ideas that Animate Great Magic Tricks, Princeton University Press 2011 p.43.'Brendan McKay came from Australia. He is a great combinatorialist who has achieved world-wide fame outside mathematics for his definite debunking of the so-called Bible codes'
  16. ↑ H. J. Gans. "A Primer on the Torah Codes Controversy for Laymen (part 1)". aish.com. Archived from the original on 18 March 2008. Retrieved 7 April 2008.
  17. ↑ "Analysis of the "Gans" Committee Report" (PDF). Archived from the original (PDF) on 25 June 2006. Retrieved 2 May 2010.
  18. ↑ David Barnett and Efraim Karsh (2011). "Azzam's Genocidal Threat". Middle East Quarterly, 18 (4) pp. 85–88.
  19. ↑ Tom Segev, '"Makings of History / The Blind Misleading the Blind," Haaretz 21 October 2011
  20. ↑ Karsh, Efraim (16 December 2011). "Haaretz: The Paper for Thinking People?". Middle East Forum. Retrieved 30 June 2022.
  21. ↑ "ICM Plenary and Invited Speakers since 1897". International Congress of Mathematicians.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.