Related papers: Attaining potentially good reduction in arithmetic…

We bound the length of the periodic part of the orbit of a preperiodic rational subvariety via good reduction information. This bound depends only on the degree of the map, the degree of the subvariety, the dimension of the projective…

We prove that for a dominant rational self-map $f$ on a quasi-projective variety defined over $\overline{\mathbb{Q}}$, there is a point whose $f$-orbit is well-defined and its arithmetic degree is arbitrarily close to the first dynamical…

The aim of this paper is to provide sufficient conditions for when a polynomial or rational function over a field K is prime using its order of vanishing at infinity and the resultant.

This paper is devoted to study some properties of the k-dimensional Lyness' map. Our main result presentes a rational vector field that gives a Lie symmetry for F. This vector field is used, for k less or equal to 5 to give information…

We give an upper bound on the z-degree of the Kauffman polynomial of a link, using bridges of length greater than one which are separated in some tangle decomposition of a link diagram. We construct some examples by wiring together rational…

Let K be any field and G be a finite group. We will prove that, if K is any field, p an odd prime number, and G is a non-abelian group of exponent p with |G|=p^3 or p^4 satisfying [K(\zeta_p):K] <= 2, then K(G) is rational over K. We will…

Suppose that $f \colon X \dashrightarrow X$ is a dominant rational self-map of a smooth projective variety defined over ${\overline{\mathbf Q}}$. Kawaguchi and Silverman conjectured that if $P \in X({\overline{\mathbf Q}})$ is a point with…

Kleene algebra (KA) is an important tool for reasoning about general program equivalences, with a decidable and complete equational theory. However, KA cannot always prove equivalences between specific programs. For this purpose, one adds…

Given a dominant rational self-map on a projective variety over a number field, we can define the arithmetic degree at a rational point. It is known that the arithmetic degree at any point is less than or equal to the first dynamical…

Let $K$ be a finite extension of the field $\mathbb{Q}_p$ of $p$-adic numbers. A rational map $\phi\in K(z)$ of degree at least $2$ is subhyperbolic if each critical point in the $\mathbb{C}_p$-Julia set of $\phi$ is eventually periodic. We…

If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…

In this article, we generalize the arithmetic degree and its related theory to dynamical systems defined over an arbitrary field $\mathbf{k}$ of characteristic $0$. We first consider a dynamical system $(X,f)$ over a finitely generated…

In this paper we describe the dynamics of certain rational maps of the form $k \cdot (x+x^{-1})$ over finite fields of odd characteristic.

For an algebraic function field $F/K$ and a discrete valuation $v$ of $K$ with perfect residue field $k$, we bound the number of discrete valuations on $F$ extending $v$ whose residue fields are algebraic function fields of genus zero over…

We study structural limitations of purely algebraic reasoning in the analysis of arithmetic dynamical systems. Rather than addressing the truth of specific conjectures, we introduce a fragment - relative notion of algebraic refutability for…

We introduce an effective algorithmic method for the computation of a lower bound for uniform expansion in one-dimensional dynamics. The approach employs interval arithmetic and thus provides a rigorous numerical result (computer-assisted…

For polynomials and rational maps of fixed degree over a finite field, we bound both the average number of connected components of their functional graphs as well as the average number of periodic points of their associated dynamical…

Let $f \in Q(z)$ be a polynomial or rational function of degree 2. A special case of Morton and Silverman's Dynamical Uniform Boundedness Conjecture states that the number of rational preperiodic points of $f$ is bounded above by an…

Let f be a rational mapping of a space X . The complexity of (f,X) as a dynamical system is measured by the dynamical degrees $\delta_p(f)$, $1\le p\le {\rm dim}(X)$. We give the definition of the dynamical degrees show how they are…

The textbook adversary bound for function evaluation states that to evaluate a function $f\colon D\to C$ with success probability $\frac{1}{2}+\delta$ in the quantum query model, one needs at least $\left( 2\delta -\sqrt{1-4\delta^2}…