Conlon, D; Lee, J; (2017) Finite reflection groups and graph norms. Advances in Mathematics , 315 pp. 130-165. 10.1016/j.aim.2017.05.009.

Preview

Text reflection.pdf - Published Version Download (538kB) | Preview

Abstract

Given a graph H on vertex set {1, 2, · · · , n} and a function f : [0, 1]2 → R, define kfkH := Z Y ij∈E(H) f(xi , xj )dµ|V (H)| 1/|E(H)| , where µ is the Lebesgue measure on [0, 1]. We say that H is norming if k·kH is a semi-norm. A similar notion k·kr(H) is defined by kfkr(H) := k|f|kH and H is said to be weakly norming if k·kr(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. We demonstrate that any graph whose edges percolate in an appropriate way under the action of a certain natural family of automorphisms is weakly norming. This result includes all previously known examples of weakly norming graphs, but also allows us to identify a much broader class arising from finite reflection groups. We include 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

Download activity - last month

Export as JSONCSVXML

Download activity - last 12 months

Export as CSVXMLJSON

Downloads by country - last 12 months

Export as CSVXMLJSON

Archive Staff Only

View Item