ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let cc be a parameter, let K(c)K(c) be its filled-in set, and let a coded-coloring be the symbolic coloring procedure used in the source. Let the test point be nonzero. Coded-coloring similarity conjecture. When making coded-colorings of the parameter plane, the smaller the modulus of the non-zero test point, the closer the similarity between the structure in K(c)K(c) near the test point and the structure seen in the coded-coloring of the parameter plane near cc. Any sub-KK's found in this way have sides that approach uniform length as ∣c∣|c| goes to 11. This is an experimentally motivated assertion about the correspondence and geometry of sub-KK structures; no proof or resolution is supplied.

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.