The asymptotic conjecture for connected functional graphs of quadratic polynomials
Statement
Let be a prime, and let denote the number of parameters for which the functional graph associated with the quadratic polynomial is connected. The computations use the connectedness-testing algorithm described above and the corresponding values of . Asymptotic conjecture.
This conjecture is based on computational data for selected primes and predicts the asymptotic growth of the number of connected functional graphs in this family. The supplied text gives no proof or resolution, so its status 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.