Related papers: Composite polynomials in linear recurrence sequenc…
For any real numbers $b,c\in\mathbb{R}$, we form the sequence of polynomials $\left\{ H_{m}(z)\right\} _{m=0}^{\infty}$ satisfying the four-term recurrence \[ H_{m}(z)+cH_{m-1}(z)+bH_{m-2}(z)+zH_{m-3}(z)=0,\qquad m\ge3, \] with the initial…
In this article, we give a family of examples of algebras, showing that for every $n \geq 2$ and $m \geq 0$, there is an algebra displaying a path of n irreducible morphisms between indecomposable modules whose composite lies in the…
Let $ G_n $ and $ H_m $ be two non-degenerate linear recurrence sequences defined over a function field $ F $ in one variable over $ \mathbb{C} $, and let $ \mu $ be a valuation on $ F $. We prove that under suitable conditions there are…
Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a…
We consider the decidability and complexity of the Ultimate Positivity Problem, which asks whether all but finitely many terms of a given rational linear recurrence sequence (LRS) are positive. Using lower bounds in Diophantine…
Consider the $n$th degree polynomial equation, $X^n+A_{n-1}X^{n-1}+...+A_1X+A_0=0$ over the ring of 2 by 2 complex matrices. If this equation has more than ${2n \choose 2}$ solutions, then it has infinitely many solutions. We show here that…
Consider a sequence of real-valued functions of a real variable given by a homogeneous linear recursion with differentiable coefficients. We show that if the functions in the sequence are differentiable, then the sequence of derivatives…
Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on the context, solving has different meanings. In order to…
Let $\{U(m)\}_{m\in \N}$ and $\{V(n)\}_{n\in \N}$ be linear recurrence sequences. It is a well-known Diophantine problem to determine the finiteness of the set of natural numbers $n$ such that the ratio $U(n)/V(n)$ is an integer. We study…
We give a characterization of common zeros of a sequence of univariate polynomials $W_n(z)$ defined by a recurrence of order two with polynomial coefficients, and with $W_0(z)=1$. Real common zeros for such polynomials with real…
We consider the problem of finding a condition for a univariate polynomial having a given multiplicity structure when the number of distinct roots is given. It is well known that such conditions can be written as conjunctions of several…
Modular composition is the problem of computing the coefficient vector of the polynomial $f(g(x)) \bmod h(x)$, given as input the coefficient vectors of univariate polynomials $f$, $g$, and $h$ over an underlying field $\mathbb{F}$. While…
Call a monic integer polynomial exceptional if it has a root modulo all but a finite number of primes, but does not have an integer root. We classify all irreducible monic integer polynomials $h$ for which there is an irreducible monic…
Given polynomial maps $f, g \colon \mathbb{R}^n \to \mathbb{R}^n,$ we consider the {\em polynomial complementary problem} of finding a vector $x \in \mathbb{R}^n$ such that \begin{equation*} f(x) \ \ge \ 0, \quad g(x) \ \ge \ 0, \quad…
Starting from Ritt's classical theorems, we give a survey of results in functional decomposition of polynomials and of applications in Diophantine equations. This includes sufficient conditions for the indecomposability of polynomials, the…
Let $(x_n)_{n\geq0}$ be a linear recurrence of order $k\geq2$ satisfying $$x_n=a_1x_{n-1}+a_2x_{n-2}+\dots+a_kx_{n-k}$$ for all integers $n\geq k$, where $a_1,\dots,a_k,x_0,\dots, x_{k-1}\in \mathbb{Z},$ with $a_k\neq0$. In [`The quotient…
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…
A curve X over the field Q of rational numbers is modular if it is dominated by X_1(N) for some N; if in addition the image of its jacobian in J_1(N) is contained in the new subvariety of J_1(N), then X is called a new modular curve. We…
In this paper, we consider some generalized commutator equations in a finite group and show that the number of solutions of such equations are characters of that group. We also obtain explicit formula for this character, considering the…
Within the framework of mappings between affine spaces, the notion of $n$-th polarization of a function will lead to an intrinsic characterization of polynomial functions. We prove that the characteristic features of derivations, such as…