<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
<channel>
<title>2 - Snapshots of Modern Mathematics from Oberwolfach</title>
<link>http://publications.mfo.de/handle/mfo/20</link>
<description>The snapshot project is designed to promote the understanding and appreciation of modern mathematics and mathematical research in the general public world-wide. It is part of the project "Oberwolfach meets IMAGINARY“, supported by the Klaus Tschira Foundation.</description>
<pubDate>Fri, 10 Apr 2026 13:36:54 GMT</pubDate>
<dc:date>2026-04-10T13:36:54Z</dc:date>
<image>
<title>2 - Snapshots of Modern Mathematics from Oberwolfach</title>
<url>http://publications.mfo.de:80/bitstream/id/3670a104-7004-438d-a11b-98e3fffbf777/</url>
<link>http://publications.mfo.de/handle/mfo/20</link>
</image>
<item>
<title>The 4-Sample Theorem on planar graphs</title>
<link>http://publications.mfo.de/handle/mfo/4415</link>
<description>The 4-Sample Theorem on planar graphs
Améndola, Carlos; Kahle, Thomas
The famous 4-Color Theorem from graph theory states that the vertices of any planar graph can be colored with four colors, so that no neighboring vertices have the same color. The 4-Sample Theorem from algebraic statistics says that the maximum likelihood estimator for a Gaussian graphical model of a planar graph exists with probability 1 if one has at least four samples. This number of necessary samples, the maximum likelihood threshold, is a new graph invariant from algebraic statistics and connected not only to parameter estimation, but also to matrix completion, the theory of filling partial matrices, and rigidity theory, which deals with stability of objects.
</description>
<pubDate>Fri, 10 Apr 2026 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://publications.mfo.de/handle/mfo/4415</guid>
<dc:date>2026-04-10T00:00:00Z</dc:date>
<dc:creator>Améndola, Carlos</dc:creator>
<dc:creator>Kahle, Thomas</dc:creator>
<dc:description>The famous 4-Color Theorem from graph theory states that the vertices of any planar graph can be colored with four colors, so that no neighboring vertices have the same color. The 4-Sample Theorem from algebraic statistics says that the maximum likelihood estimator for a Gaussian graphical model of a planar graph exists with probability 1 if one has at least four samples. This number of necessary samples, the maximum likelihood threshold, is a new graph invariant from algebraic statistics and connected not only to parameter estimation, but also to matrix completion, the theory of filling partial matrices, and rigidity theory, which deals with stability of objects.</dc:description>
</item>
<item>
<title>Triangulations in Geometry:  from Ptolemy to Teichmüller</title>
<link>http://publications.mfo.de/handle/mfo/4391</link>
<description>Triangulations in Geometry:  from Ptolemy to Teichmüller
Pressland, Matthew
Ptolemy's theorem is a classical result from ancient Greek mathematics, concerning the lengths of sides and diagonals of a polygon drawn in a circle. In this snapshot, I will explain why this theorem is still important today through its role in Teichmüller theory, a subject which seeks to describe all possible ''shapes'' of a surface with boundary.
</description>
<pubDate>Fri, 27 Feb 2026 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://publications.mfo.de/handle/mfo/4391</guid>
<dc:date>2026-02-27T00:00:00Z</dc:date>
<dc:creator>Pressland, Matthew</dc:creator>
<dc:description>Ptolemy's theorem is a classical result from ancient Greek mathematics, concerning the lengths of sides and diagonals of a polygon drawn in a circle. In this snapshot, I will explain why this theorem is still important today through its role in Teichmüller theory, a subject which seeks to describe all possible ''shapes'' of a surface with boundary.</dc:description>
</item>
<item>
<title>Alternating Sign Matrix Bijections: Marvelous, Mysterious, Missing</title>
<link>http://publications.mfo.de/handle/mfo/4388</link>
<description>Alternating Sign Matrix Bijections: Marvelous, Mysterious, Missing
Striker, Jessica
A bijection transforms one type of mathematical object into another. Such transformations provide new perspectives on these objects, revealing surprising properties and uncovering new mysteries. We discuss bijections from alternating sign matrices to other objects in mathematics and physics and recent progress in the search for a missing bijection.
</description>
<pubDate>Tue, 24 Feb 2026 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://publications.mfo.de/handle/mfo/4388</guid>
<dc:date>2026-02-24T00:00:00Z</dc:date>
<dc:creator>Striker, Jessica</dc:creator>
<dc:description>A bijection transforms one type of mathematical object into another. Such transformations provide new perspectives on these objects, revealing surprising properties and uncovering new mysteries. We discuss bijections from alternating sign matrices to other objects in mathematics and physics and recent progress in the search for a missing bijection.</dc:description>
</item>
<item>
<title>Secure File Sharing and Cayley Graphs</title>
<link>http://publications.mfo.de/handle/mfo/4387</link>
<description>Secure File Sharing and Cayley Graphs
McKemmie, Eilidh
Have you ever wondered how your computer knows it can trust certain downloads but not others? This snapshot describes some security concerns and one algebraic way of dealing with them. We'll see an interesting procedure that uses a very difficult problem in algebra to provide security, and discuss some of the procedure's important properties.
</description>
<pubDate>Mon, 23 Feb 2026 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://publications.mfo.de/handle/mfo/4387</guid>
<dc:date>2026-02-23T00:00:00Z</dc:date>
<dc:creator>McKemmie, Eilidh</dc:creator>
<dc:description>Have you ever wondered how your computer knows it can trust certain downloads but not others? This snapshot describes some security concerns and one algebraic way of dealing with them. We'll see an interesting procedure that uses a very difficult problem in algebra to provide security, and discuss some of the procedure's important properties.</dc:description>
</item>
<item>
<title>Fracture Mechanics: a Nonlocal Approach</title>
<link>http://publications.mfo.de/handle/mfo/4386</link>
<description>Fracture Mechanics: a Nonlocal Approach
Buczkowski, Nicole; Foss, Mikil; Radu, Petronela
Nonlocal models consider interactions over a range of distances, not just at a single point. In this snapshot, we give a short introduction to nonlocal modeling, explain how it differs from its local counterpart, and present an application: fracture mechanics.
</description>
<pubDate>Fri, 20 Feb 2026 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://publications.mfo.de/handle/mfo/4386</guid>
<dc:date>2026-02-20T00:00:00Z</dc:date>
<dc:creator>Buczkowski, Nicole</dc:creator>
<dc:creator>Foss, Mikil</dc:creator>
<dc:creator>Radu, Petronela</dc:creator>
<dc:description>Nonlocal models consider interactions over a range of distances, not just at a single point. In this snapshot, we give a short introduction to nonlocal modeling, explain how it differs from its local counterpart, and present an application: fracture mechanics.</dc:description>
</item>
<item>
<title>Why Oscillation Counts: Diophantine Approximation, Geometry, and the Fourier Transform</title>
<link>http://publications.mfo.de/handle/mfo/4356</link>
<description>Why Oscillation Counts: Diophantine Approximation, Geometry, and the Fourier Transform
Srivastava, Rajula
Is it possible to approximate arbitrary points in space by vectors with rational coordinates, with which we, and computers, feel much more comfortable? If yes, can we approximate those points arbitrarily close? In this snapshot, we explore how the geometric configuration of these points influences the answers to these questions. Further, we delve into the closely related problem of counting rational vectors near surfaces. The unlikely tool which helps us in this endeavour is Fourier analysis – the study of waves and oscillations!
</description>
<pubDate>Tue, 16 Dec 2025 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://publications.mfo.de/handle/mfo/4356</guid>
<dc:date>2025-12-16T00:00:00Z</dc:date>
<dc:creator>Srivastava, Rajula</dc:creator>
<dc:description>Is it possible to approximate arbitrary points in space by vectors with rational coordinates, with which we, and computers, feel much more comfortable? If yes, can we approximate those points arbitrarily close? In this snapshot, we explore how the geometric configuration of these points influences the answers to these questions. Further, we delve into the closely related problem of counting rational vectors near surfaces. The unlikely tool which helps us in this endeavour is Fourier analysis – the study of waves and oscillations!</dc:description>
</item>
<item>
<title>Is there a Smooth Lattice Polytope which does not have the Integer Decomposition Property?</title>
<link>http://publications.mfo.de/handle/mfo/4355</link>
<description>Is there a Smooth Lattice Polytope which does not have the Integer Decomposition Property?
Hofscheier, Johannes; Kasprzyk, Alexander
We introduce Tadao Oda's famous question on lattice polytopes which was originally posed at Oberwolfach in 1997 and, although simple to state, has remained unanswered. The question is motivated by a discussion of the two-dimensional case – including a proof of Pick's Theorem, which elegantly relates the area of a lattice polygon to the number of lattice points it contains in its interior and on its boundary.
</description>
<pubDate>Tue, 16 Dec 2025 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://publications.mfo.de/handle/mfo/4355</guid>
<dc:date>2025-12-16T00:00:00Z</dc:date>
<dc:creator>Hofscheier, Johannes</dc:creator>
<dc:creator>Kasprzyk, Alexander</dc:creator>
<dc:description>We introduce Tadao Oda's famous question on lattice polytopes which was originally posed at Oberwolfach in 1997 and, although simple to state, has remained unanswered. The question is motivated by a discussion of the two-dimensional case – including a proof of Pick's Theorem, which elegantly relates the area of a lattice polygon to the number of lattice points it contains in its interior and on its boundary.</dc:description>
</item>
<item>
<title>Brackets, Trees and the Borromean Rings</title>
<link>http://publications.mfo.de/handle/mfo/4347</link>
<description>Brackets, Trees and the Borromean Rings
Jasso, Gustavo
We describe some of the beautiful mathematical structures that arise from the study of the associativity equation. Our journey takes us from combinatorics to abstract algebra, with brief excursions through geometry and topology along the way.
</description>
<pubDate>Mon, 08 Dec 2025 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://publications.mfo.de/handle/mfo/4347</guid>
<dc:date>2025-12-08T00:00:00Z</dc:date>
<dc:creator>Jasso, Gustavo</dc:creator>
<dc:description>We describe some of the beautiful mathematical structures that arise from the study of the associativity equation. Our journey takes us from combinatorics to abstract algebra, with brief excursions through geometry and topology along the way.</dc:description>
</item>
<item>
<title>Brauer's Problems: 60 Years of Legacy</title>
<link>http://publications.mfo.de/handle/mfo/4345</link>
<description>Brauer's Problems: 60 Years of Legacy
Rizo, Noelia; Schaeffer Fry, Mandi A.
Richard Brauer (1901-1977) was a German-American mathematician who is regarded as the founder of a highly active mathematical area known as modular representation theory. This area grew from group theory, which can be thought of as the mathematical study of symmetries. In this snapshot, we hope to impress on the reader the legacy left by Brauer and celebrate the 60th anniversary of "Brauer's problems", a list of 43 conjectures and objectives suggested by Brauer in 1963. These problems inspired an entire branch within character theory, studying "local-global conjectures".
</description>
<pubDate>Mon, 24 Nov 2025 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://publications.mfo.de/handle/mfo/4345</guid>
<dc:date>2025-11-24T00:00:00Z</dc:date>
<dc:creator>Rizo, Noelia</dc:creator>
<dc:creator>Schaeffer Fry, Mandi A.</dc:creator>
<dc:description>Richard Brauer (1901-1977) was a German-American mathematician who is regarded as the founder of a highly active mathematical area known as modular representation theory. This area grew from group theory, which can be thought of as the mathematical study of symmetries. In this snapshot, we hope to impress on the reader the legacy left by Brauer and celebrate the 60th anniversary of "Brauer's problems", a list of 43 conjectures and objectives suggested by Brauer in 1963. These problems inspired an entire branch within character theory, studying "local-global conjectures".</dc:description>
</item>
<item>
<title>Trisections of Four-Dimensional Spaces</title>
<link>http://publications.mfo.de/handle/mfo/4322</link>
<description>Trisections of Four-Dimensional Spaces
Blackwell, Sarah
This snapshot introduces the theory of trisections of smooth 4-manifolds, an area of exploration in low-dimensional topology aiming to make four-dimensional spaces more understandable. Along the way, we discuss the concepts of topology, dimension, manifolds, and more!
</description>
<pubDate>Fri, 19 Sep 2025 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://publications.mfo.de/handle/mfo/4322</guid>
<dc:date>2025-09-19T00:00:00Z</dc:date>
<dc:creator>Blackwell, Sarah</dc:creator>
<dc:description>This snapshot introduces the theory of trisections of smooth 4-manifolds, an area of exploration in low-dimensional topology aiming to make four-dimensional spaces more understandable. Along the way, we discuss the concepts of topology, dimension, manifolds, and more!</dc:description>
</item>
</channel>
</rss>
