Dice Question Streamline Icon: https://streamlinehq.com

Interpretation of σ-independence from the longest forbidden chain for r≥3

Ascertain a clear interpretation, for r ≥ 3, of why in the generalized LYM inequalities and corresponding bounds for families of r-decompositions with componentwise t_k-chain-free constraints, the parameter σ = (t_1 t_2 ··· t_r) / max{t_1, …, t_r} is independent of max{t_k}, so that the component with the longest forbidden chain does not affect the inequalities or the resulting upper bounds.

Information Square Streamline Icon: https://streamlinehq.com

Background

The paper introduces generalized LYM inequalities for families of r-decompositions in several lattice settings where each component D_k is t_k-chain free, possibly with different t_k. The resulting bounds depend on σ = (t_1 t_2 ··* t_r) / max{t_1, …, t_r}, which is independent of the largest t_k.

The authors note that for r = 2 there is a simple explanation: if D_1 is t_1-chain free, then D_2 is automatically t_1-chain free, hence also t_2-chain free when t_1 ≤ t_2. For r ≥ 3, they state that a clear interpretation of why the longest forbidden chain is irrelevant to the bounds remains elusive.

References

In other words, these resulting inequalities and upper bounds remain unchanged no matter how large {t_1, \ldots, t_r} is. For r=2, this phenomenon admits a straightforward interpretation: by the definition of the 2-decomposition, if \mathcal{D}_1 is t_1-chain free, then \mathcal{D}_2 is also t_1-chain free; consequently, \mathcal{D}_2 is trivially t_2-chain free when t_1 \leq t_2. When r\geq 3, however, a clear interpretation of this phenomenon remains elusive.

Very Generalized LYM Inequality (2509.21024 - Huang et al., 25 Sep 2025) in Remark, Section 2 (Main results)