<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
<channel>
<title>2016</title>
<link>http://publications.mfo.de/handle/mfo/62</link>
<description/>
<pubDate>Mon, 06 Apr 2026 21:14:22 GMT</pubDate>
<dc:date>2026-04-06T21:14:22Z</dc:date>
<item>
<title>Towards a Mathematical Theory of Turbulence in Fluids</title>
<link>http://publications.mfo.de/handle/mfo/1276</link>
<description>Towards a Mathematical Theory of Turbulence in Fluids
Bedrossian, Jacob
Fluid mechanics is the theory of how liquids and gases move around. For the most part, the basic physics are well understood and the mathematical models look relatively simple. Despite this, fluids display a dazzling mystery to their motion. The random-looking, chaotic behavior of fluids is known as turbulence, and it lies far beyond our mathematical understanding, despite a century of intense research.
</description>
<pubDate>Fri, 01 Jan 2016 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://publications.mfo.de/handle/mfo/1276</guid>
<dc:date>2016-01-01T00:00:00Z</dc:date>
<dc:creator>Bedrossian, Jacob</dc:creator>
<dc:description>Fluid mechanics is the theory of how liquids and gases move around. For the most part, the basic physics are well understood and the mathematical models look relatively simple. Despite this, fluids display a dazzling mystery to their motion. The random-looking, chaotic behavior of fluids is known as turbulence, and it lies far beyond our mathematical understanding, despite a century of intense research.</dc:description>
</item>
<item>
<title>Profinite groups</title>
<link>http://publications.mfo.de/handle/mfo/1258</link>
<description>Profinite groups
Bartholdi, Laurent
Profinite objects are mathematical constructions used to collect, in a uniform manner, facts about infinitely many finite objects. We shall review recent progress in the theory of profinite groups, due to Nikolov and Segal, and its implications for finite groups.
</description>
<pubDate>Fri, 01 Jan 2016 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://publications.mfo.de/handle/mfo/1258</guid>
<dc:date>2016-01-01T00:00:00Z</dc:date>
<dc:creator>Bartholdi, Laurent</dc:creator>
<dc:description>Profinite objects are mathematical constructions used to collect, in a uniform manner, facts about infinitely many finite objects. We shall review recent progress in the theory of profinite groups, due to Nikolov and Segal, and its implications for finite groups.</dc:description>
</item>
<item>
<title>The adaptive finite element method</title>
<link>http://publications.mfo.de/handle/mfo/1254</link>
<description>The adaptive finite element method
Gallistl, Dietmar
Computer simulations of many physical phenomena rely on approximations by models with a finite number of unknowns. The number of these parameters determines the computational effort needed for the simulation. On the other hand, a larger number of unknowns can improve the precision of the simulation. The adaptive finite element method (AFEM) is an algorithm for optimizing the choice of parameters so accurate simulation results can be obtained with as little computational effort as possible.
</description>
<pubDate>Fri, 01 Jan 2016 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://publications.mfo.de/handle/mfo/1254</guid>
<dc:date>2016-01-01T00:00:00Z</dc:date>
<dc:creator>Gallistl, Dietmar</dc:creator>
<dc:description>Computer simulations of many physical phenomena rely on approximations by models with a finite number of unknowns. The number of these parameters determines the computational effort needed for the simulation. On the other hand, a larger number of unknowns can improve the precision of the simulation. The adaptive finite element method (AFEM) is an algorithm for optimizing the choice of parameters so accurate simulation results can be obtained with as little computational effort as possible.</dc:description>
</item>
<item>
<title>Footballs and donuts in four dimensions</title>
<link>http://publications.mfo.de/handle/mfo/456</link>
<description>Footballs and donuts in four dimensions
Klee, Steven
In this snapshot, we explore connections between the mathematical areas of counting and geometry by studying objects called simplicial complexes. We begin by exploring many familiar objects in our three dimensional world and then discuss the ways one may generalize these ideas into higher dimensions.
</description>
<pubDate>Fri, 01 Jan 2016 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://publications.mfo.de/handle/mfo/456</guid>
<dc:date>2016-01-01T00:00:00Z</dc:date>
<dc:creator>Klee, Steven</dc:creator>
<dc:description>In this snapshot, we explore connections between the mathematical areas of counting and geometry by studying objects called simplicial complexes. We begin by exploring many familiar objects in our three dimensional world and then discuss the ways one may generalize these ideas into higher dimensions.</dc:description>
</item>
<item>
<title>The Willmore Conjecture</title>
<link>http://publications.mfo.de/handle/mfo/455</link>
<description>The Willmore Conjecture
Nowaczyk, Nikolai
The Willmore problem studies which torus has the least amount of bending energy. We explain how to think of a torus as a donut-shaped surface and how the intuitive notion of bending has been studied by mathematics over time.
</description>
<pubDate>Fri, 01 Jan 2016 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://publications.mfo.de/handle/mfo/455</guid>
<dc:date>2016-01-01T00:00:00Z</dc:date>
<dc:creator>Nowaczyk, Nikolai</dc:creator>
<dc:description>The Willmore problem studies which torus has the least amount of bending energy. We explain how to think of a torus as a donut-shaped surface and how the intuitive notion of bending has been studied by mathematics over time.</dc:description>
</item>
<item>
<title>Prime tuples in function fields</title>
<link>http://publications.mfo.de/handle/mfo/454</link>
<description>Prime tuples in function fields
Bary-Soroker, Lior
How many prime numbers are there? How are they distributed among other numbers? These are questions that have intrigued mathematicians since ancient times.  However, many questions in this area have remained unsolved, and seemingly unsolvable in the forseeable future. In this snapshot, we will discuss one such problem, the Twin Prime Conjecture, and a quantitative version of it known as the Hardy–Littlewood Conjecture. We will also see that these and other questions about prime numbers can be extended to questions about function fields, and discuss recent progress which has been made to answer them in this context.
</description>
<pubDate>Fri, 01 Jan 2016 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://publications.mfo.de/handle/mfo/454</guid>
<dc:date>2016-01-01T00:00:00Z</dc:date>
<dc:creator>Bary-Soroker, Lior</dc:creator>
<dc:description>How many prime numbers are there? How are they distributed among other numbers? These are questions that have intrigued mathematicians since ancient times.  However, many questions in this area have remained unsolved, and seemingly unsolvable in the forseeable future. In this snapshot, we will discuss one such problem, the Twin Prime Conjecture, and a quantitative version of it known as the Hardy–Littlewood Conjecture. We will also see that these and other questions about prime numbers can be extended to questions about function fields, and discuss recent progress which has been made to answer them in this context.</dc:description>
</item>
<item>
<title>Polyhedra and commensurability</title>
<link>http://publications.mfo.de/handle/mfo/464</link>
<description>Polyhedra and commensurability
Guglielmetti, Rafael; Jacquement, Matthieu
This snapshot introduces the notion of commensurability of polyhedra. At its bottom, this concept can be developed from constructions with paper, scissors, and glue. Starting with an elementary example, we formalize it subsequently. Finally, we discuss intriguing connections with other fields of mathematics.
</description>
<pubDate>Fri, 01 Jan 2016 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://publications.mfo.de/handle/mfo/464</guid>
<dc:date>2016-01-01T00:00:00Z</dc:date>
<dc:creator>Guglielmetti, Rafael</dc:creator>
<dc:creator>Jacquement, Matthieu</dc:creator>
<dc:description>This snapshot introduces the notion of commensurability of polyhedra. At its bottom, this concept can be developed from constructions with paper, scissors, and glue. Starting with an elementary example, we formalize it subsequently. Finally, we discuss intriguing connections with other fields of mathematics.</dc:description>
</item>
<item>
<title>Fokus-Erkennung bei Epilepsiepatienten mithilfe moderner Verfahren der Zeitreihenanalyse</title>
<link>http://publications.mfo.de/handle/mfo/463</link>
<description>Fokus-Erkennung bei Epilepsiepatienten mithilfe moderner Verfahren der Zeitreihenanalyse
Deistler, Manfred; Graef, Andreas
Viele epileptische Anfälle entstehen in einer begrenzten Region im Gehirn, dem sogenannten Anfallsursprung. Eine chirurgische Entfernung dieser Region kann in vielen Fällen zu Anfallsfreiheit führen. Aus diesem Grund ist die Frage nach der Lokalisation des Anfallsursprungs aus EEG-Aufzeichnungen wichtig. Wir beschreiben hier ein Verfahren zur Lokalisation des Anfallsursprungs mittels Zeitreihenanalyse, das auf der Schätzung von Spektren im EEG beruht.
</description>
<pubDate>Fri, 01 Jan 2016 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://publications.mfo.de/handle/mfo/463</guid>
<dc:date>2016-01-01T00:00:00Z</dc:date>
<dc:creator>Deistler, Manfred</dc:creator>
<dc:creator>Graef, Andreas</dc:creator>
<dc:description>Viele epileptische Anfälle entstehen in einer begrenzten Region im Gehirn, dem sogenannten Anfallsursprung. Eine chirurgische Entfernung dieser Region kann in vielen Fällen zu Anfallsfreiheit führen. Aus diesem Grund ist die Frage nach der Lokalisation des Anfallsursprungs aus EEG-Aufzeichnungen wichtig. Wir beschreiben hier ein Verfahren zur Lokalisation des Anfallsursprungs mittels Zeitreihenanalyse, das auf der Schätzung von Spektren im EEG beruht.</dc:description>
</item>
<item>
<title>Wie steuert man einen Kran?</title>
<link>http://publications.mfo.de/handle/mfo/462</link>
<description>Wie steuert man einen Kran?
Altmann, Robert; Heiland, Jan
Die Steuerung einer Last an einem Kran ist ein technisch und mathematisch schwieriges Problem, da die Bewegung der Last nur indirekt beeinflusst werden kann. Anhand eines Masse-Feder-Systems illustrieren wir diese Schwierigkeiten und zeigen wie man mit einem zum konventionellen Lösungsweg alternativen Optimierungsansatz die auftretenden  Komplikationen teilweise umgehen kann.
</description>
<pubDate>Fri, 01 Jan 2016 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://publications.mfo.de/handle/mfo/462</guid>
<dc:date>2016-01-01T00:00:00Z</dc:date>
<dc:creator>Altmann, Robert</dc:creator>
<dc:creator>Heiland, Jan</dc:creator>
<dc:description>Die Steuerung einer Last an einem Kran ist ein technisch und mathematisch schwieriges Problem, da die Bewegung der Last nur indirekt beeinflusst werden kann. Anhand eines Masse-Feder-Systems illustrieren wir diese Schwierigkeiten und zeigen wie man mit einem zum konventionellen Lösungsweg alternativen Optimierungsansatz die auftretenden  Komplikationen teilweise umgehen kann.</dc:description>
</item>
<item>
<title>High performance computing on smartphones</title>
<link>http://publications.mfo.de/handle/mfo/461</link>
<description>High performance computing on smartphones
Patera, Anthony T.; Urban, Karsten
Nowadays there is a strong demand to simulate even real-world engineering problems on small computing devices with very limited capacity, such as a smartphone. We explain, using a concrete example, how we can obtain a reduction in complexity – to enable such computations – using mathematical methods.
</description>
<pubDate>Fri, 01 Jan 2016 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://publications.mfo.de/handle/mfo/461</guid>
<dc:date>2016-01-01T00:00:00Z</dc:date>
<dc:creator>Patera, Anthony T.</dc:creator>
<dc:creator>Urban, Karsten</dc:creator>
<dc:description>Nowadays there is a strong demand to simulate even real-world engineering problems on small computing devices with very limited capacity, such as a smartphone. We explain, using a concrete example, how we can obtain a reduction in complexity – to enable such computations – using mathematical methods.</dc:description>
</item>
</channel>
</rss>
