I am currently a researcher at the European Space Agency in the Advanced Concepts Team.
You might also find some interesting things on my other website.
Want to contact me? Write me an Email at Me@jonasseiler.de.
I have been programming for nearly 11 years and have developed a wide range of things in many languages; from developing and implemeting algorithms to writing my own cloud backup software and public use API. You can find some of my projects on my Github.
On the more sciency side I am especially interested in theoretical aspects, like algorithms, complexity and logic mostly on graphs and other combinatorial objects
An interest in numbers and logic from a young age has persisted to the present day. I am easily nerdsniped by topics about geometry, graphs and combinatorics. I am trying to supplement mathematical thinking with computational efforts, for example in my bachelor's thesis about Tilings.
I have also discovered an interesting integer sequence that is now listed in the OEIS!
I am also an avid board game fan. I am mostly interested in strategic ressource or deduction games like Catan or The Crew.
My favorite types of games are those that are easy and intuitive to learn but have a suprisingly high skill ceiling like Carcassonne or Hanabi.
I also like cycling, bouldering, baking, cooking, playing videogames, solving logic puzzles and so much more.
Feel free to write me a mail if you want to get to know me better.
A Bongard problem is a puzzle with two sides of six diagrams each. Every diagram on one side has a common attribute which is missing from the other side. The problem is finding this differing attribute. Below are three Bongard problems in ascending difficulty.
You can find more Bongard Problems in The On-Line Encyclopedia of Bongard Problems or on Harry Foundalis Website
I am currently a researcher in the Advanced Concepts Team (ACT) as part of the EGT programme and am researching about efficient algorithms for space travel.
Specifically, we want to prove theoretical guarantees for route planning algorithms in space to answer questions such as "If I want to visit every planet in our solar system, what is the best order?"
We are looking at common graph problems in a space setting like the keplerian traveling salesperson problem (Keplerian TSP) where each vertex is on an orbit and distances of edges are constantly changing or other distance graphs that do not satisfy the triangle inequality due to things like slingshot maneuvers.
Concept of the smallest non-trivial 3D-cuboid tiling with (2,1)-pieces.
Addendum to my bachelor's thesis.
Between 2018 and 2024, I have studied Informatics and Mathematics at the KIT. My interests lie in the intersection between these two disciplines.
In Informatics, I am especially intested in theoretical problems; algorithms and decidability, especially on graphs and other combinatorial objects.
In mathematics, I approach this intersection from the other side, from the view point of discrete mathematics, combinatorics and group theory.
Some specialized interests of mine are randomized algorithms and probabilistic analysis, distributed graph theory and algorithms, word and other decidability problems on groups or languages.
Coherence of low-dimensional groups, Master's thesis, 2024
A group is coherent, if all it's finitely generated subgroups are also finitely presented. In this thesis, I introduced this attribute of groups, recaped some basic examples and constructions for such groups and finally explained Jaikin and Linton's proof of Baumslags Conjecture about the coherence of one-relator groups.
A381294: Set intersection with minimal support, OEIS entry, 2024
Consider n sets numbered from 1 to n, such that set i and set j have exactly |i-j| common elements. What is the minimum number of support elements for such a construction to exist? I.e. given a number n, what is the minimum k, such that such sets exist and their union has exactly k elements? This sequence is now listed in the OEIS as A381294.
Tiling rectangles with Unions of Squares, Bachelor's thesis, 2021
Given two squares with side length a and b, we glue them together on one side. We call the resulting figure an (a,b)-piece. For which combinations of a and b can we tile a rectangle of arbitrary (or fixed) side-lengths with only (a,b)-pieces? In this thesis, I answered this question for some families of combinations of a and b, answered the question about tiling the whole plane and tackled the question in higher dimensions.
Log Cabin Seminar, RTG 2229, Neckarmühlbach
Profinite Rigidity Workshop, Karlsruhe
Coherence of low-dimensional groups Talk, Topology research group seminar, Karlsruhe
YGGT XII Conference, Bristol
I am a big fan of the Advent of Code.
You can see my solutions in repositories for each year on my Github.
I try to use a different language each year to get familiar with them. So far, I have used Julia, Rust, Typescript and Go.
While trying to answer a different question, we stumbled upon a problem that yielded a new integer sequence.
This sequence is now listed as A381294 in the OEIS.
You can also find a small summary of our results here.