Related papers: On minimal decomposition of $p$-adic polynomial dy…

We consider the semiring of abstract finite dynamical systems up to isomorphism, with the operations of alternative and synchronous execution. We continue searching for efficient algorithms for solving polynomial equations of the form $P(X)…

We study the computational complexity of decomposing finite discrete dynamical systems (FDDSs) in terms of the semiring operations of alternative and synchronous execution, which is useful for the analysis of discrete phenomena in science…

Let n be a positive integer and let p be a prime. We calculate the probability that a random monic polynomial of degree n with coefficients in the ring Z_p of p-adic integers splits over Z_p into linear factors.

This diploma thesis is concerned with functional decomposition $f = g \circ h$ of polynomials. First an algorithm is described which computes decompositions in polynomial time. This algorithm was originally proposed by Zippel (1991). A…

We define polygonal dynamics as a family of dynamical systems acting on points in projective spaces. The most famous example is the pentagram map. Similar collapsing phenomena seem to occur in most of these systems. We prove it in some…

We describe the dynamical structure of the $p$-adic rational dynamical systems associated with the Sigmoid Beverton-Holt model on the projective line over the field $\mathbb{Q}_p$ of $p$-adic numbers. Our methods are minimal decomposition…

In the paper we investigate the behavior of trajectory of rational $p$-adic dynamical system in complex $p$-adic filed $\C_p$. It is studied Siegel disks and attractors of such dynamical systems. We show that Siegel disks may either…

We study polynomials with coefficients in a field L as dynamical systems where L is any algebraically closed and complete ultrametric field with dense valuation group and characteristic zero residual field. We give a complete description of…

Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…

We present a novel way of realizing the Bernoulli shift on $p$ symbols on the $p$-adic integers, where $p$ is a prime. By showing that suitably small perturbations of the shift are still Bernoulli we find many "nice" maps, such as…

In different areas of discrete mathematics, a certain type of polynomials, having coefficients in a field K of finite characteristic, has been considered. The form and the degree of these polynomials, here called projective, are simply…

In this paper, we construct a digraph structure on $p$-adic dynamical systems defined by rational functions. We study the conditions under which the functions are measure-preserving, invertible and isometric, ergodic, and minimal on…

We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…

This paper deals with random dynamical systems of polynomial automorphisms (complex generalized H\'{e}non maps and their conjugate maps) of $\Bbb{C}^{2}.$ We show that a generic random dynamical system of polynomial automorphisms has ``mean…

J. Silverman proved that a dynamical system on $\mathbb{P}^{1}$ descends to the field of moduli if it is polynomial or it has even degree, but for non-polynomial ones of odd degree the picture is less clear. We give a complete…

Let p > 2 be a prime, let n > m > 0. Let pi_n be the norm of zeta_{p^n} - 1 under C_{p-1}, so that Z_(p)[pi_n] | Z_(p) is a purely ramified extension of discrete valuation rings of degree p^{n-1}. The minimal polynomial of pi_n over Q(pi_m)…

A polynomial of the form $x^\alpha - p(x)$, where the degree of $p$ is less than the total degree of $x^\alpha$, is said to be least deviation from zero if it has the smallest uniform norm among all such polynomials. We study polynomials of…

We investigate from a statistical perspective the arithmetic properties of the dynamics of polynomials of fixed degree and defined over the field of rational numbers. To start with, ordering their affine conjugacy classes by height, we show…

This paper focuses on polynomial dynamical systems over finite fields. These systems appear in a variety of contexts, in computer science, engineering, and computational biology, for instance as models of intracellular biochemical networks.…

A polynomial over a ring is called decomposable if it is a composition of two nonlinear polynomials. In this paper, we obtain sharp lower and upper bounds for the number of decomposable polynomials with integer coefficients of fixed degree…