当前位置: X-MOL 学术Combinatorica › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Weakly Norming Graphs are Edge-Transitive
Combinatorica ( IF 1.1 ) Pub Date : 2020-07-31 , DOI: 10.1007/s00493-020-4468-3
Alexander Sidorenko

Let ℋ be the class of bounded measurable symmetric functions on [0, 1] 2 . For a function h ∈ ℋ and a graph G with vertex set [ v 1 ,⌦, v n } and edge set E ( G ), define $${t_G}(h) = \int \cdots \int {\prod\limits_{{\rm{\{ }}{v_i}{\rm{,}}{v_j}{\rm{\} }} \in E(G)} {h({x_i},{x_j})\;d{x_1} \cdots d{x_n}} } .$$ t G ( h ) = ∫ ⋯ ∫ ∏ { v i , v j } ∈ E ( G ) h ( x i , x j ) d x 1 ⋯ d x n . Answering a question raised by Conlon and Lee, we prove that in order for t G (∣ h ∣) 1/∣ E ( G )∣ to be a norm on ℋ , the graph G must be edge-transitive.

中文翻译:

弱规范图是边传递的

令 ℋ 是 [0, 1] 2 上的有界可测对称函数类。对于函数 h ∈ ℋ 和具有顶点集 [ v 1 ,⌦, vn } 和边集 E ( G ) 的图 G,定义 $${t_G}(h) = \int \cdots \int {\prod\limits_ {{\rm{\{ }}{v_i}{\rm{,}}{v_j}{\rm{\} }} \in E(G)} {h({x_i},{x_j})\; d{x_1} \cdots d{x_n}} } .$$ t G ( h ) = ∫ ⋯ ∫ ∏ { vi , vj } ∈ E ( G ) h ( xi , xj ) dx 1 ⋯ dxn 。回答 Conlon 和 Lee 提出的一个问题,我们证明为了使 t G (∣ h ∣) 1/∣ E ( G )∣ 成为 ℋ 上的范数,图 G 必须是边传递的。
更新日期:2020-07-31
down
wechat
bug