Related papers: Periodic points and tail lengths of split polynomi…

We use methods from algebra and discrete geometry to study the irreducibility of the dispersion polynomial of a discrete periodic operator associated to a periodic graph after changing the period lattice. We provide numerous applications of…

In this paper it is shown that it is possible to associate several polynomial ideals to a directed graph $D$ in order to find properties of it. In fact by using algebraic tools it is possible to give appropriate procedures for automatic…

Let {f_t} be any algebraic family of rational maps of a fixed degree, with a marked critical point c(t). We first prove that the hypersurfaces of parameters for which c(t) is periodic converge as a sequence of positive closed (1,1) currents…

We investigate an infinite sequence of polynomials of the form: \[a_0T_{n}(x)+a_{1}T_{n-1}(x)+\cdots+a_{m}T_{n-m}(x)\] where $(a_0,a_1,\ldots,a_m)$ is a fixed m-tuple of real numbers, $a_0,a_m\ne0$, $T_i(x)$ are Chebyshev polynomials of the…

We study the undirected divisibility graph in which the vertex set is a finite subset of consecutive natural numbers up to N.We derive analytical expressions for measures of the graph like degree, clustering, geodesic distance and…

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…

In this paper we study the structure of the graphs associated with the iterations of the map $x \mapsto x+x^{-1}$ over finite fields of characteristic two. Formulas are given for the length of the cycles and the depth of the trees relying…

Intermittent maps of Pomeau-Manneville type are well-studied in one-dimension, and also in higher dimensions if the map happens to be Markov. In general, the nonconformality of multidimensional intermittent maps represents a challenge that…

We give explicit numerical estimates for the generalized Chebyshev functions. Explicit results of this kind are useful for estimating of computational complexity of algorithms which generates special primes. Such primes are needed to…

We expand the cross section of the geodesic flow in the tangent bundle of the modular surface given by Series to produce another section whose return map under the geodesic flow is a double cover of the natural extension of the Farey map.…

Motivated by a question of van der Poorten about the existence of infinite chain of prime numbers (with respect to some base), in this paper we advance the study of sequences of consecutive polynomials whose coefficients are chosen…

We prove the existence of an effective universal upper bound for the order of any integral periodic orbit of any integral algebraic dynamical system in a fixed ambient space. Using this, we demonstrate the decidability of periodicity in…

Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…

We explicitly determine the values of reduced cyclotomic periods of order $2^m$, $m\ge 4$, for finite fields of characteristic $p\equiv 3$ or $5\pmod{8}$. These evaluations are applied to obtain explicit factorizations of the corresponding…

We give polynomial-time approximation schemes for monotone maximization problems expressible in terms of distances (up to a fixed upper bound) and efficiently solvable in graphs of bounded treewidth. These schemes apply in all fractionally…

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…

The Directed Power Graph of a group is a graph whose vertex set is the elements of the group, with an edge from $x$ to $y$ if $y$ is a power of $x$. The \textit{Power Graph} of a group can be obtained from the directed power graph by…

We study a question on characterizing polynomials among rational functions of degree $>1$ on the projective line over an algebraically closed field that is complete with respect to a non-trivial and non-archimedean absolute value, from the…

The generalized complex numbers can be realized in terms of $2\times2$ or higher-order matrices and can be exploited to get different ways of looking at the trigonometric functions. Since Chebyshev polynomials are linked to the power of…

In this paper we introduce a new type of code, called projective nested cartesian code. It is obtained by the evaluation of homogeneous polynomials of a fixed degree on a certain subset of $\mathbb{P}^n(\mathbb{F}_q)$, and they may be seen…