The one-node tree proportion conjecture for quadratic functional graphs
The one-node tree proportion conjecture for quadratic functional graphs
For prime , let be the number of binary trees with nodes attached to cyclic points in the functional graph of . Define
The one-node tree conjecture.
The conjecture is motivated by the observation that approximately half of the nonzero elements of are nonsquares, which should produce a substantial proportion of trees with one node.
Sources & referencesView supporting material
Primary source
Bernard Mans, Min Sha, Igor E. Shparlinski and Daniel Sutantyo, “On Functional Graphs of Quadratic Polynomials”, arXiv:1706.04734 (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
Sign in to submit a solution.
No solutions have been posted yet.