Bounded Sidorenko exponents for higher-uniformity tight cycles

For each integer r4r\geq 4, let Cr(r)C^{(r)}_{r\ell} denote the rr-uniform tight cycle with rr\ell edges, and let s(F)s(F) denote the Sidorenko exponent of a hypergraph FF. Conjecture on higher-uniformity tight cycles. For all r4r\geq 4, there is a constant KrK_r depending only on rr such that, for every 2\ell\geq 2,

s(Cr(r))Krr.s\left(C^{(r)}_{r\ell}\right)\leq K_r r\ell.

This proposes the higher-uniformity analogue of the paper's upper bound for 33-uniform tight cycles. The authors explicitly say that they could not find reasonable upper bounds in these cases, so the assertion remains open.

Sources & referencesView supporting material

Primary source

Hyunwoo Lee, “On Sidorenko exponents of hypergraphs”, arXiv:2509.08680 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.