University of Cambridge > Talks.cam > Combinatorics Seminar > On Graham's rearrangement conjecture

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

On Graham's rearrangement conjecture

Download to your calendar using vCal

  • UserMatija Bucic (Vienna)
  • ClockThursday 12 February 2026, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact .

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 joint work with Benjamin Bedert, Noah Kravitz, Richard Montgomery and Alp Muyesser.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Lewin Stroke &amp; Rehabilitation Unit, Seminar Room, R2, Addenbrooke's Hospital Average on weekdays: 9224.89107764 kWh Wednesday Seminars - Department of Computer Science and Technology

Other talks

Group Presentation 1 Emergency Medicine and Metabolic Medicine Claudia Ribeiro Almeida, Group Leader, Babraham Institute Title abstract tbc Cooperation for Nature Tea and Coffee Break
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity