Subexponential end time conjecture for diffusion limited aggregation in the Boolean lattice

Let tendt_{\mathrm{end}} denote the time at which the diffusion limited aggregation process reaches its terminal stage in the Boolean lattice on nn elements. Subexponential end time conjecture. The end time satisfies

tend=o(2n).t_{\mathrm{end}}=o(2^n).

The paper presents this as a likely consequence of empirical evidence, in the context of understanding the process between its beginning and end. No proof or resolution is provided here.

Sources & referencesView supporting material

Primary source

Alan Frieze and Wesley Pegden, “Diffusion limited aggregation in the Boolean lattice”, arXiv:1705.00692 (2017).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.