Related papers: Three Theorems on odd degree Chebyshev polynomials…

While iterating the quadratic polynomial f_{c}(x)=x^{2}+c the degree of the iterates grows very rapidly, and therefore solving the equations corresponding to periodic orbits becomes very difficult even for periodic orbits with a low period.…

Permutation polynomials over a ring of modulo $2^w$ are compatible with digital computers and digital signal processors, and so they are in particular expected to be useful for cryptography and pseudo random number generator. In general,…

Understanding the functional graph of a nonlinear map over a finite domain is crucial for analyzing its dynamical complexity and potential applications in cryptography and pseudorandom generation. In this paper, we investigate the graph…

Understanding the underlying graph structure of a nonlinear map over a particular domain is essential in evaluating its potential for real applications. In this paper, we investigate the structure of the associated \textit{functional graph}…

In this paper, the general perturbation problem of piecewise smooth integrable differential systems with two switching planes is considered. Firstly, when the unperturbed system has a family of periodic orbits, the first order Melnikov…

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

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…

Orthogonal polynomials satisfy a recurrence relation of order two, where appear two coefficients. If we modify one of these coefficients at a certain order, we obtain a perturbed orthogonal sequence. In this work we consider in this way…

Explicit formulas are obtained for the number of periodic points and maximum tail length of split polynomial maps over finite fields for affine and projective space. This work includes a detailed analysis of the structure of the directed…

Chebyshev polynomials of the first and second kind for a set K are monic polynomials with minimal L $\infty$-and L 1-norm on K, respectively. This articles presents numerical procedures based on semidefinite programming to compute these…

We consider perturbed pendulum-like equations on the cylinder of the form $ \ddot x+\sin(x)= \varepsilon \sum_{s=0}^{m}{Q_{n,s} (x)\, \dot x^{s}}$ where $Q_{n,s}$ are trigonometric polynomials of degree $n$, and study the number of limit…

We employ the generalized Remez algorithm, initially suggested by P. T. P. Tang, to perform an experimental study of Chebyshev polynomials in the complex plane. Our focus lies particularly on the examination of their norms and zeros. What…

Let $q$ be an odd prime power. Let $f\in \mathbb{F}_q[x]$ be a polynomial having degree at least $2$, $a\in \mathbb{F}_q$, and denote by $f^n$ the $n$-th iteration of $f$. Let $\chi$ be the quadratic character of $\mathbb{F}_q$, and…

Iteration of the quadratic map produces sequences of polynomials whose degrees {\sl explode} as the orbital period grows more and more. The polynomial mixing all 335 period-12 orbits has degree $4020$, while for the $52,377$ period-20…

We consider semiclassical orthogonal polynomials on the unit circle associated with a weight function that satisfy a Pearson-type differential equation involving two polynomials of degree at most three. Structure relations and difference…

The paper studies the question of existence of polynomials with given roots over associative non-commutative rings with identity. It is shown that in the case of an associative division ring for arbitrary n elements of this ring there…

This article explores the connection between Chebyshev polynomials and knot theory, specifically in relation to Gram determinants. We reveal intriguing formulae involving the Chebyshev polynomial of the first and second kind. In particular…

Second-order polynomials generalize classical first-order ones in allowing for additional variables that range over functions rather than values. We are motivated by their applications in higher-order computational complexity theory,…

It is proved that for any finite dimensional representation of a prime order group over the field of rational numbers, polynomial invariants of degree at most $3$ separate the orbits. A result providing an upper degree bound for separating…

In this paper, we study a class of orthogonal polynomials defined by a three-term recurrence relation with periodic coefficients. We derive explicit formulas for the generating function, the associated continued fraction, the orthogonality…