English

Weakly norming graphs are edge-transitive

Combinatorics 2020-09-18 v2

Abstract

Let H\mathcal{H} be the class of bounded measurable symmetric functions on [0,1]2[0,1]^2. For a function hHh \in \mathcal{H} and a graph GG with vertex set {v1,,vn}\{v_1,\ldots,v_n\} and edge set E(G)E(G), define tG(h)  =  {vi,vj}E(G)h(xi,xj)dx1dxn. t_G(h) \; = \; \int \cdots \int \prod_{\{v_i,v_j\} \in E(G)} h(x_i,x_j) \: dx_1 \cdots dx_n \: . Answering a question raised by Conlon and Lee, we prove that in order for tG(h)1/E(G)t_G(|h|)^{1/|E(G)|} to be a norm on H\mathcal{H}, the graph GG must be edge-transitive.

Keywords

Cite

@article{arxiv.2003.13598,
  title  = {Weakly norming graphs are edge-transitive},
  author = {Alexander Sidorenko},
  journal= {arXiv preprint arXiv:2003.13598},
  year   = {2020}
}

Comments

to appear in "Combinatorica"

R2 v1 2026-06-23T14:32:18.254Z