University of Cambridge > > Combinatorics Seminar > Finite reflection groups and graph norms

Finite reflection groups and graph norms

Add to your list(s) Download to your calendar using vCal

  • UserDavid Conlon (University of Oxford)
  • ClockThursday 17 November 2016, 14:30-15:30
  • HouseMR12.

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

For any given graph H, we may define a natural corresponding functional ||.||_H. We then say that H is norming if ||.||_H is a semi-norm. A similar notion ||.||_r(H) is defined by || f ||_r(H) := || | f | ||_H and H is said to be weakly norming if ||.||_r(H) is a norm. Classical results show that weakly norming graphs are necessarily bipartite. In the other direction, Hatami showed that even cycles, complete bipartite graphs, and hypercubes are all weakly norming. Using results from the theory of finite reflection groups, we identify a much larger class of weakly norming graphs. This result includes all previous examples of weakly norming graphs and adds many more. We also discuss several applications of our results. In particular, we define and compare a number of generalisations of Gowers’ octahedral norms and we prove some new instances of Sidorenko’s conjecture. Joint work with Joonkyung Lee.

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity