CC BY-SA-4.0

You are free to:

Share — copy and redistribute the material in any medium or format
Adapt — remix, transform, and build upon the material
for any purpose, even commercially.
The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:

Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
ShareAlike — If you remix, transform, or build upon the material, you must distribute your contributions under the same license as the original.
No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.

More information (license deed): https://creativecommons.org/licenses/by-sa/4.0/

Simulating Alzheimer’s disease with a brainsphere model

Nowadays, there are different medical imaging techniques to collect data about the progression of Alzheimer’s disease in a patient’s brain. These data describe different phenomena which are still not understood from a biological point of view. How can these data sets be combined in a mathematical model to simulate the evolution of such a neurodegenerative disease in a computer? In this snapshot, we present one possible approach to address this task with the help of graph theory and partial differential equations.

How big is my slice of cheese?

In this snapshot, we introduce the study of slices of polytopes – geometric shapes with flat sides – and examine the area of these slices. This is connected to combinatorics and polynomials and is surprisingly complex, even in three dimensions. Since we are greedy humans, we conclude by finding the largest possible slice of cheese.

The 4-Sample Theorem on planar graphs

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.

Triangulations in geometry: from Ptolemy to Teichmüller

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.

Alternating sign matrix bijections: marvelous, mysterious, missing

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.

Secure file sharing and Cayley graphs

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.

Why oscillation counts: Diophantine approximation, geometry, and the Fourier transform

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!

Is there a smooth lattice polytope which does not have the integer decomposition property?

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.

Seiten