ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Consider the toy genetics process in which an amoeba has a DNA configuration of length nn, and each generation produces two offspring through independently activated crossover symbols. Call an amoeba free if its DNA consists of all different bases. Free-amoeba diversification conjecture. There exists a constant c>0c>0 such that, starting with any DNA configuration of length nn, the probability that there is a free amoeba at generation clog⁡nc\log n is at least 1/21/2.

The conjecture formalizes the heuristic that the number of distinct bases roughly doubles each generation. It is introduced as a step toward controlling fixed-word evaluations in the iterated wreath products; no proof is given.

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.