Weakly norming graphs are edge-transitive

preprint2020arXivOpen access

Abstract

Let H\mathcal{H} be the class of bounded measurable symmetric functions on [0,1]2[0,1]^2. For a function h∈Hh \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) dx1⋯dxn . 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.