Finite reflection groups and graph norms
Finite reflection groups and graph norms
复制标题
DOI:
10.1016/j.aim.2017.05.009
复制
发表时间:
2017-07-31
影响因子:
1.7
通讯作者:
Lee, Joonkyung
中科院分区:
文献类型:
--
作者:
Conlon, David;Lee, Joonkyung
Given a graph H on vertex set {1, 2, center dot center dot center dot , n} and a function f : [0,1](2) -> R, defineparallel to f parallel to(H) :=vertical bar integral Pi(ij is an element of E(H)) f(x(i),x(j))d mu(vertical bar V(H)vertical bar)vertical bar(1/vertical bar E(H)vertical bar) , where mu is the Lebesgue measure on [0,1]. We say that H is norming if parallel to center dot parallel to(H) is a semi-norm. A similar notion parallel to center dot parallel to(r(H)) is defined by parallel to f parallel to(r(H)) := parallel to vertical bar f vertical bar parallel to(H) and H is said to be weakly norming if parallel to center dot parallel to(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. We demonstrate that any graph whose edges percolate in an appropriate way under the action of a certain natural family of automorpbisms is weakly forming. 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. (C) 2017 Elsevier Inc. All rights reserved.