Related papers: Periodic points and tail lengths of split polynomi…
We construct admissible polynomial meshes on piecewise polynomial or trigonometric curves of the complex plane, by mapping univariate Chebyshev points. Such meshes can be used for polynomial least-squares, for the extraction of Fekete-like…
In this follow-up paper, we again inspect a surprising relationship between the set of $m$-periodic points of a polynomial map $\varphi_{d, c}$ defined by $\varphi_{d, c}(z) = z^d + c$ for all $c, z \in \mathcal{O}_{K}$ and the coefficient…
Three polynomials are defined for given sets $S$ of $n$ points in general position in the plane: The Voronoi polynomial with coefficients the numbers of vertices of the order-$k$ Voronoi diagrams of $S$, the circle polynomial with…
Piecewise smooth systems are intensively studied today in many application areas, such as economics, finance, engineering, biology, and ecology. In this work, we consider a class of one-dimensional piecewise linear discontinuous maps with a…
Connected branches of periodic orbits originating at a Hopf bifurcation point of a differential system are considered. A computable estimate for the range of amplitudes of periodic orbits contained in the branch is provided under the…
This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…
The periods of polynomials can be used to characterize discrete structures such as algebraic error control codes and feedback shift registers. We study trinomial $x^h+x+1$ over GF(2), which has the maximum number of consecutive zero…
In 1980, Odoni initiated the study of the fixed-point proportion of iterated Galois groups of polynomials motivated by prime density problems in arithmetic dynamics. The main goal of the present paper is to completely settle the…
In the last years a lot of work has been concentrated on the study of the behaviour at infinity of polynomial maps. This behaviour can be very complicated, therefore the main idea was to find special classes of polynomial maps which have,…
We give the characteristic polynomial of the distance or adjacency matrix of the strong power graph of a finite group, and compute its distance and adjacency spectrum.
We establish effective bounds on the number of periodic points of degree-$d$ polynomials $\phi$ defined over $p$-adic fields and number fields, under a mild reduction hypothesis that is satisfied by all unicritical polynomials $X^d + c$…
This paper is devoted to several new results concerning (standard) octonion polynomials. The first is the determination of the roots of all right scalar multiples of octonion polynomials. The roots of left multiples are also discussed,…
We prove a Polya-Vinogradov type variation of the the Chebotarev density theorem for function fields over finite fields valid for "incomplete intervals" $I \subset \mathbb{F}_p$, provided $(p^{1/2}\log p)/|I| = o(1)$. Applications include…
We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…
The possibilities for new or unusual kinds of topological, locally linear periodic maps of non-prime order on closed, simply connected 4-manifolds with positive definite intersection pairings are explored. On the one hand, certain…
This note considers the maximal positively invariant set for polynomial discrete time dynamics subject to constraints specified by a basic semialgebraic set. The note utilizes a relatively direct, but apparently overlooked, fact stating…
Known properties of Chebyshev polynomials are the following: they have simple critical points with only two (finite) critical values. Those properties uniquely determine the named polynomials modulo affine transformations of dependent and…
Given a number field $K$ and a polynomial $f(z) \in K[z]$, one can naturally construct a finite directed graph $G(f,K)$ whose vertices are the $K$-rational preperiodic points of $f$, with an edge $\alpha \to \beta$ if and only if $f(\alpha)…
We calculate the probability that random polynomial matrices over a finite field with certain structures are right prime or left prime, respectively. In particular, we give an asymptotic formula for the probability that finitely many…
We begin by considering a sequence of polynomials in three variables whose coefficients count restricted binary overpartitions with certain properties. We then concentrate on two specific subsequences that are closely related to the…