ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let fˉlog⁡(n)\bar{f}_{\log}(n) denote the average logarithmic integer complexity, and let αave\alpha_{ave} be the corresponding limiting average complexity. Say that a number nn collapses when powers of nn have unexpectedly low integer complexity. The conjecture is stated in the context of treating nkn^k as random.

Collapse conjecture. If

fˉlog⁡(n)<αave,\bar{f}_{\log}(n)<\alpha_{ave},

then nn is unlikely to collapse.

This claim appears inside an ignored passage and is presented heuristically rather than as a proved theorem. The source supplies no resolution, so it remains open.

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.