Effective bounds for the number of totally real parameters producing preperiodicity
Develop effective, computable, or uniform upper bounds for the cardinality of Prep(a) ∩ Q_tr, where Prep(a)={c∈C: a is preperiodic for f_c(x)=x^2+c}, in the regime a ∈ (−2,2) ∩ Q. Current arguments via arithmetic equidistribution establish finiteness but offer no quantitative control on the number of such totally real parameters c.
References
The arithmetic equidistribution theorem used to derive the finiteness of Prep(a)nQtr (cf. Remark 4.2) does not provide an effective result as we have no control over the number of parameters c E Qtr such that a E Q is fe-preperiodic. It is reasonable to give an effective computable bounds or uniform bounds for the size of Prep(a) n Qtr when a € (-2, 2) n Q in light of DeMarco-Krieger-Ye [DKY22] and Fili [Fi17] building upon the quantitative equidistribution theorem of Favre-Rivera-Letelier [FRL06].