ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Fix a positive integer r≥3r\ge 3. For each n>rn>r, let Cn,r\mathcal{C}_{n,r} be the circular rr-uniform hypergraph on nn vertices whose edges are all paths of size rr in a cycle, and let XCn,rX_{\mathcal{C}_{n,r}} count the vertices with non-zero in-degree after independent uniform random orientations of its edges. Circular-hypergraph entropy-growth conjecture. For all n>rn>r,

H(XCn,r)≥12log⁡(nr)−O(1).H(X_{\mathcal{C}_{n,r}})\ge \frac{1}{2}\log\left(\frac{n}{r}\right)-O(1).

This predicts logarithmic entropy growth for the circular construction at fixed rr, 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.