{"id":2743,"date":"2020-04-13T23:45:15","date_gmt":"2020-04-14T03:45:15","guid":{"rendered":"http:\/\/blogs.ams.org\/beyondreviews\/?p=2743"},"modified":"2020-04-14T07:21:38","modified_gmt":"2020-04-14T11:21:38","slug":"john-horton-conway","status":"publish","type":"post","link":"https:\/\/blogs.ams.org\/beyondreviews\/2020\/04\/13\/john-horton-conway\/","title":{"rendered":"John Horton Conway"},"content":{"rendered":"<p><a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/MRAuthorID\/51200\">John Horton Conway<\/a> <a href=\"https:\/\/dailyvoice.com\/new-jersey\/mercer\/obituaries\/covid-19-kills-renowned-princeton-mathematician-game-of-life-inventor-john-conway-in-3-days\/786461\/\">died<\/a> on April 11 of COVID-19. He was 82 years old. In the midst of social distancing measures to fight the coronavirus pandemic, a common refrain is &#8220;life goes on&#8221;.\u00a0 But sometimes it doesn&#8217;t.<\/p>\n<p>Conway was an emeritus professor at Princeton University.\u00a0 Among mathematicians, he was known for his breadth and cleverness, as well as his personality and his seemingly infinite curiosity.\u00a0 \u00a0In MathSciNet, a bit over one quarter of his papers are in number theory, about a sixth in group theory, and a tenth in convex or discrete geometry.\u00a0 The rest are dispersed about 20 other classes in the MSC.\u00a0 Conway managed to make lasting contributions in those other 20 areas, such as his work in algebraic topology and knot theory, where he has an invariant named after him: the Alexander-Conway polynomial.\u00a0 Meanwhile, behind the scenes, Conway was frequently contributing puzzles, games, and ideas to <a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/MRAuthorID\/195254\">Martin Gardner<\/a>, who would write about them in his <a href=\"https:\/\/en.wikipedia.org\/wiki\/Martin_Gardner#Mathematical_Games_column\">famous column in\u00a0<em>Scientific American<\/em><\/a>.<\/p>\n<p><!--more--><\/p>\n<p>In the Mathematical Reviews database, Conway has <a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/authors.html?coauth=51200\">73 coauthors<\/a>.\u00a0 \u00a0A lot of them are famous, but a lot of them not.\u00a0 Conway seemed driven by curiosity, not by reputations when working with people.<\/p>\n<p>Many people know of Conway because of the <a href=\"https:\/\/en.wikipedia.org\/wiki\/Conway%27s_Game_of_Life\">Game of Life<\/a> (also <a href=\"https:\/\/bitstorm.org\/gameoflife\/\">here<\/a>).\u00a0 Like many neophyte programmers, Life was one of the first things I programmed.\u00a0 In my case it was in Fortran on a Hewlett-Packard machine that used punch cards.\u00a0 It was a great project for beginning programming because it was also a very simple model of a biological system.\u00a0 For a young math major, this example was notable because all the models and applications in classes so far were based on calculus.\u00a0 This clearly was not.<\/p>\n<p>A lot of people also know Conway as one of the coauthors of the impressive and classic book <a href=\"https:\/\/mathscinet.ams.org\/mathscinet-getitem?mr=654501\">Winning Ways for your Mathematical Plays<\/a>.\u00a0 (Sadly, the other two coauthors, <a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/MRAuthorID\/35445\">Elwyn Berlekamp<\/a> and <a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/MRAuthorID\/78700\">Richard Guy<\/a>, also died in the past year or so.)\u00a0 The beginning\u00a0 and end of our review of the first edition of the book quickly tell you the truth about it: &#8220;The two volumes are crammed to the brim with information, colored illustrations and examples &#8230; The thrust of the book lies in the direction of formulating exact or suboptimal polynomial strategies for very broad classes of combinatorial games. It is likely to remain an eminent leader in this field for many years to come.&#8221;\u00a0 His <a href=\"https:\/\/mathscinet.ams.org\/mathscinet-getitem?mr=920369\">book on sphere packings<\/a> with <a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/MRAuthorID\/163680\">Neil Sloane<\/a>\u00a0is another classic.<\/p>\n<p>Conway was one of the authors of the monumental <a href=\"https:\/\/mathscinet.ams.org\/mathscinet-getitem?mr=827219\">Atlas of Finite Groups<\/a>.\u00a0 When I first heard about the Atlas, I thought, &#8220;That&#8217;s crazy.&#8221;\u00a0 I turned out to be half right, it was crazy brilliant.\u00a0 The core of the book is a compilation of the <a href=\"https:\/\/en.wikipedia.org\/wiki\/Character_table\">character tables<\/a> of all the finite simple groups known at the time.\u00a0 By some miracle, the authors were able to convince the publisher to produce the book in a large format (42 x 31.6 x 2.9 cm), which was helpful for bigger groups with bigger tables.\u00a0 \u00a0It was bulky to carry and had a tendency to bend and to curl at the edges.\u00a0 Our reviewer, <a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/MRAuthorID\/76880\">Robert Griess<\/a>, suggested that the tables be made available on tape.\u00a0 [Note: See <a href=\"http:\/\/brauer.maths.qmul.ac.uk\/Atlas\/\">http:\/\/brauer.maths.qmul.ac.uk\/Atlas\/.]<\/a> The Atlas was clearly an inspiration for the <a href=\"http:\/\/www.liegroups.org\/\">Atlas of Lie Groups and Representations<\/a>, which is completely online.<\/p>\n<p>Conway had a knack for naming things, as in his famous paper &#8220;Monstrous moonshine&#8221; with Simon Norton.\u00a0 (The complete review is below.)\u00a0 The paper conjectures remarkable correspondences between conjugacy classes of the finite simple group called the Monster and congruence subgroups of the modular group, PSL(2,$\\mathbb{Z}$).\u00a0 The conjecture was proved in <a href=\"https:\/\/mathscinet.ams.org\/mathscinet-getitem?mr=1172696\">MR1172696<\/a> by <a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/MRAuthorID\/39510\">Richard Borcherds<\/a>, who was a Ph.D. student of Conway.<\/p>\n<p>Conway&#8217;s influence was wide, as was his renown.\u00a0 Shortly after Conway&#8217;s death, nice posts quickly began springing up, a few by mathematicians who knew Conway only slightly, but had strong memories of their handful of interactions with him.\u00a0 Here are links to just a few of them.<\/p>\n<ul>\n<li><a href=\"https:\/\/cameroncounts.wordpress.com\/2020\/04\/12\/john-conway\/\">Peter Cameron<\/a><\/li>\n<li><a href=\"https:\/\/terrytao.wordpress.com\/2020\/04\/12\/john-conway\/\">Terry Tao<\/a><\/li>\n<li>The <a href=\"https:\/\/aperiodical.com\/2020\/04\/john-conway-has-died\/\">Aperiodical post<\/a> includes social media posts<\/li>\n<li><a href=\"https:\/\/www.scottaaronson.com\/blog\/?p=4732\">Scott Aaronson<\/a><\/li>\n<li>See also the &#8220;<a href=\"https:\/\/mathoverflow.net\/questions\/357197\/conways-lesser-known-results\">Conway&#8217;s lesser-know results<\/a>&#8221; thread on MathOverflow.<\/li>\n<\/ul>\n<p>Siobhan Roberts wrote a nice <a href=\"https:\/\/www.theguardian.com\/science\/2015\/jul\/23\/john-horton-conway-the-most-charismatic-mathematician-in-the-world?CMP=share_btn_tw\">profile of Conway<\/a> in <a href=\"https:\/\/www.theguardian.com\/us\">the Guardian<\/a> in 2015.\u00a0 She also published an engaging biography of him, titled <a href=\"https:\/\/mathscinet.ams.org\/mathscinet-getitem?mr=3329687\">Genius at play<\/a>.<\/p>\n<p>There is a quote from Isaac Asimov about science:\u00a0<em> The most exciting phrase to hear in science, the one that heralds new discoveries, is not \u201cEureka!\u201d (I found it!) but \u201cThat\u2019s funny \u2026\u201d\u00a0\u00a0<\/em>John Conway was the embodiment of that.<\/p>\n<hr \/>\n<div class=\"doc\">\n<p class=\"headline\"><strong>MR0654501<\/strong><br \/>\n<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/author.html?mrauthid=35445\">Berlekamp, Elwyn R.<\/a>;\u00a0<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/author.html?mrauthid=51200\">Conway, John H.<\/a>;\u00a0<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/author.html?mrauthid=78700\">Guy, Richard K.<\/a><br \/>\n<span class=\"title\">Winning ways for your mathematical plays. Vol. 1.<\/span><br \/>\nGames in general.\u00a0<em>Academic Press, Inc. [Harcourt Brace Jovanovich, Publishers], London-New York,<\/em>\u00a01982.\u00a0<span class=\"rm\">xxxi<\/span>+426+<span class=\"rm\">xi<\/span>\u00a0pp. ISBN: 0-12-091150-7; 0-12-091101-9<br \/>\n<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/mscdoc.html?code=90Dxx,(05-02,90-02)\">90Dxx (05-02 90-02)<\/a><\/p>\n<\/div>\n<div class=\"doc\">\n<div class=\"headline\">\n<p><strong>MR0654502<\/strong><br \/>\n<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/author.html?mrauthid=35445\">Berlekamp, Elwyn R.<\/a>;\u00a0<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/author.html?mrauthid=51200\">Conway, John H.<\/a>;\u00a0<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/author.html?mrauthid=78700\">Guy, Richard K.<\/a><br \/>\n<span class=\"title\">Winning ways for your mathematical plays. Vol. 2.<br \/>\n<\/span>Games in particular.\u00a0<em>Academic Press, Inc. [Harcourt Brace Jovanovich, Publishers], London-New York,<\/em>\u00a01982. pp.\u00a0<span class=\"rm\">i<\/span>\u2013<span class=\"rm\">xxxiii<\/span>\u00a0and 429\u2013850 and\u00a0<span class=\"rm\">i<\/span>\u2013<span class=\"rm\">xix<\/span>. ISBN: 0-12-091152-3; 0-12-091102-7<br \/>\n<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/mscdoc.html?code=90Dxx,(05-02,90-02)\">90Dxx (05-02 90-02)<\/a><\/p>\n<p class=\"review\">The two volumes are crammed to the brim with information, colored illustrations and examples, and it is possible here to indicate only the main topics included in each chapter. The first 13 chapters constitute Volume 1, entitled &#8220;Games in general&#8221;.<br \/>\nChapter 1: Notion of partizan games, illustrated by means of a number of examples, especially Blue-Red Hackenbush, which plays a fundamental role in partizan games, analogous to that played by Nim in impartial games: In a blue-red string figure, Left removes any blue edge and all edges not connected to ground anymore. Right moves similarly on red edges. The player first unable to move loses.<br \/>\nChapter 2: Tools for working with partizan games, such as the simplicity principle: The value of a game\u00a0<span class=\"MathTeX\">$(L|R)$<\/span>, if a number, is the simplest number in\u00a0<span class=\"MathTeX\">$(L,R)$<\/span>. Positive, negative, zero and fuzzy positions. Notion of sum of games. Impartial games: Green Hackenbush (either player may remove a green edge), Nim, Nimbers (the values of impartial games).<br \/>\nChapter 3: Variations on Nim, mex rule, Sprague-Grundy theory: Every impartial game is just a bogus Nim-heap. {From a computational standpoint, there may be considerable differences between impartial games. Thus, nobody knows whether or not there is a polynomial-time strategy for sums of Wythoff games, whereas Nim is trivially polynomial.} In the second part of Chapter 3, attention is shifted back to partizan games: Reversible moves, dominated positions, the size of small fuzzy games.<br \/>\nChapter 4: Back to impartial games:\u00a0<span class=\"MathTeX\">$P$<\/span>\u00a0and\u00a0<span class=\"MathTeX\">$N$<\/span>-positions. Octal games such as Kayles and Dawson&#8217;s Kayles. It is conjectured that Grundy&#8217;s game (divide any pile of tokens into two unequal piles) is ultimately periodic.<br \/>\nChapter 5: More on partizan games. Sums of switches and numbers: Move in a switch\u00a0<span class=\"MathTeX\">$(x|y)\\ (x\\geq y)$<\/span>\u00a0with largest temperature\u00a0<span class=\"MathTeX\">${\\textstyle\\frac 1{2}}(x-y)$<\/span>. Hot games, tiny games. Examples: Domineering, Toads and Frogs.<br \/>\nChapter 6: Deeper analysis of hot games whose options are not necessarily numbers. Mean values and stop values. Thermographs. Equitable and Excitable games.<br \/>\nChapter 7: All about Hackenbush. The colon principle, parity and fusion principles for analyzing Green Hackenbush. Blue-Red Hackenbush is always a number, which may be hard to find even for the subset of redwood furniture. Finding the value of a redwood bed is NP-hard. Analysis of Hackenbush Hotchpotch\u2014which may involve all three colors\u2014using atomic weights. Brief partial survey of transpolynomial games. For the Exptime-completeness of chess, see an article by the reviewer and D. Lichtenstein [J. Combin. Theory Ser. A\u00a0<span class=\"bf\">31<\/span>\u00a0(1981), 199\u2013214;\u00a0<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/publdoc.html?r=1&amp;pg1=MR&amp;s1=629595&amp;loc=fromrevtext\">MR0629595<\/a>]. This also implies the Pspace-hardness of chess.<br \/>\nChapter 8: All small games, remote stars, computing atomic weights for analysing Hackenbush.<br \/>\nChapter 9: Analysis of the join (move in every component game) of partizan and impartial games, normal and mis\u00e8re play. The remoteness function.<br \/>\nChapter 10: Analysis of the union (move in any number of component games) of partizan games, normal play. (Smith&#8217;s result for impartial unions is cited in Chapter 11.) Analysis of urgent unions (the game ends as soon as its first component does) of partizan games, normal and mis\u00e8re play.<br \/>\nChapter 11: Games with infinitely many positions but only finitely many moves: infinite ordinal numbers. Games which may not end: loopy partizan games [see also the reviewer and U. Tassa, Math. Proc. Cambridge Philos. Soc.\u00a0<span class=\"bf\">92<\/span>\u00a0(1982), 193\u2013204]. Loopy Hackenbush.<br \/>\nChapter 12: Loopy impartial games: to win need remoteness in addition to\u00a0<span class=\"MathTeX\">$P,N$<\/span>\u00a0labeling. Entailing move games such as the following: either split a stack of coins into two smaller ones, or remove the top coin from a stack. In the latter case, the opponent has to move in the same stack.<br \/>\nChapter 13: The subtle analysis of mis\u00e8re play. The notion of &#8220;genus&#8221; and how it helps to shed light on tame, restive and even some restless games via the Noah&#8217;s Ark theorem.<br \/>\nThe remaining chapters 14\u201325 are grouped into Volume 2, entitled &#8220;Games in particular&#8221;.<br \/>\nChapter 14: Games played by turning coins. Connection with Nim-multiplication.<br \/>\nChapter 15: Games played by moving coins on strips, such as silver dollar, Antonim, Synonim, Simonim, Welter (a form of Nim with unequal piles), Kotzig&#8217;s Nim. Bounded Nim, Moore&#8217;s\u00a0<span class=\"MathTeX\">$\\text{Nim}_k$<\/span>,\u00a0<span class=\"MathTeX\">$d$<\/span>-Nim.<br \/>\nChapter 16: Various suboptimal strategies for Dots-and-Boxes and a connection to Kayles and Dawson&#8217;s Kayles. Dots-and-Boxes is NP-hard.<br \/>\nChapter 17: Games of joining two spots by a curve satisfying various conditions, such as Lucas&#8217; game (including mis\u00e8re play). Sprouts.<br \/>\nChapter 18: Analysis of Sylver Coinage (name an integer not the linear combination of previously named integers). See also Guy&#8217;s research problem [Amer. Math. Monthly\u00a0<span class=\"bf\">83<\/span>\u00a0(1976), 634\u2013637]. The chapter also includes Chomp (arithmetic and geometric versions) and Zig-Zag. These (together with von Neumann&#8217;s Hackenbush mentioned at the end of Chapter 17) are special cases of poset games.<br \/>\nChapter 19: Games played on a chessboard with a King and Go stones (Kinggo) or a duke and Go stones (Dukego). The Angel and the Square-Eater. Wolves-and-sheep and variations thereof.<br \/>\nChapter 20: Analysis of Fox and Geese: Four &#8220;geese&#8221; moving upwards on a checkerboard try to trap a &#8220;fox&#8221; who moves like a King in Checkers. {This game, played with tokens of two types on a digraph, is Pspace-hard.}<br \/>\nChapter 21: The French Military Game: A game of pursuit similar to Fox and Geese.<br \/>\nChapter 22: Tic-Tac-Toe and similar games. Go-Moku and the Hales-Jewett pairing strategy [A. W. Hales and R. I. Jewett, Trans. Amer. Math. Soc.\u00a0<span class=\"bf\">106<\/span>\u00a0(1963), 222\u2013229;\u00a0<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/publdoc.html?r=1&amp;pg1=MR&amp;s1=143712&amp;loc=fromrevtext\">MR0143712<\/a>]. Hex and the Shannon Switching game. Phutball.<br \/>\nChapter 23: Analysis of peg solitaire games. Beasley&#8217;s proof that 18 moves are necessary for central peg solitaire. Variations of peg solitaire.<br \/>\nChapter 24: Puzzles with cubes, puzzles with wire and string, the Tower of Hanoi and ternary numbers, the 15 puzzle. Analysis of the Hungarian cube puzzle, tactics for solving other &#8220;Hungarian&#8221; puzzles. Examples of other puzzles: paradoxical pennies, paradoxical dice, magic squares. The chapter ends with some calendar-theoretic computations, including the dates of Easter and Rosh Hashanah.<br \/>\nChapter 25: The &#8220;game&#8221; of Life. The main result is a reduction of difficult mathematical problems such as Fermat&#8217;s Last Theorem to the predictability problem of the final fate of an initial life pattern. This is done by computer simulation with appropriate life patterns.<br \/>\nEach chapter ends with a section called &#8220;Extras&#8221;, where underlying principles or additional details are given. Instead of formal proofs, short convincing arguments or examples are provided. This tends to increase considerably the amount of material packed in the 850 pages of the book. Together with the wit, humour and originality of approach, it also increases the readability or apparent readability. To really understand and prove everything in the book, not to mention to attempt solutions of the many questions inspired on every page of the book, will engage many people for many years.<br \/>\nAs the authors state, the book is not an encyclopedia, since there are many games, theories and puzzles not included in it. In fact, there are certain directions not pursued in the book, such as transpolynomiality of games or questions of undecidability or computability of strategies. The thrust of the book lies in the direction of formulating exact or suboptimal polynomial strategies for very broad classes of combinatorial games. It is likely to remain an eminent leader in this field for many years to come.<\/p>\n<p class=\"sfx\"><span class=\"ReviewedBy\">Reviewed by\u00a0<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/author.html?mrauthid=68550\">Aviezri S. Fraenkel<\/a><\/span><\/p>\n<\/div>\n<\/div>\n<hr \/>\n<p class=\"headline\"><strong>MR0554399<\/strong><br \/>\n<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/author.html?mrauthid=51200\">Conway, J. H.<\/a>;\u00a0<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/author.html?mrauthid=132270\">Norton, S. P.<\/a><br \/>\n<span class=\"title\">Monstrous moonshine.<\/span><br \/>\n<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/journaldoc.html?id=828\"><em>Bull. London Math. Soc.<\/em><\/a>\u00a0<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/publications.html?pg1=ISSI&amp;s1=303059\">11\u00a0<\/a><a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/publications.html?pg1=ISSI&amp;s1=303059\">(1979),\u00a0<\/a><a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/publications.html?pg1=ISSI&amp;s1=303059\">no. 3,<\/a>\u00a0308\u2013339.<br \/>\n<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/mscdoc.html?code=20D08,(10D12)\">20D08 (10D12)<\/a><\/p>\n<p class=\"review\">This extremely informative paper details numerous, apparently systematic, coincidences between genus-0 subgroups of the modular group and subgroups of the &#8220;Monster&#8221; finite simple group conjectured by Fischer and Griess. (See also J. G. Thompson&#8217;s companion papers [<a href=\"https:\/\/mathscinet.ams.org\/mathscinet-getitem?mr=554401\">20029<\/a> and <a href=\"https:\/\/mathscinet.ams.org\/mathscinet-getitem?mr=554402\">20030<\/a> below].)<br \/>\nThe authors begin with a brief history of the increasing observations of such coincidences, prior to their own work. Section 2 then describes the main conjectures. The authors give a correspondence between conjugacy classes of the Monster and congruence subgroups of the modular group\u2014roughly, an element of order\u00a0<span class=\"MathTeX\">$n$<\/span>\u00a0in the Monster will correspond to a subgroup above\u00a0<span class=\"MathTeX\">$\\Gamma_0(n)$<\/span>. Expand a hauptmodul for each such subgroup by Fourier coefficients in powers of\u00a0<span class=\"MathTeX\">$q=e^{2\\pi i\\tau}$<\/span>. For fixed\u00a0<span class=\"MathTeX\">$k$<\/span>, the\u00a0<span class=\"MathTeX\">$q^k$<\/span>-coefficients of these functions provide a class function, which is conjectured to be an actual character of the Monster (the\u00a0<span class=\"MathTeX\">$k$<\/span>th &#8220;head character&#8221;). Sections 3\u20137 discuss technical details of the correspondence, including relations among the classes, and relations with the Leech lattice for certain Monster elements. Section 8 describes &#8220;replication&#8221; formulae among the head characters, and other &#8220;expansion&#8221; and &#8220;compression&#8221; among the functions and the head characters. Section 9 describes similar work (&#8220;moonshine&#8221;) for groups other than the Monster. In Section 10 the authors ask why only genus-0 subgroups of congruence type arise\u2014and propose the determination of all such subgroups. (There are apparently 300\u2013400, of which 171 arise in connection with the Monster itself.)<br \/>\nThe paper includes tables giving: the irreducible degrees of the Monster (from the character table determined by Fischer, Living-stone and Thorne); sample decompositions of a few head characters in terms of the irreducibles; a class list for the Monster, indicating the correspondence with a subgroup of the modular group; the first 10 head characters in full; and various other information on the classes and the formulae mentioned above.<br \/>\nSince the appearance of the paper, R. Griess has constructed the Monster [&#8220;The friendly giant&#8221;, Invent. Math., to appear]. The head-character conjecture can be verified by a finite but lengthy computation\u2014and this has been essentially completed by A. O. L. Atkin, P. Fong, and the reviewer. An actual module affording the head characters, at least for the centralizer in the Monster of a 2-central involution, has been constructed by V. G. Kac [Proc. Nat. Acad. Sci. U.S.A.\u00a0<span class=\"bf\">77<\/span>\u00a0(1980), no. 9(1), 5048\u20135049]; Griess is now working to extend the action to the full Monster group.<br \/>\nThis subsequent work seems to provide at best only a partial answer to the many questions about the interrelations of this finite simple group with the (infinite discrete) genus-0 subgroups of analytic number theory.<\/p>\n<p><span class=\"ReviewedBy\">Reviewed by\u00a0<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/author.html?mrauthid=\">Stephen D. Smith<\/a><\/span><\/p>\n<hr \/>\n<p class=\"headline\"><strong>MR0827219<\/strong>\u00a0<span style=\"color: #000000\"><b>\u00a0<\/b><\/span><br \/>\n<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/author.html?mrauthid=51200\">Conway, J. H.<\/a><span class=\"instInfo\"><a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/institution.html?code=4-CAMB\">(4-CAMB)<\/a><\/span>;\u00a0<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/author.html?mrauthid=198799\">Curtis, R. T.<\/a><span class=\"instInfo\"><a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/institution.html?code=4-CAMB\">(4-CAMB)<\/a><\/span>;\u00a0<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/author.html?mrauthid=132270\">Norton, S. P.<\/a><span class=\"instInfo\"><a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/institution.html?code=4-CAMB\">(4-CAMB)<\/a><\/span>;\u00a0<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/author.html?mrauthid=193373\">Parker, R. A.<\/a><span class=\"instInfo\"><a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/institution.html?code=4-CAMB\">(4-CAMB)<\/a><\/span>;\u00a0<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/author.html?mrauthid=209865\">Wilson, R. A.<\/a><span class=\"instInfo\"><a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/institution.html?code=4-CAMB\">(4-CAMB)<\/a><\/span><br \/>\n<span class=\"title\">Atlas of finite groups.<\/span><br \/>\nMaximal subgroups and ordinary characters for simple groups. With computational assistance from J. G. Thackray.\u00a0<em>Oxford University Press, Eynsham,<\/em>\u00a01985.\u00a0<span class=\"rm\">xxxiv<\/span>+252 pp. ISBN: 0-19-853199-0<br \/>\n<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/mscdoc.html?code=20D05,(20-02)\">20D05 (20-02)<\/a><\/p>\n<div class=\"mentions\">\n<p>Related:\u00a0 <a class=\"br\" href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/author.html?mrauthid=237105\">Thackray, J. G.<\/a><\/p>\n<\/div>\n<p class=\"review\">At last, an official collection of character tables and related information about many finite simple groups has appeared in book form. This information is important to specialists in finite group theory and the volume contains neatly presented instructional material which the nonspecialists can appreciate. For years, the authors have used the material at a very high level. It has been reworded and refined by experience. At the month-long 1979 Santa Cruz conference on finite groups, Simon Norton carried a shopping bag of tattered printouts and character tables to deal with urgent questions about simple groups. Now, we can all have the power of such rapid access, but in a classier format!<br \/>\nThe &#8220;classic&#8221; character table of a finite group\u00a0<span class=\"MathTeX\">$G$<\/span>\u00a0is by definition a\u00a0<span class=\"MathTeX\">$k\\times k$<\/span>\u00a0matrix of complex numbers, whose rows are indexed by the\u00a0<span class=\"MathTeX\">$k$<\/span>\u00a0irreducible characters and whose columns are indexed by the\u00a0<span class=\"MathTeX\">$k$<\/span>\u00a0conjugacy classes; of course, it is not unique because there is no generally accepted way to order the index sets, though the principal character (corresponding to the trivial homomorphism\u00a0<span class=\"MathTeX\">$G\\to {\\rm GL}(1,{\\bf C}))$<\/span>\u00a0is always listed first. The\u00a0<span class=\"MathTeX\">$(i,j)$<\/span>\u00a0entry is\u00a0<span class=\"MathTeX\">$\\chi_i(g_j)$<\/span>, the value of the\u00a0<span class=\"MathTeX\">$i$<\/span>th irreducible character on a representative of the\u00a0<span class=\"MathTeX\">$j$<\/span>th conjugacy class, and this algebraic number is always a sum of\u00a0<span class=\"MathTeX\">$d\\ |g_j|$<\/span>th roots of unity, where\u00a0<span class=\"MathTeX\">$d=\\chi_i(1)$<\/span>\u00a0is the degree of\u00a0<span class=\"MathTeX\">$\\chi_i$<\/span>.<br \/>\nThe efforts of the last 25 years to classify finite simple groups created a greater need to have numerical and combinatorial information about the known groups. The occasional tables produced by R. Brauer or J. S. Frame or J. Todd years ago were followed by a flood of tables in the 1960s and 1970s. Generally, these were distributed informally, often with no name or source written on them and always without proof. Referring to a character table in a research article was awkward at times. The general theory of Brauer gave many arithmetic conditions on the character table which in &#8220;easy&#8221; cases allowed one to fill in many blank entries for the table of a particular group. This was not always the case. For instance, David Hunt&#8217;s work on the tables for the Fischer\u00a0<span class=\"MathTeX\">$3$<\/span>-transposition groups took an especially long time and involved extensive computer work and a study of induct-restrict tables for subgroups with known character tables.<br \/>\nIn sum, the five authors have collected some of this early and unpublished work, then greatly extended it and put it in a form suitable for easy modern applications.<br \/>\nThe book is organized as follows: (I) Introduction and explanations (28 pages), (II) The character tables (235 pages), (III) Supplementary tables (6 pages), (IV) References (8 pages) and Index (1 page).<br \/>\n(I): Sections 1, 2 and 3 contain a rapid introduction to the families of finite simple groups. It is clear and telegraphic in style and not intended for someone who is looking for full discussions and constructions.<br \/>\nSections 4 through 7 discuss the multiplier, automorphism groups, isoclinism and the group extension theory which is relevant to interpreting the blocks (and broken-edge blocks) in the tables, notation for conjugacy classes, algebraic numbers and algebraic conjugates of these two concepts. We comment on the tables themselves in (II). The authors&#8217; notations for algebraic integers are very successful for character tables, e.g.,\u00a0<span class=\"MathTeX\">$z=z_N=\\exp(2\\pi i\/N)$<\/span>,\u00a0<span class=\"MathTeX\">$b_N=\\frac12\\sum^{N-1}_{t=1}z^{t^2}$<\/span>,\u00a0<span class=\"MathTeX\">$c_N=\\frac13\\sum^{N-1}_{t=1} z^{t^3}$<\/span>\u00a0(for\u00a0<span class=\"MathTeX\">$N\\equiv 1$<\/span>\u00a0(mod 3)), etc.<br \/>\nOne fault with the exposition is that the authors use terms and notation without explanation, then define them later. In the above sequence of definitions, for\u00a0<span class=\"MathTeX\">$z_N$<\/span>,\u00a0<span class=\"MathTeX\">$b_N$<\/span>,\u00a0<span class=\"MathTeX\">$c_N,\\cdots$<\/span>, one finds &#8220;<span class=\"MathTeX\">$n_2$<\/span>&#8221;, but not a definition until further down the column. The notation\u00a0<span class=\"MathTeX\">$^*k$<\/span>\u00a0is used in Section 7.3 but no hint is given for where to look for the definition. It would help if an index of notations and definitions were included to help the reader who starts reading in the middle.<br \/>\nThe authors discuss the several existing systems of notation for the simple groups. Parts of the system used in the\u00a0<span class=\"it\">Atlas<\/span>\u00a0make the reviewer uncomfortable.<br \/>\nThe most glaring item is the use of &#8220;O&#8221; for the simple composition factor of the\u00a0<span class=\"MathTeX\">$n$<\/span>-dimensional orthogonal group of type\u00a0<span class=\"MathTeX\">$\\epsilon$<\/span>\u00a0over\u00a0<span class=\"MathTeX\">${\\bf F}_q$<\/span>. In other systems, this group would be\u00a0<span class=\"MathTeX\">${\\rm P}\\Omega^\\epsilon(n,q)$<\/span>\u00a0or one of\u00a0<span class=\"MathTeX\">$D_m(q)$<\/span>,\u00a0<span class=\"MathTeX\">$^2D_m(q)$<\/span>\u00a0(when\u00a0<span class=\"MathTeX\">$n=2m$<\/span>) or\u00a0<span class=\"MathTeX\">$B_m(q)$<\/span>\u00a0when\u00a0<span class=\"MathTeX\">$n=2m+1$<\/span>. The authors reject these notations because they want one letter for the basic name of all these simple groups.<br \/>\nThe second comment is about names assigned to sporadic groups; see Table 1, page viii. The principle generally used by group theorists has been to name a sporadic group after its discoverers and use a symbol related to these names. The sometime exceptions to this have been the Conway groups (denoted by\u00a0<span class=\"MathTeX\">$.0,\\;.1,\\;.2$<\/span>\u00a0and\u00a0<span class=\"MathTeX\">$.3$<\/span>\u00a0since 1968 but by\u00a0<span class=\"MathTeX\">${\\rm Co}_0,\\; {\\rm Co}_1,\\;{\\rm Co}_2$<\/span>, and\u00a0<span class=\"MathTeX\">${\\rm Co}_3$<\/span>\u00a0in this volume), the Fischer groups (denoted by\u00a0<span class=\"MathTeX\">$M(22),\\;M(23)$<\/span>\u00a0and\u00a0<span class=\"MathTeX\">$M(24)&#8217;$<\/span>\u00a0originally, but later by\u00a0<span class=\"MathTeX\">${\\rm Fi}_{22},\\;{\\rm Fi}_{23}$<\/span>\u00a0and\u00a0<span class=\"MathTeX\">${\\rm Fi}&#8217;_{24}$<\/span>) and the Monster (the group discovered by Fischer and the reviewer in November 1973; the\u00a0<span class=\"it\">Atlas<\/span>\u00a0symbols are\u00a0<span class=\"MathTeX\">$M$<\/span>, FG and\u00a0<span class=\"MathTeX\">$F_1$<\/span>) and the Baby Monster (the\u00a0<span class=\"MathTeX\">$\\{3,4\\} ^+$<\/span>-transposition group discovered by Fischer earlier in 1973; the\u00a0<span class=\"it\">Atlas<\/span>\u00a0symbols are\u00a0<span class=\"MathTeX\">$B$<\/span>\u00a0and\u00a0<span class=\"MathTeX\">$F_2$<\/span>) and the Harada group (called the Harada-Norton group in the\u00a0<span class=\"it\">Atlas<\/span>; the\u00a0<span class=\"it\">Atlas<\/span>\u00a0symbols are HN and\u00a0<span class=\"MathTeX\">$F_5$<\/span>).<br \/>\nThe system of\u00a0<span class=\"MathTeX\">$F$<\/span>&#8216;s with subscripts has several nice group-theoretic features. However, there seems to be no natural systems covering all sporadics. Why not keep the names and remember the history, at least? Perhaps later developments will suggest a good solution.<br \/>\nFinally some comments about notation for other finite groups. Several recommendations in 5.2 really are at variance with general usage. The authors mention\u00a0<span class=\"MathTeX\">$C_m$<\/span>\u00a0for a cyclic group of order\u00a0<span class=\"MathTeX\">$m$<\/span>\u00a0but not\u00a0<span class=\"MathTeX\">${\\bf Z}_m$<\/span>! Their term &#8220;diagonal product&#8221;\u00a0<span class=\"MathTeX\">$A\\triangle B$<\/span>\u00a0is otherwise known as a pullback or a fiber product. The most common notation for an extraspecial group is\u00a0<span class=\"MathTeX\">$p^{1+2n}$<\/span>\u00a0or\u00a0<span class=\"MathTeX\">$p_\\epsilon^{1+2n}$<\/span>. Since notation for an extension\u00a0<span class=\"MathTeX\">$A\\cdot B$<\/span>\u00a0reads left-to-right along an ascending series, it would be more appropriate to write\u00a0<span class=\"MathTeX\">$(A\\times B)\\frac12$<\/span>\u00a0than\u00a0<span class=\"MathTeX\">$\\frac12(A\\times B)$<\/span>.<br \/>\n(II): The organization of the individual tables is discussed in Section 6. See page xxiv for a well-diagrammed example. Let\u00a0<span class=\"MathTeX\">$G$<\/span>\u00a0be the simple group. The tables come in blocks with each block corresponding to an extension of the form\u00a0<span class=\"MathTeX\">$m.G.a$<\/span>, where\u00a0<span class=\"MathTeX\">$m$<\/span>\u00a0is a cyclic quotient of the Schur multiplier and\u00a0<span class=\"MathTeX\">$a$<\/span>\u00a0is a cyclic subgroup of the outer automorphism group; for reaons why these cases suffice (nearly), see 6.5 and 6.6.<br \/>\nTo the left of the block is the downward running list of characters\u00a0<span class=\"MathTeX\">$(\\chi_1= 1,\\chi_2,\\chi_3,\\cdots)$<\/span>\u00a0and their indicators (0,\u00a0<span class=\"MathTeX\">$+$<\/span>\u00a0or\u00a0<span class=\"MathTeX\">$-$<\/span>\u00a0as the character is not real-valued, afforded by a real representation, or real-valued but not afforded by a real representation). Across the top is a band with several rows of information about the columns (indexed by the conjugacy classes,\u00a0<span class=\"MathTeX\">$C_i,\\;i=1,\\cdots,k$<\/span>). The experience of the last 25 years has shown the importance of enriching the traditional &#8220;classic&#8221; character table to include power maps (i.e., for\u00a0<span class=\"MathTeX\">$n\\in{\\bf Z}$<\/span>, which classes contain the\u00a0<span class=\"MathTeX\">$n$<\/span>th powers of elements from a fixed class), factorizations (i.e. if\u00a0<span class=\"MathTeX\">$g\\in C_i$<\/span>\u00a0and\u00a0<span class=\"MathTeX\">$\\pi$<\/span>\u00a0is a set of primes and\u00a0<span class=\"MathTeX\">$g=g_\\pi g_{\\pi&#8217;}$<\/span>\u00a0is the unique commuting factorization of\u00a0<span class=\"MathTeX\">$g$<\/span>\u00a0into a\u00a0<span class=\"MathTeX\">$\\pi$<\/span>-element and a\u00a0<span class=\"MathTeX\">$\\pi&#8217;$<\/span>-element, which\u00a0<span class=\"MathTeX\">$C_j$<\/span>\u00a0contains\u00a0<span class=\"MathTeX\">$g_\\pi$<\/span>), and so on. A simple application of this information, which is not possible to execute with a strictly classical table, is to find the dimension of the space of cubic invariants on a module\u00a0<span class=\"MathTeX\">$V$<\/span>\u00a0affording the character\u00a0<span class=\"MathTeX\">$\\chi$<\/span>. The character on the symmetric tensor cube of\u00a0<span class=\"MathTeX\">$V$<\/span>\u00a0is\u00a0<span class=\"MathTeX\">$g\\mapsto \\frac16\\{\\chi(g)^3+3\\chi(g)\\chi(g^2)+2\\chi(g)^3\\}$<\/span>\u00a0and so its inner product with the trivial character of\u00a0<span class=\"MathTeX\">$G$<\/span>\u00a0gives the answer.<br \/>\nThe difficulty of getting these blocks correct increases generally according to the sequence\u00a0<span class=\"MathTeX\">$m=1$<\/span>,\u00a0<span class=\"MathTeX\">$a=1$<\/span>;\u00a0<span class=\"MathTeX\">$a=1$<\/span>;\u00a0<span class=\"MathTeX\">$m,a$<\/span>\u00a0arbitrary. Indeed the authors acknowledge errors which turned up as the book went to press (see page xxxii, bottom). How the notations extend across the several upward and downward extensions is articulated well.<br \/>\n(III): The final part of the\u00a0<span class=\"it\">Atlas<\/span>\u00a0text consists of three tables and a list of references. (1) Partitions and classes of characters for\u00a0<span class=\"MathTeX\">$S_n$<\/span>, useful, say, in working out particular invariants of the group in question. (2) Involvement of sporadic groups in one another (the single &#8220;?&#8221; in this\u00a0<span class=\"it\">Atlas<\/span>\u00a0table is now claimed to be &#8220;<span class=\"MathTeX\">$-$<\/span>&#8221; in recent work of R. A. Wilson). (3) Orders of over 250 simple groups, with orders in base 10 and in factorized forms and with Schur multiplier and outer automorphism group.<br \/>\n(IV) The bibliography is restricted to (i) some very general works on the families of finite simple groups and (ii) lengthy lists of articles on each of the 26 sporadic groups.<br \/>\nSurvey articles (no proofs) for absolute beginners are worth mentioning and could go in (i), e.g., a paper by R. Carter [J. London Math. Soc.\u00a0<span class=\"bf\">40<\/span>\u00a0(1965), 193\u2013240;\u00a0<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/publdoc.html?r=1&amp;pg1=MR&amp;s1=174655&amp;loc=fromrevtext\">MR0174655<\/a>] for groups of Lie type and a paper by the reviewer [in\u00a0<span class=\"it\">Vertex operators in mathematics and physics<\/span>\u00a0(Berkeley, Calif., 1983), 217\u2013229, Springer, New York, 1985;\u00a0<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/publdoc.html?r=1&amp;pg1=MR&amp;s1=781380&amp;loc=fromrevtext\">MR0781380<\/a>] for sporadic groups. Also, references for Schur multiplier and automorphism groups would be of general interest.<br \/>\nTables of numerical information are notorious for errors and it does pay to compare; for example, the order of McLaughlin&#8217;s group is incorrectly given on page 136 of D. Gorenstein&#8217;s\u00a0<span class=\"it\">Finite simple groups<\/span>\u00a0[Plenum, New York, 1982;\u00a0<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/publdoc.html?r=1&amp;pg1=MR&amp;s1=698782&amp;loc=fromrevtext\">MR0698782<\/a>]. After the Higman-Sims group,\u00a0<span class=\"MathTeX\">$G$<\/span>, was discovered in 1968, it was deduced that\u00a0<span class=\"MathTeX\">$G$<\/span>\u00a0must have subgroups\u00a0<span class=\"MathTeX\">$K\\leq H\\leq G$<\/span>\u00a0with\u00a0<span class=\"MathTeX\">$H\\cong {\\rm PSU}(3,5)$<\/span>\u00a0and\u00a0<span class=\"MathTeX\">$K\\cong {\\rm Alt}_7$<\/span>. Of course, the characters of\u00a0<span class=\"MathTeX\">$G$<\/span>\u00a0must restrict sensibly to characters of\u00a0<span class=\"MathTeX\">$K$<\/span>\u00a0and\u00a0<span class=\"MathTeX\">$H$<\/span>\u00a0but the character tables then at hand produced a contradiction! The error in the tables was found.<br \/>\nShould a researcher, urgently needing to prove a theorem, trust the\u00a0<span class=\"it\">Atlas<\/span>? The question is like that of whether to accept the classification of finite simple groups. Both efforts are widely respected, the participants in both have worked at high levels to reach the goal, yet have admitted that errors exist. In both cases, the group theory community feels that probably only local adjustments would be needed in the ambient program to deal with errors. So, the answer is: &#8220;Yes, but<span class=\"MathTeX\">$\\ldots$<\/span>&#8221;.<br \/>\nOnly a purist would turn his or her back on either claim of completion. To make progress, we must accept them as essentially correct but pay attention for some time and look for alternate arguments whenever possible. One can treat them as axioms when writing arguments down formally.<br \/>\nNorton has shown a list of errors discovered since publication. One is a nonsquare character table! It is worth mentioning that Chat-Yin Ho recently found a maximal\u00a0<span class=\"MathTeX\">$7$<\/span>-local subgroup of the Monster not on the\u00a0<span class=\"it\">Atlas<\/span>\u00a0list. There may be a problem with the list of maximal subgroups for\u00a0<span class=\"MathTeX\">${\\rm Co} _1$<\/span>.<br \/>\n{Reviewer&#8217;s remarks: The reviewer is disappointed at the incorrectness of the scholarship in a few instances (notwithstanding the disclaimer on page xxxii, Section 8.5.1). The correctness of the Monster character table is not completely proved (though not doubted). (a) The determination of the conjugacy classes requires sufficient knowledge of centralizers of elements in a subgroup of\u00a0<span class=\"MathTeX\">${\\bf M}$<\/span>\u00a0of the form\u00a0<span class=\"MathTeX\">$2^{1+24}\\cdot{\\rm Co}_1$<\/span>; the authors guessed the basic information, then proceeded. (b) The existence of the irreducible character of degree 196883 was taken as a hypothesis (196883 is the smallest number which could be the degree of a nonprincipal character); a proof that such a character exists was claimed by Norton in 1981 but no manuscript has appeared, and its relationship with (a) has not been explicitly stated; existence of such a character is necessary to complete the program devised by J. G. Thompson [Bull. London Math. Soc.\u00a0<span class=\"bf\">11<\/span>\u00a0(1979), no. 3, 340\u2013346;\u00a0<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/publdoc.html?r=1&amp;pg1=MR&amp;s1=554400&amp;loc=fromrevtext\">MR0554400<\/a>] for proving uniqueness of\u00a0<span class=\"MathTeX\">${\\bf M}$<\/span>.<br \/>\n{It would have been helpful to have some recent references, e.g. to the reviewer&#8217;s recent work on code loops. The reviewer understands that future editions will contain no new references.<br \/>\n{The book is attractive in appearance. The cover is a cherry red with white writing on stiff cardboard. The authors&#8217; names form a neat matrix listed vertically in alphabetical order (which agrees with their respective ages, apparently), each with two initials and a 6-letter last name. The price is extremely fair. The authors are to be commended for their influence on the price and for getting the publisher to replace the originally intended soft binding.<br \/>\n{The book is large\u2014too large for most briefcases. The wire binding on the reviewer&#8217;s copy became deformed right away and interfered with easy closing and opening of the book to lie flat on a table. The edges of the pages near the binding have begun to suffer due to struggles with the binding. One idea is to make the tables available on tape, potentially a big saving of effort for the user who intends computer calculations.<br \/>\n{The mathematics community (and physics community) should be grateful to the creators of the\u00a0<span class=\"it\">Atlas<\/span>\u00a0for their extremely fine service. An appreciation and use of the finite simple groups might be expected to spread noticeably faster as a result.}<\/p>\n<p><span class=\"ReviewedBy\">Reviewed by\u00a0<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/author.html?mrauthid=76880\">R. L. Griess<\/a><\/span><\/p>\n<hr \/>\n<p class=\"headline\"><strong>MR0258014<\/strong><br \/>\n<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/author.html?mrauthid=51200\">Conway, J. H.<\/a><br \/>\n<span class=\"title\">An enumeration of knots and links, and some of their algebraic properties.<\/span>\u00a01970\u00a0<em>Computational Problems in Abstract Algebra (Proc. Conf., Oxford, 1967)\u00a0<\/em>pp. 329\u2013358\u00a0<em>Pergamon, Oxford<\/em><br \/>\n<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/mscdoc.html?code=55.20\">55.20<\/a><\/p>\n<p class=\"review\">In this essential paper (i) a new efficient notation for describing specific knots is expounded, (ii) identities are reported which reflect the behaviour of knot invariants on changing some structure elements coded in the notation, (iii) lists of all prime knots up to 11 crossings and of all prime links up to 10 crossings are given in this notation, a census which checks (and corrects) and enlarges the existing tables still based on Tait&#8217;s, Little&#8217;s and Kirkman&#8217;s work before 1900. The ideas are presented here in expository style, whereas a more technical paper with more complete presentation of the subject is promised.<br \/>\nThe first part explains the new notation. This is based on choosing an edge-connected 4-valent planar graph, the simplest of which, marked by 1*, looks like an 8; in fact only eight such graphs are needed within the range of the tables. If for each node of the chosen graph one substitutes a &#8220;tangle&#8221;, one gets a normed projection of a (<span class=\"MathTeX\">$\\mu$<\/span>-component) knot. A &#8220;tangle&#8221; consists of a normed projection of strings such that there are four free ends pointing to the four compass directions. A few operations are defined on tangles, such that the notation and classes of &#8220;integral&#8221;, &#8220;rational&#8221; and &#8220;algebraic&#8221; tangles can be defined recursively starting with the specific tangle marked by 1. That way the symbol for a knot indicating the graph and the substituted algebraic tangles contains some structural elements of the knot. As H. F. Trotter points out [<span class=\"it\">Computational problems in abstract algebra<\/span>\u00a0(Proc. Conf., Oxford, 1967), pp. 359\u2013364, Pergamon, Oxford, 1970;\u00a0<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/publdoc.html?r=1&amp;pg1=MR&amp;s1=258015&amp;loc=fromrevtext\">MR0258015<\/a>], this notation seems to be &#8220;much the best both for handwork and (perhaps with some minor modification) for computer representation&#8221;.<br \/>\nThen the author describes the interplay between knot equivalences and elements figuring in the notation; for rational tangles substituted into the graph 1*, there are remarkable connections with continued fractions. The next sections contain remarks concerning Alexander polynomial, Minkowski unit and signature; some identities are reported which allowed short computations but which have wider applications, in part not yet fully explored. The last section gives the inferences to draw from the new lists to the open problem of whether every slice knot is a ribbon knot.<br \/>\nThe lists (computed by hand) given as an appendix include the 1-component knots up to 8 crossings with symmetries, signature, Minkowski unit, determinant and polynomial, up to 10 crossings with symmetries, determinant and polynomial, and an enumeration of all 11-crossing knots, alternating and nonalternating; furthermore, the links up to 8 crossings with linking numbers, symmetries, signature, Minkowski unit, determinant and polynomial, up to 9 crossings with linking numbers and polynomial, and an enumeration of the 10-crossing links. {Remark: the column heading on p. 345 should read\u00a0<span class=\"MathTeX\">$\\delta^0$<\/span>\u00a0instead of\u00a0<span class=\"MathTeX\">$\\sigma^0$<\/span>.}<\/p>\n<p><span class=\"ReviewedBy\">Reviewed by\u00a0<a href=\"https:\/\/mathscinet.ams.org\/mathscinet\/search\/author.html?mrauthid=55790\">H. E. Debrunner<\/a><\/span><\/p>\n<div style=\"margin-top: 0px; margin-bottom: 0px;\" class=\"sharethis-inline-share-buttons\" ><\/div>","protected":false},"excerpt":{"rendered":"<p>John Horton Conway died on April 11 of COVID-19. He was 82 years old. In the midst of social distancing measures to fight the coronavirus pandemic, a common refrain is &#8220;life goes on&#8221;.\u00a0 But sometimes it doesn&#8217;t. Conway was an &hellip; <a href=\"https:\/\/blogs.ams.org\/beyondreviews\/2020\/04\/13\/john-horton-conway\/\">Continue reading <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n<div style=\"margin-top: 0px; margin-bottom: 0px;\" class=\"sharethis-inline-share-buttons\" data-url=https:\/\/blogs.ams.org\/beyondreviews\/2020\/04\/13\/john-horton-conway\/><\/div>\n","protected":false},"author":86,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[8],"tags":[],"class_list":["post-2743","post","type-post","status-publish","format-standard","hentry","category-mathematicians"],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p6C2KK-If","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/blogs.ams.org\/beyondreviews\/wp-json\/wp\/v2\/posts\/2743","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blogs.ams.org\/beyondreviews\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blogs.ams.org\/beyondreviews\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blogs.ams.org\/beyondreviews\/wp-json\/wp\/v2\/users\/86"}],"replies":[{"embeddable":true,"href":"https:\/\/blogs.ams.org\/beyondreviews\/wp-json\/wp\/v2\/comments?post=2743"}],"version-history":[{"count":20,"href":"https:\/\/blogs.ams.org\/beyondreviews\/wp-json\/wp\/v2\/posts\/2743\/revisions"}],"predecessor-version":[{"id":2763,"href":"https:\/\/blogs.ams.org\/beyondreviews\/wp-json\/wp\/v2\/posts\/2743\/revisions\/2763"}],"wp:attachment":[{"href":"https:\/\/blogs.ams.org\/beyondreviews\/wp-json\/wp\/v2\/media?parent=2743"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blogs.ams.org\/beyondreviews\/wp-json\/wp\/v2\/categories?post=2743"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blogs.ams.org\/beyondreviews\/wp-json\/wp\/v2\/tags?post=2743"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}