Entropy lower-bound conjecture for circular hypergraphs
Statement
Fix a positive integer . For each , let be the circular -uniform hypergraph on vertices whose edges are all paths of size in a cycle, and let count the vertices with non-zero in-degree after independent uniform random orientations of its edges. Circular-hypergraph entropy-growth conjecture. For all ,
This predicts logarithmic entropy growth for the circular construction at fixed , complementing the paper's proved bounds in special cases; it remains open in the stated generality.
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.