English
Related papers

Related papers: Computing points of small height for cubic polynom…

200 papers

Let $F$ be a univariate polynomial or rational fraction of degree $d$ defined over a number field. We give bounds from above on the absolute logarithmic Weil height of $F$ in terms of the heights of its values at small integers: we review…

Number Theory · Mathematics 2022-10-11 Jean Kieffer

Let $P$ and $Q$ be polynomials in one variable over an algebraically closed field $k$ of characteristic zero. Let $f$ and $g$ be elements of a function field $\K$ over $k$ such that $P(f)=Q(g).$ We give conditions on $P$ and $Q$ such that…

Complex Variables · Mathematics 2020-04-23 Ta Thi Hoai An , Nguyen Ngoc Diep

Let X be a finite set of points in R^n. A polynomial p nonnegative on X can be written as a sum of squares of rational functions modulo the vanishing ideal I(X). From the point of view of applications, such as polynomial optimization, we…

Algebraic Geometry · Mathematics 2014-02-19 Grigoriy Blekherman , João Gouveia , James Pfeiffer

Let n be a positive integer. We consider the Sylvester Resultant of f and g, where f is a generic polynomial of degree 2 or 3 and g is a generic polynomial of degree n. If f is a quadratic polynomial, we find the resultant's height. If f is…

Number Theory · Mathematics 2007-05-23 Carlos D'Andrea , Kevin G. Hare

Let $\Gamma$ be a finitely generated subgroup of the multiplicative group $\G_m^2(\bar{Q})$. Let $p(X,Y),q(X,Y)\in\bat{Q}$ be two coprime polynomials not both vanishing at $(0,0)$; let $\epsilon>0$. We prove that, for all $(u,v)\in\Gamma$…

Number Theory · Mathematics 2007-05-23 Pietro Corvaja , Umberto Zannier

Let $F(x_1,...,x_n)$ be a form of degree $d\geq 2$, which produces a geometrically irreducible hypersurface in $\mathbb{P}^{n-1}$. This paper is concerned with the number of rational points on F=0 which have height at most $B$. Whenever…

Number Theory · Mathematics 2007-05-23 T. D. Browning , D. R. Heath-Brown

Let $H^d$ be the set of all rational maps of degree $d\ge 2$ on the Riemann sphere which are expanding on Julia set. We prove that if $f\in H^d$ and all or all but one critical points (or values) are in the immediate basin of attraction to…

Dynamical Systems · Mathematics 2016-09-06 Feliks Przytycki

We give an algorithm which requires no integer factorization for computing the canonical height of a point in $\mathbb{P}^1(\mathbb{Q})$ relative to a morphism $\phi: \mathbb{P}_{\mathbb{Q}}^1 \rightarrow \mathbb{P}_{\mathbb{Q}}^1$ of…

Number Theory · Mathematics 2016-02-17 Elliot Wells

In this paper we study two questions related to exceptional behavior of preperiodic points of polynomials in $\mathbb{Q}[x]$. We show that for all $d\geq 2$, there exists a polynomial $f_d(x) \in \mathbb{Q}[x]$ with $2\leq \mathrm{deg}(f_d)…

Dynamical Systems · Mathematics 2022-07-19 John R. Doyle , Trevor Hyde

Let $f: \mathbb{A}^2 \to \mathbb{A}^2$ be a polynomial automorphism of dynamical degree $\delta \geq 2$ over a number field $K$. (This is equivalent to say that $f$ is a polynomial automorphism that is not triangularizable.) Then we…

Number Theory · Mathematics 2007-05-23 Shu Kawaguchi

The second author proved that the set of post-critically finite polynomials of given degree is a set of bounded height, up to change of variables. Motivated by an observation about unicritical polynomials, we complement this by proving that…

Number Theory · Mathematics 2022-10-27 Benjamin Fraser , Patrick Ingram

Let $K/\mathbb{Q}$ be a finite extension. We prove that the minimal height of polynomials of degree $n$ of which all roots are in $K^\times$ increases exponentially in $n$. We determine the implied constant exactly for totally real $K$ and…

Number Theory · Mathematics 2025-09-16 Thian Tromp

We provide an asymptotic estimate for the number of rational points of bounded height on a non-singular conic over the rationals. The estimate is uniform in the coefficients of the underlying quadratic form.

Number Theory · Mathematics 2018-07-17 Efthymios Sofos

We consider the polynomials $\displaystyle f(x)=x^d+c$, where $d\ge 2$ and $c\in\mathbb Q$. It is conjectured that if $d=2$, then $f$ has no rational periodic point of exact period $N\ge 4$. In this note, fixing some integer $d\ge 2$, we…

Number Theory · Mathematics 2018-04-27 Mohammad Sadek

We prove a lower bound that agrees with Manin's prediction for the number of rational points of bounded height on the Fermat cubic surface. As an application we provide a simple counterexample to Manin's conjecture over the rationals.

Number Theory · Mathematics 2014-02-04 Efthymios Sofos

Let $k$ be a finite field extension of the function field $\bfF_p(T)$ and $\bar{k}$ its algebraic closure. We count points in projective space $\Bbb P ^{n-1}(\bar{k})$ with given height and of fixed degree $d$ over the field $k$. If…

Number Theory · Mathematics 2014-02-26 Jeffrey Lin Thunder , Martin Widmer

Let $F$ be a number field. Given a quadratic polynomial $f_c(z) = z^2 + c \in F[z]$, we can construct a directed graph $Preper(f_c, F)$ (also called a portrait), whose vertices are $F$-rational preperiodic points for $f_c$, with an edge…

Number Theory · Mathematics 2024-10-08 Ho Chung Siu

This paper discusses the number of points for which the dynamical canonical height is less than or equal to a given value. The height function is a fundamental and important tool in number theory to capture the ``number-theoretic…

Number Theory · Mathematics 2024-04-02 Kohei Takehira

We consider the notions of (i) critical points, (ii) second-order points, (iii) local minima, and (iv) strict local minima for multivariate polynomials. For each type of point, and as a function of the degree of the polynomial, we study the…

Optimization and Control · Mathematics 2021-06-17 Amir Ali Ahmadi , Jeffrey Zhang

The purpose of this note is give some evidence in support of conjectures of Poonen, and Morton and Silverman, on the periods of rational numbers under the iteration of quadratic polynomials. In particular, Poonen conjectured that there are…

Dynamical Systems · Mathematics 2010-04-14 Benjamin Hutz , Patrick Ingram