English
Related papers

Related papers: Cycles for rational maps over global function fiel…

200 papers

Let $f(x) \in \mathbb{F}_p[x]$, and define the orbit of $x\in \mathbb{F}_p$ under the iteration of $f$ to be the set \[ \mathcal{O}(x):=\{x,f(x),(f\circ f)(x),(f\circ f\circ f)(x),\dots\}. \] An orbit is a $k$-cycle if it is periodic of…

Number Theory · Mathematics 2024-10-02 Jonathan Root

Periodic orbits and cycles, respectively, play a significant role in discrete- and continuous-time dynamical systems (i.e. maps and flows). To succinctly describe their shifts when the system is applied perturbation, the notions of…

Dynamical Systems · Mathematics 2024-11-12 Wenyin Wei , Alexander Knieps , Yunfeng Liang

In this article, we study the behaviour of discrete one-dimensional dynamical systems associated to functions on finite sets. We formalise the global orbit pattern formed by all the periodic orbits (gop) as the ordered set of periods when…

Dynamical Systems · Mathematics 2009-07-12 Rene Lozi , Clarisse Fiol

Explicit formulas are obtained for the number of periodic points and maximum tail length of split polynomial maps over finite fields for affine and projective space. This work includes a detailed analysis of the structure of the directed…

Dynamical Systems · Mathematics 2022-08-10 Benjamin Hutz , Teerth Patel

Let K be a number field or a function field, let F:P^1 --> P^1 be a rational map of degree at least two defined over K, let P be a point in P^1(K) having infinite F-orbit, and let Z be a finite subset of Z. We prove a local-global criterion…

Number Theory · Mathematics 2015-05-13 Joseph H. Silverman , José Felipe Voloch

In this paper, the study of the global orbit pattern (gop) formed by all the periodic orbits of discrete dynamical systems on a finite set $X$ allows us to describe precisely the behaviour of such systems. We can predict by means of closed…

Dynamical Systems · Mathematics 2015-05-13 R. Lozi , C. Fiol

Let $K$ be a number field, let $\phi \in K(t)$ be a rational map of degree at least 2, and let $\alpha, \beta \in K$. We show that if $\alpha$ is not in the forward orbit of $\beta$, then there is a positive proportion of primes ${\mathfrak…

Algebraic Geometry · Mathematics 2011-07-15 Robert L. Benedetto , Dragos Ghioca , Benjamin Hutz , Pär Kurlberg , Thomas Scanlon , Thomas J. Tucker

For a morphism $f:\P^N \to \P^N$, the points whose forward orbit by $f$ is finite are called preperiodic points for $f$. This article presents an algorithm to effectively determine all the rational preperiodic points for $f$ defined over a…

Number Theory · Mathematics 2013-07-04 Benjamin Hutz

The study of rational point sets on circles over the Euclidean plane is discussed in a more general framework, i.e. we generalize the notion rational and consider these circular point sets over arbitrary fields. We also determine the…

Combinatorics · Mathematics 2024-11-04 Chris Busenhart

We study the algebraic dynamical systems generated by triangular systems of rational functions and estimate the height growth of iterations generated by such systems. Further, using a result on the reduction modulo primes of systems of…

Number Theory · Mathematics 2021-02-09 Sudhansu Sekhar Rout

Let F : V --> V be a self-morphism of a quasiprojective variety defined over a number field K and let P be a point in V(K) with infinite orbit under iteration of F. For each prime ideal p of good reduction, let m_p(F,P) be the size of the…

Number Theory · Mathematics 2011-05-30 Joseph H. Silverman

Let $K$ be a number field and let $\phi$ in $K(z)$ be a rational function of degree $d\geq 2$. Let $S$ be the places of bad reduction for $\phi$ (including the archimedan places). Let $Per(\phi,K)$, $PrePer(\phi, K)$, and $Tail(\phi,K)$ be…

Number Theory · Mathematics 2017-04-20 Sebastian Troncoso

Given a rational function of degree at least two defined over a number field k, we study the cardinality of the set of rational iterated preimages. We prove bounds for the cardinality of this set as the rational function varies in certain…

Number Theory · Mathematics 2011-09-29 Aaron Levin

We prove a dynamical Shafarevich theorem on the finiteness of the set of isomorphism classes of rational maps with fixed degeneracies. More precisely, fix an integer d at least 2 and let K be either a number field or the function field of a…

Algebraic Geometry · Mathematics 2017-05-17 Lucien Szpiro , Lloyd West

Planar piecewise linear systems with two linearity zones separated by a straight line and with a periodic orbit at infinity are considered. By using some changes of variables and parameters, a reduced canonical form with five parameters is…

Dynamical Systems · Mathematics 2020-10-08 Emilio Freire , Enrique Ponce , Joan Torregrosa , Francisco Torres

Let $K$ be a number field, let $S$ be a finite set of places of $K$, and let $R_S$ be the ring of $S$-integers of $K$. A $K$-morphism $f:\mathbb{P}^1_K\to\mathbb{P}^1_K$ has simple good reduction outside $S$ if it extends to an…

Number Theory · Mathematics 2018-03-28 Joseph H. Silverman

Answering a question posed by Adam Epstein, we show that the collection of conjugacy classes of polynomials admitting a parabolic fixed point and at most one infinite critical orbit is a set of bounded height in the relevant moduli space.…

Number Theory · Mathematics 2017-06-19 Patrick Ingram

Given a number field $K$ and a finite set $S$ of places of $K$, the first main result of this paper shows that the quadratic rational maps $\phi:{\mathbb P}^1\to{\mathbb P}^1$ defined over $K$ which have good reduction at all places outside…

Number Theory · Mathematics 2017-03-30 Clayton Petsche , Brian Stout

We prove the first, even super-polynomial, lower bounds on the size of tropical (min,+) and (max,+) circuits approximating given optimization problems. Many classical dynamic programming (DP) algorithms for optimization problems are pure in…

Computational Complexity · Computer Science 2020-12-24 Stasys Jukna , Hannes Seiwert

We obtain sharp bounds for the number of n--cycles in a finite graph as a function of the number of edges, and prove that the complete graph is optimal in more ways than could be imagined. We prove sharp estimates on both the sum of k-th…

Combinatorics · Mathematics 2007-05-23 Igor Rivin