Search

Tarik Tazdaït's book, "La science est un jeu: La théorie des jeux dans la France des années 1950," provides a detailed account of the reception of game theory in France in the 1950s. The book explores how game-theoretic ideas and the metaphor of the "game" were integrated into French academic and intellectual life. The narrative focuses on three main figures, Georges-Théodule Guilbaud, Claude Lévi-Strauss, and Jacques Lacan, who played significant roles in promoting game theory in their respective fields. The book also highlights the cultural interconnectedness and interdisciplinary collaborations that shaped the development of game theory in France during this period. [Extracted from the article]

"The Role of Mathematics in Explanation" by Christopher Pincock explores how mathematics can contribute to explanations in both science and mathematics itself. The book discusses traditional theories of explanation, including Hempel's Deductive-Nomological Theory and various causal theories. Pincock argues that causal theories are the most promising, but also explores the limitations of these theories. The book also examines the role of mathematics in explaining physical phenomena and the criticisms of Marc Lange's theories. Overall, this book provides a comprehensive survey of different perspectives on the role of mathematics in explanation. [Extracted from the article]

The "unity of combinatorics" that Richard Guy and Bud Brown have chosen to give an exposition of is the myriad connections that exist between multiple areas within the field; areas they both love. Richard's interests spanned number theory, geometry, recreational mathematics, graph theory, combinatorics, and a field he helped to invent: combinatorial game theory. In early August 2015, at the start of a New York city trip for a conference at the Museum of Mathematics, Richard and his I Winning Ways i coauthors Berlekamp and Conway got to spend time with Russian chess grandmaster Garry Kasparov. Richard Guy and Ezra (Bud) Brown have produced a beautiful Carus Monograph in line with the original goals of the series, namely, to be accessible "not only to mathematicians, but to scientific workers and others with a modest mathematical background.". [Extracted from the article]

Symmetry elements and symmetry operations are sometimes mixed up and this makes the reading somewhat disturbing. For example, we read on page 22 that "the unit cell contains all symmetry elements of the crystal", which is clearly meaningless, the unit cell being finite but the crystal structure infinite (well, ignoring the surface of course). In the same way, the following page states that by translating the unit cell, "no additional symmetry element can appear", while of course infinitely many new symmetry elements arise, although all of the same type as those spanning the unit cell. Nodifferenceismadebetweenacrystallographic(type of) point group and the corresponding (geometric) crystal class. Unfortunately, some inconsistencies affect the presentation, like considering ½uv0 and [uv0] as two separate directions (page 113), or stating that "All symmetry elements are shown in Fig. [Extracted from the article]

He explored various classes of perfect graphs, graphs with non-empty intersections of longest paths, hereditary graph classes, Fibonacci and Lucas cubes, and attacked several related problems. In his paper [Marko Petkovsek, Letter graphs and well-quasi-order by induced subgraphs, Discrete Mathematics 244 (2002) 375-388] he introduced the notion of letter graphs, proved that the class of k-letter graphs is well-quasi-ordered by the induced subgraph relation, and that it has only finitely many minimal forbidden induced subgraphs. Marko Petkovsek was born in 1955 and died in 2023. [Extracted from the article]

Complexity science: an introduction: edited by M. A. Peletier, R. A. van Santen, and E. Steur, Singapore, World Scientific, 2019, 428 pp., £120.00 (hardback), ISBN 978-981-3239-59-3. Scope: edited book. However, the actual context, regarding "darwinism-evolution", is revealed (albeit unexpectedly) in the very first chapter by Dr Nicolis; in that chapter, he presents the algorithmic Complexity, a view of classical Information Theory suggested by Kolmogorov & Chaitin. [Extracted from the article]

Hofstad, R Random Graphs and Complex Networks. vol. 1. New York: Cambridge University Press; 2017. 321 pages; ISBN: 978-1-107-17287-6 [ABSTRACT FROM AUTHOR]

The monograph belongs to the Series in Operations Research, and presents the method and methodology of Analytic Hierarchy Process (AHP) - one of the most popular tools of the practical multiple-criteria decision making (MCDM). Additionally, the least squares and its modifications in the weighted least-square methods, weighted least worst squares method, weighted least absolute error method, logarithmic least-square method reducing to GMM solution, simple column sum and simple-scaled column sum methods, a cosine maximization method, and some others are described and compared by the so-called minimum violations criterion and conformity criterion. [Extracted from the article]

The article reviews the book "Graph Theory: A Problem Oriented Approach," by Daniel A. Marcus, edited by Jeffrey Nunemacher.

Reviews the book "Four Colours Suffice: How the Map Problem Was Solved," by Robin Wilson.

Reviews the non-fiction book "The Iconic Logic of Peirce's Graphs," by Sun-Joo Shin.

The article reviews the book "Probability on Graphs: Random Processes on Graphs and Lattices" by Geoffrey Grimmett.

This article focuses on the book "Theorie des Graphes et ses Applications," by Claude Berge. The term graph, the subject of this book has not the common connotation of a plot or curve, but refers to an established but esoteric mathematical sage. The geometric aspect of the above definition is not the heart of the matter, graphs can be symbolic diagrams of a rich variety of situations. The points can represent almost any kind of object and the arcs almost any type of interrelation between them. There is a chapter on transportation networks in the book. It includes Ford-Fulkerson algorithms and the theorems of Hoffman and Gale. Besides questions of optimizing transport and routing the same techniques are fitted to the problem of minimal covering, some combinational teasers, problems in a set theory, and linear programming are also given. The methods continue to solve problems in some subsequent chapters. In what are called simple graphs, the vertices are divided into two sets such that all arcs connect only members of one set with points of the other.

Highlights from the article: Each chapter covers a large number of topics on Monte Carlo simulation along with computer algorithms and a good number of exercises. Chapter 1 covers some introductory probability and statistics needed for subsequent chapters. Two alternative approaches called the variance minimization and the cross-entropy methods along with importance sampling algorithms in which paths are generated in a sequential manner are discussed in this chapter.

The article reviews the book "Graph Theory," by J. A. Bondy and U. S. R. Murty.

Why use pie charts to demonstrate basic principles of geometry when actual pies will do? [ABSTRACT FROM AUTHOR]

The article reviews the book "Graph Theory," third edition, by Reinhard Diestel.

Reviews the book 'A Beginner's Guide to Graph Theory,' by W.D. Wallis.

Reviews the book 'Graph Theory,' by Frank Harary.