Page Content
to Navigation
Sven Jäger
Research assistant
Fakultät II - Mathematik und Naturwissenschaften
Institut für Mathematik, Sekr. MA 5-2
Technische Universität Berlin
Straße des 17. Juni 136
10623 Berlin
Germany
E-Mail: jaeger #at# math.tu-berlin.de
Tel.: +49 (0)30 314-21095
Fax: +49 (0)30 314-25191
Room: MA 511
Consultation hours: Tuesday 5:00 pm. Please send me an email before Tuesday noon in order to get the zoom link.
Teaching
Summer 2021 | Computerorientierte Mathematik II (theoretical exercises) |
Winter 2020/21 | Introduction to Linear and Combinatorial Optimization (ADM I) |
Summer 2020 | Discrete Optimization (ADM II) |
Winter 2019/20 | Introduction to Linear and Combinatorial Optimization (ADM I) |
Summer 2019 | Discrete Optimization (ADM II) |
Winter 2018/19 | Introduction to Linear and Combinatorial Optimization (ADM I) |
Summer 2018 | Computerorientierte Mathematik II (programming exercises) |
Winter 2017/18 | Computerorientierte Mathematik I (programming exercises) |
Summer 2017 | Computerorientierte Mathematik II (theoretical exercises) |
Winter 2016/17 | Computerorientierte Mathematik I (theoretical exercises) |
Curriculum Vitae
Since July 2016 | Doctoral student with Martin Skutella, Technische Universität Berlin |
2013 - 2016: | Master studies in Mathematics and in Applied Computer Science at Georg-August-Universität Göttingen, Germany. |
2010 - 2013: | Bachelor studies in Mathematics and in Applied Computer Science at Georg-August-Universität Göttingen, Germany. |
2010: | Abitur at Hainberg-Gymnasium Göttingen |
Publications
Citation key | DaeubelJaegerMuetzeScheucher2019b |
---|---|
Author | Däubel, Karl and Jäger, Sven and Mütze, Torsten and Scheucher, Manfred |
Pages | P3.64 |
Year | 2019 |
ISSN | 1077-8926 |
Journal | Electronic Journal of Combinatorics |
Volume | 26 |
Number | 3 |
Month | 09 |
Note | Full version |
Abstract | The n-cube is the poset obtained by ordering all subsets of 1,…,n by inclusion, and it can be partitioned into n choose ⌊n/2⌋ chains, which is the minimum possible number. Two such decompositions of the n-cube are called orthogonal if any two chains of the decompositions share at most a single element. Shearer and Kleitman conjectured in 1979 that the n-cube has ⌊n/2⌋+1 pairwise orthogonal decompositions into the minimum number of chains, and they constructed two such decompositions. Spink recently improved this by showing that the n-cube has three pairwise orthogonal chain decompositions for n≥24. In this paper, we construct four pairwise orthogonal chain decompositions of the n-cube for n≥60. We also construct five pairwise edge-disjoint symmetric chain decompositions of the n-cube for n≥90, where edge-disjointness is a slightly weaker notion than orthogonality, improving on a recent result by Gregor, Jäger, Mütze, Sawada, and Wille. |
Citation key | DaeubelJaegerMuetzeScheucher2019b |
---|---|
Author | Däubel, Karl and Jäger, Sven and Mütze, Torsten and Scheucher, Manfred |
Pages | P3.64 |
Year | 2019 |
ISSN | 1077-8926 |
Journal | Electronic Journal of Combinatorics |
Volume | 26 |
Number | 3 |
Month | 09 |
Note | Full version |
Abstract | The n-cube is the poset obtained by ordering all subsets of 1,…,n by inclusion, and it can be partitioned into n choose ⌊n/2⌋ chains, which is the minimum possible number. Two such decompositions of the n-cube are called orthogonal if any two chains of the decompositions share at most a single element. Shearer and Kleitman conjectured in 1979 that the n-cube has ⌊n/2⌋+1 pairwise orthogonal decompositions into the minimum number of chains, and they constructed two such decompositions. Spink recently improved this by showing that the n-cube has three pairwise orthogonal chain decompositions for n≥24. In this paper, we construct four pairwise orthogonal chain decompositions of the n-cube for n≥60. We also construct five pairwise edge-disjoint symmetric chain decompositions of the n-cube for n≥90, where edge-disjointness is a slightly weaker notion than orthogonality, improving on a recent result by Gregor, Jäger, Mütze, Sawada, and Wille. |
Talks
- Approximating Total Weighted Completion Time on Identical Parallel Machines with Precedence Constraints and Release Dates MAPSP 2019 PDF, 292 KB
- Generalizing the Kawaguchi-Kyan Bound to Stochastic Parallel Machine Scheduling COW 2018, STACS 2018, ISMP 2018, BMS-BGSMath Junior Meeting 2019, FRICO 2019 PDF, 232 KB
- Gray codes and symmetric chains ICALP 2018 PDF, 381 KB
- On orthogonal symmetric chain decompositions EUROCOMB 2019 PDF, 449 KB
- Scheduling Stochastic Jobs with Release Dates on a Single Machine Dagstuhl Seminar Scheduling 2020 PDF, 457 KB