Left-cut-percolation and induced-Sidorenko bigraphs
LN Coregliano - SIAM Journal on Discrete Mathematics, 2024 - SIAM
A Sidorenko bigraph is one whose density in a bigraphon is minimized precisely when is
constant. Several techniques in the literature to prove the Sidorenko property consist of …
constant. Several techniques in the literature to prove the Sidorenko property consist of …
Sidorenko-Type Inequalities for Pairs of Trees
Given two non-empty graphs $ H $ and $ T $, write $ H\succcurlyeq T $ to mean that $ t (H,
G)^{| E (T)|}\geq t (T, G)^{| E (H)|} $ for every graph $ G $, where $ t (\cdot,\cdot) $ is the …
G)^{| E (T)|}\geq t (T, G)^{| E (H)|} $ for every graph $ G $, where $ t (\cdot,\cdot) $ is the …
On norming systems of linear equations
A system of linear equations $ L $ is said to be norming if a natural functional $ t_L (\cdot) $
giving a weighted count for the set of solutions to the system can be used to define a norm …
giving a weighted count for the set of solutions to the system can be used to define a norm …