Answers are grounded in this paper and cite their sources.
Consider the uniform measure μ on words with m colours, each appearing r times, and assign unit weight to every unordered pair of coordinates. If $Q(f)$ is the sum of the pair conditional entropies, we prove that the largest coefficient κ in _μ(f)≤ Q(f) is m2r²log 2/log((mr)!/(r!)ᵐ). A singleton indicator attains equality. This establishes the balanced case of the multicolour formula proposed by Bristiel and Caputo and determines the optimal logarithmic edge-expansion coefficient of the associated transposition graph. The proof combines their exact Bernoulli--Laplace entropy constant with Salez's conditioning on the complete position set of one colour. Equal multiplicities make the resulting induction close without loss. We also record the resulting classical log-Sobolev bounds and give a self-contained proof of the known binary input.
No takes yet. Share an insight, caveat, or question.
Sam Vaseghi (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: