University of Cambridge > Talks.cam > Combinatorics Seminar > Isoperimetry in integer lattices

  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

Isoperimetry in integer lattices

Download to your calendar using vCal

  • UserBen Barber (University of Bristol)
  • ClockThursday 16 November 2017, 14:30-15:30
  • HouseMR12.

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

The edge isoperimetric problem for a graph G is to find, for each n, the minimum number of edges leaving any set of n vertices. Exact solutions are known only in very special cases, for example when G is the usual cubic lattice on Zd, with edges between pairs of vertices at l_1 distance 1. The most attractive open problem was to answer this question for the “strong lattice” on Zd, with edges between pairs of vertices at l_infty distance 1. Whilst studying this question we in fact solved the edge isoperimetric problem asymptotically for every Cayley graph on Z^d. I’ll talk about how to go from the specification of a lattice to a corresponding near-optimal shape, for both this and the related vertex isoperimetric problem, and sketch the key ideas of the proof. Joint work with Joshua Erde.

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

LR 3A, Department of Engineering Senior Parlour, Gonville & Caius College CRUK CRI lecture theatre - (Li Ka Shing Centre - Robinson Way)

Other talks

Title TBC Tea and Coffee Break Title to be confirmed Shining a light on the origin of supermassive black holes with cosmological simulations Director's Briefing Title to be confirmed
 

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