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.

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.

Geproci sets arise from applying the perspective of inverse scattering problems to algebraic geometry. Analogous to the reconstruction of an object from multiple X-ray images, we aim at a classification of sets with certain algebraic properties under multiple projections.

The research field of finite geometries investigates structures with a finite number of objects. Classical examples include vector spaces, projective spaces, and affine spaces over finite fields. Although many of these structures are studied for their geometrical importance, they are also of great interest in other, more applied domains of mathematics. In this snapshot, finite vector spaces are introduced. We discuss the geometrical concept of partial t-spreads together with its implications for the “packing problem” and a recent application in the existence of “cooling codes”.

Pattern is ubiquitous and seems totally familiar. Yet if we ask what it is, we find a bewildering collection of answers. Here we suggest that there is a common thread, and it revolves around dynamics.