Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 67 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 21 tok/s Pro
GPT-5 High 16 tok/s Pro
GPT-4o 92 tok/s Pro
Kimi K2 191 tok/s Pro
GPT OSS 120B 461 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

Canonical heights and preperiodic points for weighted homogeneous families of polynomials (1510.08807v3)

Published 29 Oct 2015 in math.NT

Abstract: A family $f_t(z)$ of polynomials over a number field $K$ will be called \emph{weighted homogeneous} if and only if $f_t(z)=F(ze, t)$ for some binary homogeneous form $F(X, Y)$ and some integer $e\geq 2$. For example, the family $zd+t$ is weighted homogeneous. We prove a lower bound on the canonical height, of the form [\hat{h}{f_t}(z)\geq \epsilon \max{h{\mathsf{M}d}(f_t), \log|\operatorname{Norm}\mathfrak{R}{f_t}|},] for values $z\in K$ which are not preperiodic for $f_t$. Here $\epsilon$ depends only on the number of places at which $f_t$ has bad reduction. For suitably generic morphisms $\varphi:\mathbb{P}1\to \mathbb{P}1$, we also prove an absolute bound of this form for $t$ in the image of $\varphi$ over $K$ (assuming the $abc$ Conjecture), as well as uniform bounds on the number of preperiodic points (unconditionally).

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube