Problems list for the K3@MIT Gathering
Problems list for the K3@MIT Gathering
Thanks to all event participants for submitting problems! The submissions were used to create the following list of problems, designed to reflect the participants' interests and lead to an effective workshop. On the first day of the event, we will follow a voting procedure to form research groups of 3-6 people each focused on a single problem from this list. Regardless of whether or not you plan to participate in the workshop, if you or someone you know has been making progress on a listed problem and would like it removed from the list to avoid competition, please reach out to the organizers!
(Update) On the first day of the conference, we hosted a problem session in which participants were placed into working groups. This began with a vote to gauge interest: participants could vote as many times as they wanted and were expected to vote for all problems they thought were interesting. These vote totals are recorded in brackets next to each problem. The nine problems which ultimately formed a group are listed here with an exclamation point.
Between the top-voted problems and those lesser-voted problems which nonetheless formed a group, our participants' interests were extremely broad, spanning small exotica, Lefschetz fibrations, unknotting number, Fintushel-Stern knot surgery, Khovanov homology, Ricci curvature, homology cobordism, compact Lie group actions, homotopy theory of 2-knots, and problems about symplectic and Kรคhler structures. This represents the continued culture of rich and varied interest among those in our field, and we encourage others in low-dimensional topology to remain committed to engaging with others across a diverse set of subfields.
Section 1:
1.3 (7)
1.4! (11)
1.6 (4)
1.11 (2)
1.15 (2)
1.21 (5)
1.30! (12)
1.39 (5)
1.41 (8)
1.58 (6)
1.60 (11)
Section 2:
2.7 (6)
2.20! (13)
2.24 (8)
2.27 (3)
2.48 (5)
5.15! (5)
Section 3:
3.41 (5)
3.45 (2)
3.54 (6)
3.62 (4)
3.71! (6)
Section 4:
4.3! (12)
4.4 (15)
4.7 // 4.14! (7)
4.9 (4)
4.10 (6)
4.19 (6)
4.24 (6)
4.25 // 4.28 (6)
4.34 (6)
4.36! (6)
4.60 (3)
4.66 (7)
4.82 (8)
4.85 (7)
4.89 (9)
4.90 // 4.92! (12)
4.93 (9)
4.94 (6)
4.98 (8)
4.99 // 4.8 (13)
4.103 (5)
Problems with slashes are problems we have combined, where we felt it would not be beneficial to have two groups working separately on the two problems because of their close relationship.
The event was organized by Ayodeji Lindblad, Ollie Thakar, and Evan Scott. If you have any questions, please contact us at organizers-K3@MIT.edu