arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1909.10987math.COmath.FA
收藏

关于图范数的两点注记

Two remarks on graph norms

Frederik Garbe, Jan Hladký, Joonkyung Lee

摘要:

对于图$H$,它在图中的同态密度自然地扩展到$L^p$中的二元对称函数$W$的空间,即$p\geq e(H)$,记为$t(H,W)$ .然后可以定义相应的泛函$\|W\|_{H}:=|t(H,W)|^{1/e(H)}$和$\|W\|_{r(H)}:=t(H,|W|)^{1/e(H)}$,并说如果$\|.\|_{H}$是(半)范数,则$H$是(半)赋范的,如果$\|.\|_{r(H)}$是范数,则$H$是弱赋范的。我们得到两个结果,有助于(弱)赋范图的理论。首先,回答了Hatami关于$\|.\|_{H}$的凸性模和光滑模的估计问题,证明了在$H$弱赋范的条件下,$\|.\|_{r(H)}$不是一致凸的,也不是一致光滑的.其次,证明了无孤立点的图$H$是(弱)赋范的当且仅当每个分支是(弱)赋范图的同构副本。这个强大的因式分解结果使我们能够假设$H$的连通性时,研究图规范。特别是,我们纠正了一个错误,在原来的声明上述定理的哈塔米。

英文摘要:

For a graph $H$, its homomorphism density in graphs naturally extends to the space of two-variable symmetric functions $W$ in $L^p$, $p\geq e(H)$, denoted by $t(H,W)$. One may then define corresponding functionals $\|W\|_{H}:=|t(H,W)|^{1/e(H)}$ and $\|W\|_{r(H)}:=t(H,|W|)^{1/e(H)}$ and say that $H$ is (semi-)norming if $\|.\|_{H}$ is a (semi-)norm and that $H$ is weakly norming if $\|.\|_{r(H)}$ is a norm. We obtain two results that contribute to the theory of (weakly) norming graphs. Firstly, answering a question of Hatami, who estimated the modulus of convexity and smoothness of $\|.\|_{H}$, we prove that $\|.\|_{r(H)}$ is not uniformly convex nor uniformly smooth, provided that $H$ is weakly norming. Secondly, we prove that every graph $H$ without isolated vertices is (weakly) norming if and only if each component is an isomorphic copy of a (weakly) norming graph. This strong factorisation result allows us to assume connectivity of $H$ when studying graph norms. In particular, we correct an error in the original statement of the aforementioned theorem by Hatami.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑