<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
         xmlns="http://purl.org/rss/1.0/"
         xmlns:cc="http://web.resource.org/cc/"
         xmlns:content="http://purl.org/rss/1.0/modules/content/"
         xmlns:dc="http://purl.org/dc/elements/1.1/"
         xmlns:prism="http://prismstandard.org/namespaces/basic/2.0/">
   <channel rdf:about="https://epubs.siam.org/loi/siread?af=R">
      <title>Society for Industrial and Applied Mathematics: SIAM Review: Table of Contents</title>
      <description>Table of Contents for SIAM Review. List of articles from both the latest and ahead of print issues.</description>
      <link>https://epubs.siam.org/loi/siread?af=R</link>
      <dc:title>Society for Industrial and Applied Mathematics: SIAM Review: Table of Contents</dc:title>
      <dc:publisher>Society for Industrial and Applied Mathematics</dc:publisher>
      <dc:language>en-US</dc:language>
      <prism:publicationName>SIAM Review</prism:publicationName>
      <items>
         <rdf:Seq>
            <rdf:li rdf:resource="https://epubs.siam.org/doi/abs/10.1137/26M1862194?af=R"/>
            <rdf:li rdf:resource="https://epubs.siam.org/doi/abs/10.1137/24M165658X?af=R"/>
            <rdf:li rdf:resource="https://epubs.siam.org/doi/abs/10.1137/24M1715519?af=R"/>
            <rdf:li rdf:resource="https://epubs.siam.org/doi/abs/10.1137/26M1862200?af=R"/>
            <rdf:li rdf:resource="https://epubs.siam.org/doi/abs/10.1137/24M166944X?af=R"/>
            <rdf:li rdf:resource="https://epubs.siam.org/doi/abs/10.1137/26M1862236?af=R"/>
            <rdf:li rdf:resource="https://epubs.siam.org/doi/abs/10.1137/25M1827554?af=R"/>
            <rdf:li rdf:resource="https://epubs.siam.org/doi/abs/10.1137/26M1862212?af=R"/>
            <rdf:li rdf:resource="https://epubs.siam.org/doi/abs/10.1137/23M157377X?af=R"/>
            <rdf:li rdf:resource="https://epubs.siam.org/doi/abs/10.1137/24M1687650?af=R"/>
            <rdf:li rdf:resource="https://epubs.siam.org/doi/abs/10.1137/26M1862224?af=R"/>
            <rdf:li rdf:resource="https://epubs.siam.org/doi/abs/10.1137/25M1813883?af=R"/>
            <rdf:li rdf:resource="https://epubs.siam.org/doi/abs/10.1137/24M1640987?af=R"/>
            <rdf:li rdf:resource="https://epubs.siam.org/doi/abs/10.1137/24M1721384?af=R"/>
            <rdf:li rdf:resource="https://epubs.siam.org/doi/abs/10.1137/25M1800111?af=R"/>
            <rdf:li rdf:resource="https://epubs.siam.org/doi/abs/10.1137/25M1809501?af=R"/>
         </rdf:Seq>
      </items>
   </channel>
   <image rdf:about="https://epubs.siam.org/na101/home/literatum/publisher/siam/journals/covergifs/siread/cover.jpg">
      <title>SIAM Review</title>
      <url>https://epubs.siam.org/na101/home/literatum/publisher/siam/journals/covergifs/siread/cover.jpg</url>
      <link>https://epubs.siam.org/loi/siread?af=R</link>
   </image>
   <item rdf:about="https://epubs.siam.org/doi/abs/10.1137/26M1862194?af=R">
      <title>Survey and Review</title>
      <link>https://epubs.siam.org/doi/abs/10.1137/26M1862194?af=R</link>
      <content:encoded>SIAM Review, &lt;a href="https://epubs.siam.org/toc/siread/68/2"&gt;Volume 68, Issue 2&lt;/a&gt;, Page 215-215, June 2026. &lt;br/&gt;</content:encoded>
      <description>SIAM Review, Volume 68, Issue 2, Page 215-215, June 2026. &lt;br/&gt;&lt;p&gt;&lt;img src="https://epubs.siam.org/na101/home/literatum/publisher/siam/journals/covergifs/siread/cover.jpg" alt-text="cover image"/&gt;&lt;/p&gt;</description>
      <dc:title>Survey and Review</dc:title>
      <dc:identifier>10.1137/26M1862194</dc:identifier>
      <dc:source>SIAM Review</dc:source>
      <dc:date>2026-05-13T07:00:00Z</dc:date>
      <dc:rights>© 2026 Society for Industrial and Applied Mathematics</dc:rights>
      <dc:creator>Marlis Hochbruck</dc:creator>
      <prism:publicationName>Survey and Review</prism:publicationName>
      <prism:volume>68</prism:volume>
      <prism:number>2</prism:number>
      <prism:startingPage>215</prism:startingPage>
      <prism:endingPage>215</prism:endingPage>
      <prism:coverDate>2026-06-30T07:00:00Z</prism:coverDate>
      <prism:coverDisplayDate>2026-06-30T07:00:00Z</prism:coverDisplayDate>
      <prism:doi>10.1137/26M1862194</prism:doi>
      <prism:url>https://epubs.siam.org/doi/abs/10.1137/26M1862194?af=R</prism:url>
      <prism:copyright>© 2026 Society for Industrial and Applied Mathematics</prism:copyright>
   </item>
   <item rdf:about="https://epubs.siam.org/doi/abs/10.1137/24M165658X?af=R">
      <title>Localized Patterns</title>
      <link>https://epubs.siam.org/doi/abs/10.1137/24M165658X?af=R</link>
      <content:encoded>SIAM Review, &lt;a href="https://epubs.siam.org/toc/siread/68/2"&gt;Volume 68, Issue 2&lt;/a&gt;, Page 217-292, June 2026. &lt;br/&gt; Abstract.Localized patterns are coherent structures embedded in a quiescent state and occur in both discrete and continuous media across a wide range of applications. While it is well-understood how domain-covering patterns (for example, stripes and hexagons) emerge from a pattern-forming/Turing instability, analyzing the emergence of their localized counterparts remains a significant challenge. There has been considerable progress in studying localized patterns over the past few decades, often by employing innovative mathematical tools and techniques. In particular, the study of localized pattern formation has benefited greatly from numerical techniques; the continuing advancement in computational power has helped to both identify new types of pattern and further our understanding of their behavior. We review recent advances regarding the complex behavior of localized patterns and the mathematical tools that have been developed to understand them, covering various topics from spatial dynamics, exponential asymptotics, and numerical methods. We observe that the mathematical understanding of localized patterns decreases as the spatial dimension increases, thus providing significant open problems that will form the basis for future investigations. </content:encoded>
      <description>SIAM Review, Volume 68, Issue 2, Page 217-292, June 2026. &lt;br/&gt; Abstract.Localized patterns are coherent structures embedded in a quiescent state and occur in both discrete and continuous media across a wide range of applications. While it is well-understood how domain-covering patterns (for example, stripes and hexagons) emerge from a pattern-forming/Turing instability, analyzing the emergence of their localized counterparts remains a significant challenge. There has been considerable progress in studying localized patterns over the past few decades, often by employing innovative mathematical tools and techniques. In particular, the study of localized pattern formation has benefited greatly from numerical techniques; the continuing advancement in computational power has helped to both identify new types of pattern and further our understanding of their behavior. We review recent advances regarding the complex behavior of localized patterns and the mathematical tools that have been developed to understand them, covering various topics from spatial dynamics, exponential asymptotics, and numerical methods. We observe that the mathematical understanding of localized patterns decreases as the spatial dimension increases, thus providing significant open problems that will form the basis for future investigations. &lt;p&gt;&lt;img src="https://epubs.siam.org/na101/home/literatum/publisher/siam/journals/covergifs/siread/cover.jpg" alt-text="cover image"/&gt;&lt;/p&gt;</description>
      <dc:title>Localized Patterns</dc:title>
      <dc:identifier>10.1137/24M165658X</dc:identifier>
      <dc:source>SIAM Review</dc:source>
      <dc:date>2026-05-13T07:00:00Z</dc:date>
      <dc:rights>© 2026 Society for Industrial and Applied Mathematics</dc:rights>
      <dc:creator>Jason J. Bramburger</dc:creator>
      <dc:creator>Dan J. Hill</dc:creator>
      <dc:creator>David J. B. Lloyd</dc:creator>
      <prism:publicationName>Localized Patterns</prism:publicationName>
      <prism:volume>68</prism:volume>
      <prism:number>2</prism:number>
      <prism:startingPage>217</prism:startingPage>
      <prism:endingPage>292</prism:endingPage>
      <prism:coverDate>2026-06-30T07:00:00Z</prism:coverDate>
      <prism:coverDisplayDate>2026-06-30T07:00:00Z</prism:coverDisplayDate>
      <prism:doi>10.1137/24M165658X</prism:doi>
      <prism:url>https://epubs.siam.org/doi/abs/10.1137/24M165658X?af=R</prism:url>
      <prism:copyright>© 2026 Society for Industrial and Applied Mathematics</prism:copyright>
   </item>
   <item rdf:about="https://epubs.siam.org/doi/abs/10.1137/24M1715519?af=R">
      <title>Gradient Flow Equations for Deep Linear Neural Networks: A Survey from a Network Perspective</title>
      <link>https://epubs.siam.org/doi/abs/10.1137/24M1715519?af=R</link>
      <content:encoded>SIAM Review, &lt;a href="https://epubs.siam.org/toc/siread/68/2"&gt;Volume 68, Issue 2&lt;/a&gt;, Page 293-345, June 2026. &lt;br/&gt; Abstract.This paper surveys recent progress in understanding the dynamics and loss landscape of the gradient flow equations associated with deep linear neural networks, i.e., the gradient descent training dynamics (in the limit when the step size goes to 0) of deep neural networks missing the activation functions and subject to quadratic loss functions. When formulated in terms of the adjacency matrix of the neural network, as is done in this paper, these gradient flow equations form a class of converging matrix ODEs which is nilpotent, polynomial, isospectral, and with conservation laws. A detailed description of the loss landscape shows that it is described in detail and is characterized by infinitely-many global minima and saddle points, both strict and nonstrict, but that it lacks local minima and maxima. The loss function itself is a positive semidefinite Lyapunov function for the gradient flow, and its level sets are unbounded invariant sets of critical points with critical values that correspond to the amount of singular values of the input-output data learnt by the gradient along a certain trajectory. The adjacency matrix representation we use in the paper allows us to highlight the existence of a quotient space structure in which each critical value of the loss function is represented only once, while all other critical points with the same critical value belong to the fiber associated to the quotient space. It also allows us to easily determine stable and unstable submanifolds at the saddle points, even when the Hessian fails to obtain them. </content:encoded>
      <description>SIAM Review, Volume 68, Issue 2, Page 293-345, June 2026. &lt;br/&gt; Abstract.This paper surveys recent progress in understanding the dynamics and loss landscape of the gradient flow equations associated with deep linear neural networks, i.e., the gradient descent training dynamics (in the limit when the step size goes to 0) of deep neural networks missing the activation functions and subject to quadratic loss functions. When formulated in terms of the adjacency matrix of the neural network, as is done in this paper, these gradient flow equations form a class of converging matrix ODEs which is nilpotent, polynomial, isospectral, and with conservation laws. A detailed description of the loss landscape shows that it is described in detail and is characterized by infinitely-many global minima and saddle points, both strict and nonstrict, but that it lacks local minima and maxima. The loss function itself is a positive semidefinite Lyapunov function for the gradient flow, and its level sets are unbounded invariant sets of critical points with critical values that correspond to the amount of singular values of the input-output data learnt by the gradient along a certain trajectory. The adjacency matrix representation we use in the paper allows us to highlight the existence of a quotient space structure in which each critical value of the loss function is represented only once, while all other critical points with the same critical value belong to the fiber associated to the quotient space. It also allows us to easily determine stable and unstable submanifolds at the saddle points, even when the Hessian fails to obtain them. &lt;p&gt;&lt;img src="https://epubs.siam.org/na101/home/literatum/publisher/siam/journals/covergifs/siread/cover.jpg" alt-text="cover image"/&gt;&lt;/p&gt;</description>
      <dc:title>Gradient Flow Equations for Deep Linear Neural Networks: A Survey from a Network Perspective</dc:title>
      <dc:identifier>10.1137/24M1715519</dc:identifier>
      <dc:source>SIAM Review</dc:source>
      <dc:date>2026-05-13T07:00:00Z</dc:date>
      <dc:rights>© 2026 Society for Industrial and Applied Mathematics</dc:rights>
      <dc:creator>Joel Wendin</dc:creator>
      <dc:creator>Claudio Altafini</dc:creator>
      <prism:publicationName>Gradient Flow Equations for Deep Linear Neural Networks: A Survey from a Network Perspective</prism:publicationName>
      <prism:volume>68</prism:volume>
      <prism:number>2</prism:number>
      <prism:startingPage>293</prism:startingPage>
      <prism:endingPage>345</prism:endingPage>
      <prism:coverDate>2026-06-30T07:00:00Z</prism:coverDate>
      <prism:coverDisplayDate>2026-06-30T07:00:00Z</prism:coverDisplayDate>
      <prism:doi>10.1137/24M1715519</prism:doi>
      <prism:url>https://epubs.siam.org/doi/abs/10.1137/24M1715519?af=R</prism:url>
      <prism:copyright>© 2026 Society for Industrial and Applied Mathematics</prism:copyright>
   </item>
   <item rdf:about="https://epubs.siam.org/doi/abs/10.1137/26M1862200?af=R">
      <title>Research Spotlights</title>
      <link>https://epubs.siam.org/doi/abs/10.1137/26M1862200?af=R</link>
      <content:encoded>SIAM Review, &lt;a href="https://epubs.siam.org/toc/siread/68/2"&gt;Volume 68, Issue 2&lt;/a&gt;, Page 347-347, June 2026. &lt;br/&gt;</content:encoded>
      <description>SIAM Review, Volume 68, Issue 2, Page 347-347, June 2026. &lt;br/&gt;&lt;p&gt;&lt;img src="https://epubs.siam.org/na101/home/literatum/publisher/siam/journals/covergifs/siread/cover.jpg" alt-text="cover image"/&gt;&lt;/p&gt;</description>
      <dc:title>Research Spotlights</dc:title>
      <dc:identifier>10.1137/26M1862200</dc:identifier>
      <dc:source>SIAM Review</dc:source>
      <dc:date>2026-05-13T07:00:00Z</dc:date>
      <dc:rights>© 2026 Society for Industrial and Applied Mathematics</dc:rights>
      <dc:creator>Stefan M. Wild</dc:creator>
      <prism:publicationName>Research Spotlights</prism:publicationName>
      <prism:volume>68</prism:volume>
      <prism:number>2</prism:number>
      <prism:startingPage>347</prism:startingPage>
      <prism:endingPage>347</prism:endingPage>
      <prism:coverDate>2026-06-30T07:00:00Z</prism:coverDate>
      <prism:coverDisplayDate>2026-06-30T07:00:00Z</prism:coverDisplayDate>
      <prism:doi>10.1137/26M1862200</prism:doi>
      <prism:url>https://epubs.siam.org/doi/abs/10.1137/26M1862200?af=R</prism:url>
      <prism:copyright>© 2026 Society for Industrial and Applied Mathematics</prism:copyright>
   </item>
   <item rdf:about="https://epubs.siam.org/doi/abs/10.1137/24M166944X?af=R">
      <title>Spanning Trees and Redistricting: New Methods for Sampling and Validation</title>
      <link>https://epubs.siam.org/doi/abs/10.1137/24M166944X?af=R</link>
      <content:encoded>SIAM Review, &lt;a href="https://epubs.siam.org/toc/siread/68/2"&gt;Volume 68, Issue 2&lt;/a&gt;, Page 349-381, June 2026. &lt;br/&gt; Abstract.Deciding whether a political districting plan was distorted by a hidden agenda, or whether it dilutes the voting power of some group, requires a neutral baseline for comparison. Remarkably, all nine U.S. Supreme Court justices have now signed on to decisions finding that computational methods can provide key evidence. Today, the leading approaches to the benchmarking of districting plans are based on the use of spanning trees for sampling graph partitions. We present a new reversible recombination algorithm and rigorously prove its fundamental properties. Furthermore, we argue for a canonical sampling distribution called the spanning tree distribution that is well adapted to redistricting and provides a principled foundation for comparing and validating methods. Together with a highly efficient (and open-source) implementation that can generate and handle large datasets, this work provides the most powerful null model to date for the gerrymandering problem, meeting an urgent democratic challenge with sound scientific methodology. </content:encoded>
      <description>SIAM Review, Volume 68, Issue 2, Page 349-381, June 2026. &lt;br/&gt; Abstract.Deciding whether a political districting plan was distorted by a hidden agenda, or whether it dilutes the voting power of some group, requires a neutral baseline for comparison. Remarkably, all nine U.S. Supreme Court justices have now signed on to decisions finding that computational methods can provide key evidence. Today, the leading approaches to the benchmarking of districting plans are based on the use of spanning trees for sampling graph partitions. We present a new reversible recombination algorithm and rigorously prove its fundamental properties. Furthermore, we argue for a canonical sampling distribution called the spanning tree distribution that is well adapted to redistricting and provides a principled foundation for comparing and validating methods. Together with a highly efficient (and open-source) implementation that can generate and handle large datasets, this work provides the most powerful null model to date for the gerrymandering problem, meeting an urgent democratic challenge with sound scientific methodology. &lt;p&gt;&lt;img src="https://epubs.siam.org/na101/home/literatum/publisher/siam/journals/covergifs/siread/cover.jpg" alt-text="cover image"/&gt;&lt;/p&gt;</description>
      <dc:title>Spanning Trees and Redistricting: New Methods for Sampling and Validation</dc:title>
      <dc:identifier>10.1137/24M166944X</dc:identifier>
      <dc:source>SIAM Review</dc:source>
      <dc:date>2026-05-13T07:00:00Z</dc:date>
      <dc:rights>© 2026 Society for Industrial and Applied Mathematics</dc:rights>
      <dc:creator>Sarah Cannon</dc:creator>
      <dc:creator>Moon Duchin</dc:creator>
      <dc:creator>Dana Randall</dc:creator>
      <dc:creator>Parker Rule</dc:creator>
      <prism:publicationName>Spanning Trees and Redistricting: New Methods for Sampling and Validation</prism:publicationName>
      <prism:volume>68</prism:volume>
      <prism:number>2</prism:number>
      <prism:startingPage>349</prism:startingPage>
      <prism:endingPage>381</prism:endingPage>
      <prism:coverDate>2026-06-30T07:00:00Z</prism:coverDate>
      <prism:coverDisplayDate>2026-06-30T07:00:00Z</prism:coverDisplayDate>
      <prism:doi>10.1137/24M166944X</prism:doi>
      <prism:url>https://epubs.siam.org/doi/abs/10.1137/24M166944X?af=R</prism:url>
      <prism:copyright>© 2026 Society for Industrial and Applied Mathematics</prism:copyright>
   </item>
   <item rdf:about="https://epubs.siam.org/doi/abs/10.1137/26M1862236?af=R">
      <title>SIGEST</title>
      <link>https://epubs.siam.org/doi/abs/10.1137/26M1862236?af=R</link>
      <content:encoded>SIAM Review, &lt;a href="https://epubs.siam.org/toc/siread/68/2"&gt;Volume 68, Issue 2&lt;/a&gt;, Page 383-383, June 2026. &lt;br/&gt;</content:encoded>
      <description>SIAM Review, Volume 68, Issue 2, Page 383-383, June 2026. &lt;br/&gt;&lt;p&gt;&lt;img src="https://epubs.siam.org/na101/home/literatum/publisher/siam/journals/covergifs/siread/cover.jpg" alt-text="cover image"/&gt;&lt;/p&gt;</description>
      <dc:title>SIGEST</dc:title>
      <dc:identifier>10.1137/26M1862236</dc:identifier>
      <dc:source>SIAM Review</dc:source>
      <dc:date>2026-05-13T07:00:00Z</dc:date>
      <dc:rights>© 2026 Society for Industrial and Applied Mathematics</dc:rights>
      <dc:creator>The Editors</dc:creator>
      <prism:publicationName>SIGEST</prism:publicationName>
      <prism:volume>68</prism:volume>
      <prism:number>2</prism:number>
      <prism:startingPage>383</prism:startingPage>
      <prism:endingPage>383</prism:endingPage>
      <prism:coverDate>2026-06-30T07:00:00Z</prism:coverDate>
      <prism:coverDisplayDate>2026-06-30T07:00:00Z</prism:coverDisplayDate>
      <prism:doi>10.1137/26M1862236</prism:doi>
      <prism:url>https://epubs.siam.org/doi/abs/10.1137/26M1862236?af=R</prism:url>
      <prism:copyright>© 2026 Society for Industrial and Applied Mathematics</prism:copyright>
   </item>
   <item rdf:about="https://epubs.siam.org/doi/abs/10.1137/25M1827554?af=R">
      <title>Bounds on Small Ramsey Numbers by Semidefinite Programming</title>
      <link>https://epubs.siam.org/doi/abs/10.1137/25M1827554?af=R</link>
      <content:encoded>SIAM Review, &lt;a href="https://epubs.siam.org/toc/siread/68/2"&gt;Volume 68, Issue 2&lt;/a&gt;, Page 385-403, June 2026. &lt;br/&gt; Abstract.Finding exact Ramsey numbers is a problem typically restricted to relatively small graphs. The flag algebra method introduced by Razborov in 2007 was developed to find asymptotic results for very large graphs, so it seems that the method should not be suitable for finding small Ramsey numbers. But this intuition is wrong, and we will develop a technique to do just that in this paper. We find new upper bounds for many small graph and hypergraph Ramsey numbers. As a result, we prove several exact values. The main power of the method relies on utilizing semidefinite programming to find certificates that are sums of squares. We hope that this technique will be adapted to address other questions for smaller graphs with the flag algebra method. </content:encoded>
      <description>SIAM Review, Volume 68, Issue 2, Page 385-403, June 2026. &lt;br/&gt; Abstract.Finding exact Ramsey numbers is a problem typically restricted to relatively small graphs. The flag algebra method introduced by Razborov in 2007 was developed to find asymptotic results for very large graphs, so it seems that the method should not be suitable for finding small Ramsey numbers. But this intuition is wrong, and we will develop a technique to do just that in this paper. We find new upper bounds for many small graph and hypergraph Ramsey numbers. As a result, we prove several exact values. The main power of the method relies on utilizing semidefinite programming to find certificates that are sums of squares. We hope that this technique will be adapted to address other questions for smaller graphs with the flag algebra method. &lt;p&gt;&lt;img src="https://epubs.siam.org/na101/home/literatum/publisher/siam/journals/covergifs/siread/cover.jpg" alt-text="cover image"/&gt;&lt;/p&gt;</description>
      <dc:title>Bounds on Small Ramsey Numbers by Semidefinite Programming</dc:title>
      <dc:identifier>10.1137/25M1827554</dc:identifier>
      <dc:source>SIAM Review</dc:source>
      <dc:date>2026-05-13T07:00:00Z</dc:date>
      <dc:rights>© 2026 Society for Industrial and Applied Mathematics</dc:rights>
      <dc:creator>Bernard Lidický</dc:creator>
      <dc:creator>Florian Pfender</dc:creator>
      <prism:publicationName>Bounds on Small Ramsey Numbers by Semidefinite Programming</prism:publicationName>
      <prism:volume>68</prism:volume>
      <prism:number>2</prism:number>
      <prism:startingPage>385</prism:startingPage>
      <prism:endingPage>403</prism:endingPage>
      <prism:coverDate>2026-06-30T07:00:00Z</prism:coverDate>
      <prism:coverDisplayDate>2026-06-30T07:00:00Z</prism:coverDisplayDate>
      <prism:doi>10.1137/25M1827554</prism:doi>
      <prism:url>https://epubs.siam.org/doi/abs/10.1137/25M1827554?af=R</prism:url>
      <prism:copyright>© 2026 Society for Industrial and Applied Mathematics</prism:copyright>
   </item>
   <item rdf:about="https://epubs.siam.org/doi/abs/10.1137/26M1862212?af=R">
      <title>Education</title>
      <link>https://epubs.siam.org/doi/abs/10.1137/26M1862212?af=R</link>
      <content:encoded>SIAM Review, &lt;a href="https://epubs.siam.org/toc/siread/68/2"&gt;Volume 68, Issue 2&lt;/a&gt;, Page 405-405, June 2026. &lt;br/&gt;</content:encoded>
      <description>SIAM Review, Volume 68, Issue 2, Page 405-405, June 2026. &lt;br/&gt;&lt;p&gt;&lt;img src="https://epubs.siam.org/na101/home/literatum/publisher/siam/journals/covergifs/siread/cover.jpg" alt-text="cover image"/&gt;&lt;/p&gt;</description>
      <dc:title>Education</dc:title>
      <dc:identifier>10.1137/26M1862212</dc:identifier>
      <dc:source>SIAM Review</dc:source>
      <dc:date>2026-05-13T07:00:00Z</dc:date>
      <dc:rights>© 2026 Society for Industrial and Applied Mathematics</dc:rights>
      <dc:creator>Hélène Frankowska</dc:creator>
      <prism:publicationName>Education</prism:publicationName>
      <prism:volume>68</prism:volume>
      <prism:number>2</prism:number>
      <prism:startingPage>405</prism:startingPage>
      <prism:endingPage>405</prism:endingPage>
      <prism:coverDate>2026-06-30T07:00:00Z</prism:coverDate>
      <prism:coverDisplayDate>2026-06-30T07:00:00Z</prism:coverDisplayDate>
      <prism:doi>10.1137/26M1862212</prism:doi>
      <prism:url>https://epubs.siam.org/doi/abs/10.1137/26M1862212?af=R</prism:url>
      <prism:copyright>© 2026 Society for Industrial and Applied Mathematics</prism:copyright>
   </item>
   <item rdf:about="https://epubs.siam.org/doi/abs/10.1137/23M157377X?af=R">
      <title>Tauberian Identities and Suspended Falls: A Wile E. Coyote Time Lag in the Fall of Stretched Elastic Bodies</title>
      <link>https://epubs.siam.org/doi/abs/10.1137/23M157377X?af=R</link>
      <content:encoded>SIAM Review, &lt;a href="https://epubs.siam.org/toc/siread/68/2"&gt;Volume 68, Issue 2&lt;/a&gt;, Page 407-422, June 2026. &lt;br/&gt; Abstract.The application of the motion of a vertically suspended mass-spring system released under tension is studied, focusing upon the delay timescale for the bottom mass fall as a function of the spring constants and masses. This “hang-time,” reminiscent of the Coyote and Road Runner cartoons, is quantified using the far field asymptotic expansion of the bottom mass’s Laplace transform. These asymptotics are connected to the short time mass dynamics through Tauberian identities and explicit residue calculations. It is shown, perhaps paradoxically, that this delay timescale is maximized in the large mass limit of the top “boulder.” Experiments are presented and compared with the theoretical predictions. This system is an exciting example for the teaching of mass-spring dynamics in classes on ordinary differential equations and does not require any normal mode calculations for these predictions. </content:encoded>
      <description>SIAM Review, Volume 68, Issue 2, Page 407-422, June 2026. &lt;br/&gt; Abstract.The application of the motion of a vertically suspended mass-spring system released under tension is studied, focusing upon the delay timescale for the bottom mass fall as a function of the spring constants and masses. This “hang-time,” reminiscent of the Coyote and Road Runner cartoons, is quantified using the far field asymptotic expansion of the bottom mass’s Laplace transform. These asymptotics are connected to the short time mass dynamics through Tauberian identities and explicit residue calculations. It is shown, perhaps paradoxically, that this delay timescale is maximized in the large mass limit of the top “boulder.” Experiments are presented and compared with the theoretical predictions. This system is an exciting example for the teaching of mass-spring dynamics in classes on ordinary differential equations and does not require any normal mode calculations for these predictions. &lt;p&gt;&lt;img src="https://epubs.siam.org/na101/home/literatum/publisher/siam/journals/covergifs/siread/cover.jpg" alt-text="cover image"/&gt;&lt;/p&gt;</description>
      <dc:title>Tauberian Identities and Suspended Falls: A Wile E. Coyote Time Lag in the Fall of Stretched Elastic Bodies</dc:title>
      <dc:identifier>10.1137/23M157377X</dc:identifier>
      <dc:source>SIAM Review</dc:source>
      <dc:date>2026-05-13T07:00:00Z</dc:date>
      <dc:rights>© 2026 Society for Industrial and Applied Mathematics</dc:rights>
      <dc:creator>Roberto Camassa</dc:creator>
      <dc:creator>Richard M. McLaughlin</dc:creator>
      <prism:publicationName>Tauberian Identities and Suspended Falls: A Wile E. Coyote Time Lag in the Fall of Stretched Elastic Bodies</prism:publicationName>
      <prism:volume>68</prism:volume>
      <prism:number>2</prism:number>
      <prism:startingPage>407</prism:startingPage>
      <prism:endingPage>422</prism:endingPage>
      <prism:coverDate>2026-06-30T07:00:00Z</prism:coverDate>
      <prism:coverDisplayDate>2026-06-30T07:00:00Z</prism:coverDisplayDate>
      <prism:doi>10.1137/23M157377X</prism:doi>
      <prism:url>https://epubs.siam.org/doi/abs/10.1137/23M157377X?af=R</prism:url>
      <prism:copyright>© 2026 Society for Industrial and Applied Mathematics</prism:copyright>
   </item>
   <item rdf:about="https://epubs.siam.org/doi/abs/10.1137/24M1687650?af=R">
      <title>A Mathematical Model for Nordic Skiing</title>
      <link>https://epubs.siam.org/doi/abs/10.1137/24M1687650?af=R</link>
      <content:encoded>SIAM Review, &lt;a href="https://epubs.siam.org/toc/siread/68/2"&gt;Volume 68, Issue 2&lt;/a&gt;, Page 423-455, June 2026. &lt;br/&gt; Abstract.Nordic skiing provides fascinating opportunities for mathematical modeling studies that exploit methods and insights from physics, applied mathematics, data analysis, scientific computing, and sports science. A typical ski course winds over varied terrain with frequent changes in elevation and direction, and so its geometry is naturally described by a three-dimensional space curve. The skier travels along a course under the influence of various forces, and their dynamics can be described using a nonlinear system of ordinary differential equations (ODEs) that are derived from Newton’s laws of motion. We develop an algorithm for solving the governing equations that combines Hermite spline interpolation, numerical quadrature, and a high-order ODE solver. Numerical simulations are compared with measurements of skiers on actual courses to demonstrate the effectiveness of the model. Throughout, we aim to illustrate how elementary concepts from undergraduate courses in calculus and scientific computing can be applied to the study of real problems in sport, which we hope will provide stimulating examples for both instructors and students. At the same time, we demonstrate how these concepts are capable of providing novel insights into skiing that should also be of interest to sport scientists. </content:encoded>
      <description>SIAM Review, Volume 68, Issue 2, Page 423-455, June 2026. &lt;br/&gt; Abstract.Nordic skiing provides fascinating opportunities for mathematical modeling studies that exploit methods and insights from physics, applied mathematics, data analysis, scientific computing, and sports science. A typical ski course winds over varied terrain with frequent changes in elevation and direction, and so its geometry is naturally described by a three-dimensional space curve. The skier travels along a course under the influence of various forces, and their dynamics can be described using a nonlinear system of ordinary differential equations (ODEs) that are derived from Newton’s laws of motion. We develop an algorithm for solving the governing equations that combines Hermite spline interpolation, numerical quadrature, and a high-order ODE solver. Numerical simulations are compared with measurements of skiers on actual courses to demonstrate the effectiveness of the model. Throughout, we aim to illustrate how elementary concepts from undergraduate courses in calculus and scientific computing can be applied to the study of real problems in sport, which we hope will provide stimulating examples for both instructors and students. At the same time, we demonstrate how these concepts are capable of providing novel insights into skiing that should also be of interest to sport scientists. &lt;p&gt;&lt;img src="https://epubs.siam.org/na101/home/literatum/publisher/siam/journals/covergifs/siread/cover.jpg" alt-text="cover image"/&gt;&lt;/p&gt;</description>
      <dc:title>A Mathematical Model for Nordic Skiing</dc:title>
      <dc:identifier>10.1137/24M1687650</dc:identifier>
      <dc:source>SIAM Review</dc:source>
      <dc:date>2026-05-13T07:00:00Z</dc:date>
      <dc:rights>© 2026 Society for Industrial and Applied Mathematics</dc:rights>
      <dc:creator>Jane Shaw MacDonald</dc:creator>
      <dc:creator>Rafael Odoñez Cardales</dc:creator>
      <dc:creator>John M. Stockie</dc:creator>
      <prism:publicationName>A Mathematical Model for Nordic Skiing</prism:publicationName>
      <prism:volume>68</prism:volume>
      <prism:number>2</prism:number>
      <prism:startingPage>423</prism:startingPage>
      <prism:endingPage>455</prism:endingPage>
      <prism:coverDate>2026-06-30T07:00:00Z</prism:coverDate>
      <prism:coverDisplayDate>2026-06-30T07:00:00Z</prism:coverDisplayDate>
      <prism:doi>10.1137/24M1687650</prism:doi>
      <prism:url>https://epubs.siam.org/doi/abs/10.1137/24M1687650?af=R</prism:url>
      <prism:copyright>© 2026 Society for Industrial and Applied Mathematics</prism:copyright>
   </item>
   <item rdf:about="https://epubs.siam.org/doi/abs/10.1137/26M1862224?af=R">
      <title>Book Reviews</title>
      <link>https://epubs.siam.org/doi/abs/10.1137/26M1862224?af=R</link>
      <content:encoded>SIAM Review, &lt;a href="https://epubs.siam.org/toc/siread/68/2"&gt;Volume 68, Issue 2&lt;/a&gt;, Page 457-458, June 2026. &lt;br/&gt;</content:encoded>
      <description>SIAM Review, Volume 68, Issue 2, Page 457-458, June 2026. &lt;br/&gt;&lt;p&gt;&lt;img src="https://epubs.siam.org/na101/home/literatum/publisher/siam/journals/covergifs/siread/cover.jpg" alt-text="cover image"/&gt;&lt;/p&gt;</description>
      <dc:title>Book Reviews</dc:title>
      <dc:identifier>10.1137/26M1862224</dc:identifier>
      <dc:source>SIAM Review</dc:source>
      <dc:date>2026-05-13T07:00:00Z</dc:date>
      <dc:rights>© 2026 Society for Industrial and Applied Mathematics</dc:rights>
      <dc:creator>Anita T. Layton</dc:creator>
      <prism:publicationName>Book Reviews</prism:publicationName>
      <prism:volume>68</prism:volume>
      <prism:number>2</prism:number>
      <prism:startingPage>457</prism:startingPage>
      <prism:endingPage>458</prism:endingPage>
      <prism:coverDate>2026-06-30T07:00:00Z</prism:coverDate>
      <prism:coverDisplayDate>2026-06-30T07:00:00Z</prism:coverDisplayDate>
      <prism:doi>10.1137/26M1862224</prism:doi>
      <prism:url>https://epubs.siam.org/doi/abs/10.1137/26M1862224?af=R</prism:url>
      <prism:copyright>© 2026 Society for Industrial and Applied Mathematics</prism:copyright>
   </item>
   <item rdf:about="https://epubs.siam.org/doi/abs/10.1137/25M1813883?af=R">
      <title>Featured Review:;  Probability Theory: The Logic of Science</title>
      <link>https://epubs.siam.org/doi/abs/10.1137/25M1813883?af=R</link>
      <content:encoded>SIAM Review, &lt;a href="https://epubs.siam.org/toc/siread/68/2"&gt;Volume 68, Issue 2&lt;/a&gt;, Page 459-462, June 2026. &lt;br/&gt; Probability Theory: The Logic of Science by E. T. Jaynes is a highly ambitious, unusual, and personal book. Its goal is no less than to lay the foundation for how to reason under uncertainty, not only in science, but generally. Inspired by Polya’s Mathematics and Plausible Reasoning, throughout his career Jaynes pursued a program of understanding the rules of plausible reasoning that would be broadly applicable across domains. Starting not from axioms, but from the “desiderata,” or desirable properties, that one would like to have in a quantitative system of reasoning, Jaynes arrives at the traditional rules of probability theory, namely, the sum and product rules. In so doing, he argues that probability theory is not constrained to any discipline, but constitutes a widely applicable extension of traditional logical systems, wherein statements have truth values that have a quantifiable uncertainty. Jaynes viewed probability theory as a kind of “theory of everything” for reasoning. The book contains an extensive and impressive collection of examples and discussions aimed at underlining this idea and showing the ways in which it aligns or not with traditional views.  </content:encoded>
      <description>SIAM Review, Volume 68, Issue 2, Page 459-462, June 2026. &lt;br/&gt; Probability Theory: The Logic of Science by E. T. Jaynes is a highly ambitious, unusual, and personal book. Its goal is no less than to lay the foundation for how to reason under uncertainty, not only in science, but generally. Inspired by Polya’s Mathematics and Plausible Reasoning, throughout his career Jaynes pursued a program of understanding the rules of plausible reasoning that would be broadly applicable across domains. Starting not from axioms, but from the “desiderata,” or desirable properties, that one would like to have in a quantitative system of reasoning, Jaynes arrives at the traditional rules of probability theory, namely, the sum and product rules. In so doing, he argues that probability theory is not constrained to any discipline, but constitutes a widely applicable extension of traditional logical systems, wherein statements have truth values that have a quantifiable uncertainty. Jaynes viewed probability theory as a kind of “theory of everything” for reasoning. The book contains an extensive and impressive collection of examples and discussions aimed at underlining this idea and showing the ways in which it aligns or not with traditional views.  &lt;p&gt;&lt;img src="https://epubs.siam.org/na101/home/literatum/publisher/siam/journals/covergifs/siread/cover.jpg" alt-text="cover image"/&gt;&lt;/p&gt;</description>
      <dc:title>Featured Review:;  Probability Theory: The Logic of Science</dc:title>
      <dc:identifier>10.1137/25M1813883</dc:identifier>
      <dc:source>SIAM Review</dc:source>
      <dc:date>2026-05-13T07:00:00Z</dc:date>
      <dc:rights>© 2026 Society for Industrial and Applied Mathematics</dc:rights>
      <dc:creator>Krešimir Josić</dc:creator>
      <dc:creator>Michael Buice</dc:creator>
      <prism:publicationName>Featured Review:;  Probability Theory: The Logic of Science</prism:publicationName>
      <prism:volume>68</prism:volume>
      <prism:number>2</prism:number>
      <prism:startingPage>459</prism:startingPage>
      <prism:endingPage>462</prism:endingPage>
      <prism:coverDate>2026-06-30T07:00:00Z</prism:coverDate>
      <prism:coverDisplayDate>2026-06-30T07:00:00Z</prism:coverDisplayDate>
      <prism:doi>10.1137/25M1813883</prism:doi>
      <prism:url>https://epubs.siam.org/doi/abs/10.1137/25M1813883?af=R</prism:url>
      <prism:copyright>© 2026 Society for Industrial and Applied Mathematics</prism:copyright>
   </item>
   <item rdf:about="https://epubs.siam.org/doi/abs/10.1137/24M1640987?af=R">
      <title>Book Review:;  Applied Statistical Learning: With Case Studies in Stata</title>
      <link>https://epubs.siam.org/doi/abs/10.1137/24M1640987?af=R</link>
      <content:encoded>SIAM Review, &lt;a href="https://epubs.siam.org/toc/siread/68/2"&gt;Volume 68, Issue 2&lt;/a&gt;, Page 462-463, June 2026. &lt;br/&gt; Statistical learning has become an essential component across a wide range of research fields. Among the many textbooks that lay the foundations of theory and practice, Matthias Schonlau’s Applied Statistical Learning: With Case Studies in Stata is a valuable addition—not only for undergraduate and graduate students and course instructors, but also for applied researchers, particularly those who use Stata for data analysis.  </content:encoded>
      <description>SIAM Review, Volume 68, Issue 2, Page 462-463, June 2026. &lt;br/&gt; Statistical learning has become an essential component across a wide range of research fields. Among the many textbooks that lay the foundations of theory and practice, Matthias Schonlau’s Applied Statistical Learning: With Case Studies in Stata is a valuable addition—not only for undergraduate and graduate students and course instructors, but also for applied researchers, particularly those who use Stata for data analysis.  &lt;p&gt;&lt;img src="https://epubs.siam.org/na101/home/literatum/publisher/siam/journals/covergifs/siread/cover.jpg" alt-text="cover image"/&gt;&lt;/p&gt;</description>
      <dc:title>Book Review:;  Applied Statistical Learning: With Case Studies in Stata</dc:title>
      <dc:identifier>10.1137/24M1640987</dc:identifier>
      <dc:source>SIAM Review</dc:source>
      <dc:date>2026-05-13T07:00:00Z</dc:date>
      <dc:rights>© 2026 Society for Industrial and Applied Mathematics</dc:rights>
      <dc:creator>Hyukjun (Jay) Gweon</dc:creator>
      <prism:publicationName>Book Review:;  Applied Statistical Learning: With Case Studies in Stata</prism:publicationName>
      <prism:volume>68</prism:volume>
      <prism:number>2</prism:number>
      <prism:startingPage>462</prism:startingPage>
      <prism:endingPage>463</prism:endingPage>
      <prism:coverDate>2026-06-30T07:00:00Z</prism:coverDate>
      <prism:coverDisplayDate>2026-06-30T07:00:00Z</prism:coverDisplayDate>
      <prism:doi>10.1137/24M1640987</prism:doi>
      <prism:url>https://epubs.siam.org/doi/abs/10.1137/24M1640987?af=R</prism:url>
      <prism:copyright>© 2026 Society for Industrial and Applied Mathematics</prism:copyright>
   </item>
   <item rdf:about="https://epubs.siam.org/doi/abs/10.1137/24M1721384?af=R">
      <title>Book Review:;  Non-Local Cell Adhesion Models: Symmetries and Bifurcations in 1-D</title>
      <link>https://epubs.siam.org/doi/abs/10.1137/24M1721384?af=R</link>
      <content:encoded>SIAM Review, &lt;a href="https://epubs.siam.org/toc/siread/68/2"&gt;Volume 68, Issue 2&lt;/a&gt;, Page 463-464, June 2026. &lt;br/&gt; If you’ve ever wondered how math and biology can play complex, yet harmonious jazz, this book is your backstage pass. Non-Local Cell Adhesion Models: Symmetries and Bifurcations in 1-D takes you on an intellectually thrilling journey starting from a rather (apparently) humble but powerfully insightful heuristic model introduced by Armstrong, Painter, and Sherratt. Despite its seemingly simple beginnings, this model, a nonlocal nonlinear PDE, is a heavyweight champion in applied mathematics capable of mimicking certain cell sorting experiments in the fascinating and fundamental realm of cell adhesion.  </content:encoded>
      <description>SIAM Review, Volume 68, Issue 2, Page 463-464, June 2026. &lt;br/&gt; If you’ve ever wondered how math and biology can play complex, yet harmonious jazz, this book is your backstage pass. Non-Local Cell Adhesion Models: Symmetries and Bifurcations in 1-D takes you on an intellectually thrilling journey starting from a rather (apparently) humble but powerfully insightful heuristic model introduced by Armstrong, Painter, and Sherratt. Despite its seemingly simple beginnings, this model, a nonlocal nonlinear PDE, is a heavyweight champion in applied mathematics capable of mimicking certain cell sorting experiments in the fascinating and fundamental realm of cell adhesion.  &lt;p&gt;&lt;img src="https://epubs.siam.org/na101/home/literatum/publisher/siam/journals/covergifs/siread/cover.jpg" alt-text="cover image"/&gt;&lt;/p&gt;</description>
      <dc:title>Book Review:;  Non-Local Cell Adhesion Models: Symmetries and Bifurcations in 1-D</dc:title>
      <dc:identifier>10.1137/24M1721384</dc:identifier>
      <dc:source>SIAM Review</dc:source>
      <dc:date>2026-05-13T07:00:00Z</dc:date>
      <dc:rights>© 2026 Society for Industrial and Applied Mathematics</dc:rights>
      <dc:creator>Nadia Loy</dc:creator>
      <prism:publicationName>Book Review:;  Non-Local Cell Adhesion Models: Symmetries and Bifurcations in 1-D</prism:publicationName>
      <prism:volume>68</prism:volume>
      <prism:number>2</prism:number>
      <prism:startingPage>463</prism:startingPage>
      <prism:endingPage>464</prism:endingPage>
      <prism:coverDate>2026-06-30T07:00:00Z</prism:coverDate>
      <prism:coverDisplayDate>2026-06-30T07:00:00Z</prism:coverDisplayDate>
      <prism:doi>10.1137/24M1721384</prism:doi>
      <prism:url>https://epubs.siam.org/doi/abs/10.1137/24M1721384?af=R</prism:url>
      <prism:copyright>© 2026 Society for Industrial and Applied Mathematics</prism:copyright>
   </item>
   <item rdf:about="https://epubs.siam.org/doi/abs/10.1137/25M1800111?af=R">
      <title>Book Review:;  Biological Rhythms</title>
      <link>https://epubs.siam.org/doi/abs/10.1137/25M1800111?af=R</link>
      <content:encoded>SIAM Review, &lt;a href="https://epubs.siam.org/toc/siread/68/2"&gt;Volume 68, Issue 2&lt;/a&gt;, Page 464-466, June 2026. &lt;br/&gt; Daniel B. Forger’s Biological Rhythms is an engaging, compact, and intellectually generous exploration of the clocks that govern life. Written for the MIT Press “Essential Knowledge” series, the book aims to offer a rigorous but accessible introduction to the science of circadian and other biological rhythms. Forger succeeds admirably, distilling a wide swath of chronobiology—spanning physiology, neuroscience, endocrinology, and applied mathematics—into a volume that is approachable, fascinating, and often surprisingly personal.  </content:encoded>
      <description>SIAM Review, Volume 68, Issue 2, Page 464-466, June 2026. &lt;br/&gt; Daniel B. Forger’s Biological Rhythms is an engaging, compact, and intellectually generous exploration of the clocks that govern life. Written for the MIT Press “Essential Knowledge” series, the book aims to offer a rigorous but accessible introduction to the science of circadian and other biological rhythms. Forger succeeds admirably, distilling a wide swath of chronobiology—spanning physiology, neuroscience, endocrinology, and applied mathematics—into a volume that is approachable, fascinating, and often surprisingly personal.  &lt;p&gt;&lt;img src="https://epubs.siam.org/na101/home/literatum/publisher/siam/journals/covergifs/siread/cover.jpg" alt-text="cover image"/&gt;&lt;/p&gt;</description>
      <dc:title>Book Review:;  Biological Rhythms</dc:title>
      <dc:identifier>10.1137/25M1800111</dc:identifier>
      <dc:source>SIAM Review</dc:source>
      <dc:date>2026-05-13T07:00:00Z</dc:date>
      <dc:rights>© 2026 Society for Industrial and Applied Mathematics</dc:rights>
      <dc:creator>Anita T. Layton</dc:creator>
      <prism:publicationName>Book Review:;  Biological Rhythms</prism:publicationName>
      <prism:volume>68</prism:volume>
      <prism:number>2</prism:number>
      <prism:startingPage>464</prism:startingPage>
      <prism:endingPage>466</prism:endingPage>
      <prism:coverDate>2026-06-30T07:00:00Z</prism:coverDate>
      <prism:coverDisplayDate>2026-06-30T07:00:00Z</prism:coverDisplayDate>
      <prism:doi>10.1137/25M1800111</prism:doi>
      <prism:url>https://epubs.siam.org/doi/abs/10.1137/25M1800111?af=R</prism:url>
      <prism:copyright>© 2026 Society for Industrial and Applied Mathematics</prism:copyright>
   </item>
   <item rdf:about="https://epubs.siam.org/doi/abs/10.1137/25M1809501?af=R">
      <title>Book Review:;  A Brief History of Mathematics for Curious Minds</title>
      <link>https://epubs.siam.org/doi/abs/10.1137/25M1809501?af=R</link>
      <content:encoded>SIAM Review, &lt;a href="https://epubs.siam.org/toc/siread/68/2"&gt;Volume 68, Issue 2&lt;/a&gt;, Page 466-467, June 2026. &lt;br/&gt; Reading a book about the history of mathematics is never a waste of time, especially if you are a working mathematician, whether applied or pure. Obviously, there are many excellent monographs devoted to specific periods such as nineteenth-century mathematics, or to specific subjects such as mathematical analysis, and these serve specialists very well. The book under review is more ambitious and attempts to cover the whole history of mathematics under the additional assumption that the intended reader is a layperson, not necessarily a professional mathematician. Remarkably, this ambitious task is carried out in just over 200 pages organized into ten chapters, complemented by a bibliography, a name index, and 32 short appendices containing mathematical gems.  </content:encoded>
      <description>SIAM Review, Volume 68, Issue 2, Page 466-467, June 2026. &lt;br/&gt; Reading a book about the history of mathematics is never a waste of time, especially if you are a working mathematician, whether applied or pure. Obviously, there are many excellent monographs devoted to specific periods such as nineteenth-century mathematics, or to specific subjects such as mathematical analysis, and these serve specialists very well. The book under review is more ambitious and attempts to cover the whole history of mathematics under the additional assumption that the intended reader is a layperson, not necessarily a professional mathematician. Remarkably, this ambitious task is carried out in just over 200 pages organized into ten chapters, complemented by a bibliography, a name index, and 32 short appendices containing mathematical gems.  &lt;p&gt;&lt;img src="https://epubs.siam.org/na101/home/literatum/publisher/siam/journals/covergifs/siread/cover.jpg" alt-text="cover image"/&gt;&lt;/p&gt;</description>
      <dc:title>Book Review:;  A Brief History of Mathematics for Curious Minds</dc:title>
      <dc:identifier>10.1137/25M1809501</dc:identifier>
      <dc:source>SIAM Review</dc:source>
      <dc:date>2026-05-13T07:00:00Z</dc:date>
      <dc:rights>© 2026 Society for Industrial and Applied Mathematics</dc:rights>
      <dc:creator>J. M. Almira</dc:creator>
      <prism:publicationName>Book Review:;  A Brief History of Mathematics for Curious Minds</prism:publicationName>
      <prism:volume>68</prism:volume>
      <prism:number>2</prism:number>
      <prism:startingPage>466</prism:startingPage>
      <prism:endingPage>467</prism:endingPage>
      <prism:coverDate>2026-06-30T07:00:00Z</prism:coverDate>
      <prism:coverDisplayDate>2026-06-30T07:00:00Z</prism:coverDisplayDate>
      <prism:doi>10.1137/25M1809501</prism:doi>
      <prism:url>https://epubs.siam.org/doi/abs/10.1137/25M1809501?af=R</prism:url>
      <prism:copyright>© 2026 Society for Industrial and Applied Mathematics</prism:copyright>
   </item>
</rdf:RDF>
