The ceiling of the single-letter entropy method for the union-closed sets conjecture
Statement
Every lower bound on the union-closed constant since Gilmer (2022) — including , Sawin–Yu–Cambie's and Liu's — is certified by the same single-letter inequality: a memoryless protocol coupling two conditional bits, together with a class of admissible joint laws of the two prefix-conditional probabilities. It was not known how far this framework can go: whether it could be pushed to and settle Frankl's conjecture, or whether it has a hard ceiling strictly below it.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.