Postdoc positions at the IBS Discrete Mathematics Group, South Korea (Deadline: December 3)

The IBS Discrete Mathematics Group (DIMAG, https://dimag.ibs.re.kr/) in Daejeon, Korea invites applications for three research fellowship positions:

URL: https://dimag.ibs.re.kr/hiring/

DIMAG is a research group that was established on December 1, 2018 at the Institute for Basic Science (IBS), led by Prof. Sang-il Oum. DIMAG is located at the headquarters of the Institute for Basic Science (IBS) in Daejeon, South Korea, a city of 1.5 million people.

Currently, DIMAG consists of researchers from various countries such as Korea, the USA, Germany, Canada, and Australia, and the work is done in English. DIMAG is co-located with the IBS Extremal Combinatorics and Probability Group (ECOPRO).

Successful candidates for research fellowship positions will be new or recent Ph.D.’s with outstanding research potential in all fields of discrete mathematics with emphasis on structural graph theory, combinatorial optimization, matroid theory, and algorithms.

These appointments are for about two years, and the starting salary is no less than KRW 59,000,000. The appointment is one-time renewable up to 5 years in total contingent upon the outstanding performance of the researcher. The expected appointment date is September 1, 2024, but it is negotiable within the same calendar year.

These are purely research positions and will have no teaching duties.

A complete application packet should include:

  1. AMS standard cover sheet (preferred) or cover letter (PDF format)
  2. Curriculum vitae including a publication list (PDF format)
  3. Research statement (PDF format)
  4. Application for the IBS & Consent to Collection and Use of Personal Information (PDF file)
  5. At least 3 recommendation letters

For full consideration, applicants should email items 1, 2, 3, and 4 and arrange their recommendation letters emailed to dimag@ibs.re.kr by December 3, 2023, Sunday. (Anywhere on Earth)

Recommendation letters forwarded by an applicant will not be considered.

DIMAG encourages applications from individuals of diverse backgrounds.

For Korean citizens who have not yet completed their military duty: 전문연구요원 종사를 희망하는 경우에는 지원 의사와 병역 관계를 cover letter 및 이메일 등에 표시하여 제출 필요. 다만 현역입영대상자의 전문연구요원 신규 편입은 불가하며, 보충역 대상자 및 타 기관에서 전직해서 오는 경우에 한하여 지원 가능(반드시 타 기관에서 전직 요건이 충족되는 등 전직 요건이 충족 되어야만 함)

Online Talk: Jim Geelen

Please advertise this talk at your home institution. Anyone is welcome to attend! 

YouTube recording: https://www.youtube.com/watch?v=aOpvWW1lBH8

Time: Wednesday, Nov 15 at 3pm ET
Zoom: https://gatech.zoom.us/j/8802082683

Speaker: Jim Geelen, University of Waterloo
Title: Average plane-size

Abstract: In 1941, Eberhard Melchior proved that the average line-length of a simple rank-3 real-representable matroid is less than three.  We discuss a long-overdue analogue of Melchior’s result that the average plane-size of a simple rank-4 real-representable matroid is bounded above by an absolute constant, unless the matroid is the direct-sum of two lines. This is joint work with Rutger Campbell and Matthew Kroeker.

Innovations in Graph Theory and Open Access Journals

A new diamond open access journal has recently launched called Innovations in Graph Theory.  The journal has an excellent editorial board and will be completely free for both authors and readers.  

Innovations in Graph Theory has informed us that matroid theory submissions are very welcome.  All Matroid Union editors are strong proponents of open access publishing, and so we encourage our readers to consider sending their matroid theory papers to Innovations in Graph Theory.  Other topics related to graph theory are also within the new journal’s scope.  Please see the new journal website for more information about how the new journal will function.  The first issue of the journal is expected to appear in 2024.  

We also would like to point out some other open access journals that accept submissions in matroid theory.  These include the Electronic Journal of Combinatorics, Discrete Mathematics & Theoretical Computer Science, Advances in CombinatoricsCombinatorial Theory, and Discrete Analysis. Please feel free to point out other matroid theory friendly journals that are open access in the comments.

Online Talk: Kathryn Nurse

Youtube recording: https://www.youtube.com/watch?v=hr17_7c2QSo

Please advertise this talk at your home institution. Anyone is welcome to attend! 

Time: Wednesday, Oct 18 at 3pm ET
Zoom: https://gatech.zoom.us/j/8802082683

Speaker: Kathryn Nurse, Simon Fraser University
Title: Seymour’s 6-flow theorem – a short proof

Abstract: Tutte conjectured in 1954 that every bridgeless graph has a nowhere-zero 5-flow. In 1982, Seymour showed that it is true when 5 is replaced with 6. In this talk, I present a short variation of Seymour’s proof. This work is joint with Matt DeVos.