direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content

Sven Jäger

Lupe

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:
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.

Research interests

  • Apprroximation algorithms
  • Scheduling
  • Symmetric Chain Decompositions

Teaching

Assistances
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

On orthogonal symmetric chain decompositions
Citation key DaeubelJaegerMuetzeScheucher2019
Author Däubel, Karl and Jäger, Sven and Mütze, Torsten and Scheucher, Manfred
Title of Book Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB)
Pages 611–618
Year 2019
ISSN 0862-9544
Location Bratislava
Journal Acta Mathematica Universitatis Comenianae
Volume 88
Number 3
Month August
Note extended abstract
Editor Nešetřil, Jaroslav and Škoviera, Martin
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 decomposition 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 possible 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.
Link to original publication Download Bibtex entry
On orthogonal symmetric chain decompositions
Citation key DaeubelJaegerMuetzeScheucher2019
Author Däubel, Karl and Jäger, Sven and Mütze, Torsten and Scheucher, Manfred
Title of Book Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB)
Pages 611–618
Year 2019
ISSN 0862-9544
Location Bratislava
Journal Acta Mathematica Universitatis Comenianae
Volume 88
Number 3
Month August
Note extended abstract
Editor Nešetřil, Jaroslav and Škoviera, Martin
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 decomposition 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 possible 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.
Link to original publication Download Bibtex entry

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Auxiliary Functions

This site uses Matomo for anonymized webanalysis. Visit Data Privacy for more information and opt-out options.