On the logarithmic calculus and Sidorenko's conjecture

IF 0.6 3区数学 Q3 MATHEMATICS

Acta Mathematica Hungarica Pub Date : 2026-03-01 DOI:10.1007/s10474-026-01582-2

X. Li, B. Szegedy

引用次数: 0

Abstract

We study a type of calculus for proving inequalities between subgraph densities that is based on Jensen's inequality for the logarithmic function. As a demonstration of the method we verify the conjecture of Erdös-Simonovits and Sidorenko for various families of graphs. In particular we give a short analytic proof for a result by Conlon, Fox and Sudakov. Using this, we prove the forcing conjecture for bipartite graphs in which one vertex is complete to the other side.

查看原文本刊更多论文

关于对数演算和西多连科猜想

基于对数函数的Jensen不等式，研究了一种证明子图密度间不等式的微积分方法。为了证明该方法，我们验证了Erdös-Simonovits和Sidorenko对各种图族的猜想。特别地，我们对Conlon， Fox和Sudakov的结果给出了一个简短的解析证明。在此基础上，证明了一个顶点与另一侧完全的二部图的强迫猜想。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Acta Mathematica Hungarica 数学-数学

CiteScore

1.50

自引率

11.10%

发文量

审稿时长

4-8 weeks

期刊介绍： Acta Mathematica Hungarica is devoted to publishing research articles of top quality in all areas of pure and applied mathematics as well as in theoretical computer science. The journal is published yearly in three volumes (two issues per volume, in total 6 issues) in both print and electronic formats. Acta Mathematica Hungarica (formerly Acta Mathematica Academiae Scientiarum Hungaricae) was founded in 1950 by the Hungarian Academy of Sciences.