The branch-count conjecture for total periodic diagrams of perturbed monomial systems
Statement
Let be an integer, let range over primes, and let . The total periodic diagram is the diagram for the first primes, plotting the number of periodic points of for each prime. Branch-count conjecture. The diagram contains as many branches as there are possible values of . This predicts that the observed periodic-point counts separate according to the possible gcd values; the supplied text gives computational examples motivating the claim but does not state a proof or resolution.
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.