On Graham's rearrangement conjecture
Organizers
Jie Ma
, Benjamin Sudakov
Speaker
Matija Bucic
Time
Tuesday, November 11, 2025 5:05 PM - 6:15 PM
Venue
Online
Online
Zoom 787 662 9899
(BIMSA)
Abstract
A well-known question in combinatorial group theory, going back to a conjecture of Graham from 1971, asks if given a subset S of some group $(G,+)$, it is possible to order $S$ as $s_1, s_2,..., s_t$ so that the partial sums $s_1 + s_2 + ... + s_j$ are all distinct for each $j < t$. We discuss recent progress on this question based on a synergy between ideas from additive combinatorics and graph theory.
Based on a joint work with: Benjamin Bedert, Alp Muyesser, Noah Kravitz, and Richard Montgomery
Based on a joint work with: Benjamin Bedert, Alp Muyesser, Noah Kravitz, and Richard Montgomery
Speaker Intro
Matija Bucic is an Assistant professor in Mathematics at Princeton University. Before his current position, he studied at the University of Cambridge, received his PhD from ETH Zurich, and held a Veblen Research Instructorship, a joint position between IAS and Princeton. His research focuses on extremal and probabilistic combinatorics, as well as their applications to other areas of combinatorics and computer science.