Related papers: Preperiodic points for quadratic polynomials over …

Given a number field $K$ and a polynomial $f(z) \in K[z]$, one can naturally construct a finite directed graph $G(f,K)$ whose vertices are the $K$-rational preperiodic points of $f$, with an edge $\alpha \to \beta$ if and only if $f(\alpha)…

Given a number field $K$ and a polynomial $f(z) \in K[z]$ of degree at least 2, one can construct a finite directed graph $G(f,K)$ whose vertices are the $K$-rational preperiodic points for $f$, with an edge $\alpha \to \beta$ if and only…

Given a global field K and a polynomial f defined over K of degree at least two, Morton and Silverman conjectured in 1994 that the number of K-rational preperiodic points of f is bounded in terms of only the degree of K and the degree of f.…

Given a function $f$ in a finite field ${\mathbb F}_q$ of $q$ elements, we define the functional graph of $f$ as a directed graph on $q$ nodes labelled by the elements of ${\mathbb F}_q$ where there is an edge from $u$ to $v$ if and only if…

We classify the graphs that can occur as the graph of rational preperiodic points of a quadratic polynomial over $\bold Q$, assuming the conjecture that it is impossible to have rational points of period $4$ or higher. In particular, we…

Motivated by the dynamical uniform boundedness conjecture of Morton and Silverman, specifically in the case of quadratic polynomials, we give a formal construction of a certain class of dynamical analogues of classical modular curves. The…

Let $K$ be a number field. Given a polynomial $f(x)\in K[x]$ of degree $d\ge 2$, it is conjectured that the number of preperiodic points of $f$ is bounded by a uniform bound that depends only on $d$ and $[K:\mathbb Q]$. However, the only…

Among all the dynamical modular curves associated to quadratic polynomial maps, we determine which curves have infinitely many quadratic points. This yields a classification statement on preperiodic points for quadratic polynomials over…

Let K be a function field in one variable over an arbitrary field F. Given a rational function f(z) in K(z) of degree at least two, the associated canonical height on the projective line was defined by Call and Silverman. The preperiodic…

Let $K$ be a function field of characteristic $p\geq0$ or a number field over which the $abc$ conjecture holds, and let $\phi(x)=x^d+c \in K[x]$ be a unicritical polynomial of degree $d\geq2$ with $d \not\equiv 0,1\pmod{p}$. We completely…

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…

Motivated by a uniform boundedness conjecture of Morton and Silverman, we study the graphs of pre-periodic points for maps in three families of dynamical systems, namely the collections of rational functions of degree two having a periodic…

Let X be a smooth curve defined over the algebraic numbers, let a,b be algebraic numbers, and let f_l(x) be an algebraic family of rational maps indexed by all l in X. We study whether there exist infinitely many l in X such that both a and…

We provide a complete classification of possible graphs of rational preperiodic points of endomorphisms of the projective line of degree 2 defined over the rationals with a rational periodic critical point of period 2, under the assumption…

We define totally-isotropic polynomials of alternating matrix spaces over finite fields, by analogy with independence polynomials of graphs. Our main result shows that totally-isotropic polynomials of graphical alternating matrix spaces…

Let $K$ be a number field, $f\in K[x]$ a quadratic polynomial, and $n\in\{1,2,3\}$. We show that if $f$ has a point of period $n$ in every non-archimedean completion of $K$, then $f$ has a point of period $n$ in $K$. For $n\in\{4,5\}$ we…

In the past decades for more and more graph classes the Graph Isomorphism Problem was shown to be solvable in polynomial time. An interesting family of graph classes arises from intersection graphs of geometric objects. In this work we show…

Let $K$ be a function field over an algebraically closed field $k$ of characteristic $0$, let $\varphi\in K(z)$ be a rational function of degree at least equal to $2$ for which there is no point at which $\varphi$ is totally ramified, and…

Gcd-graphs over the ring of integers modulo $n$ are a simple and elegant class of integral graphs. The study of these graphs connects multiple areas of mathematics, including graph theory, number theory, and ring theory. In a recent work,…

The domination polynomial of a graph $G$ is given by $D(G,x)=\sum_{k=0}^{n} d_k(G)x^k$ where $d_k(G)$ records the number of $k$-element dominating sets in $G$. A conjecture of Alikhani and Peng asserts that these polynomials have unimodal…