Related papers: Preperiodic points of polynomial dynamical systems…

For a prime $p$ and an integer $x$, the $p$-adic valuation of $x$ is denoted by $\nu_{p}(x)$. For a polynomial $Q$ with integer coefficients, the sequence of valuations $\nu_{p}(Q(n))$ is shown to be either periodic or unbounded. The first…

We study a Weiner process that is conditioned to pass through a finite set of points and consider the dynamics generated by iterating a sample path from this process. Using topological techniques we are able to characterize the global…

An n dimensional monomial dynamical system over a finite field K is a nonlinear deterministic time discrete dynamical system with the property that each of the n component functions is a monic nonzero monomial function in n variables. In…

Let $\mathcal R_{n}$ be the set of all rational functions of the type $r(z) = f(z)/w(z)$, where $f(z)$ is a polynomial of degree at most $n$ and $w(z) = \prod_{j=1}^{n}(z-\beta_j)$, $|\beta_j|>1$ for $1\leq j\leq n$. In this work, we…

The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…

We show that algebraic dynamical systems with entropy rank one have uniformly exponentially many periodic points in all directions.

The problem of linking the structure of a finite linear dynamical system with its dynamics is well understood when the phase space is a vector space over a finite field. The cycle structure of such a system can be described by the…

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

Let F:=(f_1,...,f_n) be a random polynomial system with fixed n-tuple of supports. Our main result is an upper bound on the probability that the condition number of f in a region U is larger than 1/epsilon. The bound depends on an integral…

Let M be a compact manifold of dimension at least 2, Diff^r(M) be the space of C^r diffeomorphisms of M. Define for any diffeomorphism f in Diff^r(M) number of isolated periodic points of period n by P_n(f)=# {isolated x in M: f^n(x)=x}.…

We study systems of equations of the form X1 = f1(X1, ..., Xn), ..., Xn = fn(X1, ..., Xn), where each fi is a polynomial with nonnegative coefficients that add up to 1. The least nonnegative solution, say mu, of such equation systems is…

We introduce a class of dynamical systems of algebraic origin, consisting of self-interacting irreducible polynomials over a field. A polynomial f is made to act on a polynomial g by mapping the roots of g. This action identifies a new…

We describe the practical implementation of an average polynomial-time algorithm for counting points on superelliptic curves defined over $\mathbb Q$ that is substantially faster than previous approaches. Our algorithm takes as input a…

Suppose $p$ is a prime, $t$ is a positive integer, and $f\!\in\!\mathbb{Z}[x]$ is a univariate polynomial of degree $d$ with coefficients of absolute value $<\!p^t$. We show that for any fixed $t$, we can compute the number of roots in…

Most results on the value sets $V_f$ of polynomials $f \in \mathbb{F}_q[x]$ relate the cardinality $|V_f|$ to the degree of $f$. In particular, the structure of the spectrum of the class of polynomials of a fixed degree $d$ is rather well…

An integer-valued multiplicative function $f$ is said to be polynomially-defined if there is a nonconstant separable polynomial $F(T)\in \mathbb{Z}[T]$ with $f(p)=F(p)$ for all primes $p$. We study the distribution in coprime residue…

Let $a$ be an integer and $p$ a prime so that $f(x)=x^p-a$ is irreducible. Write $f^n(x)$ to indicate the $n$-fold composition of $f(x)$ with itself. We study the monogenicity of number fields defined by roots of $f^n(x)$ and give necessary…

We establish a new asymptotic formula for the number of polynomials of degree $n$ with $k$ prime factors over a finite field $\mathbb{F}_q$. The error term tends to $0$ uniformly in $n$ and in $q$, and $k$ can grow beyond $\log n$.…

We count the number of polynomials over finite fields with prescribed leading coefficients and a given number of linear factors. This is equivalent to counting codewords in Reed-Solomon codes which are at a certain distance from a received…

We characterize all monic polynomials $f(x) \in \mathbb{Z}[x]$ that have the property that \[f(p) \mid f(p^{p}),~\text{for all sufficiently large primes }p \geq N(f). \] We also give necessary conditions and a sufficient condition for monic…