Related papers: Linearization and connection coefficients of polyn…
For a suitable irreducible \textit{base} polynomial $f(x)\in \mathbf{Z}[x]$ of degree $k$, a family of polynomials $F_m(x)$ depending on $f(x)$ is constructed with the properties: (i) there is exactly one irreducible factor $\Phi_{d,f}(x)$…
In the framework of Polynomial Eigenvalue Problems, most of the matrix polynomials arising in applications are structured polynomials (namely (skew-)symmetric, (skew-)Hermitian, (anti-)palindromic, or alternating). The standard way to solve…
The linearization coefficient $\mathcal{L}(L_{n_1}(x)\dots L_{n_k}(x))$ of classical Laguerre polynomials $L_n(x)$ is known to be equal to the number of $(n_1,\dots,n_k)$-derangements, which are permutations with a certain condition.…
To every integer monic polynomial of degree m can be associated m integer sequences having interesting properties to the roots of the polynomial. These sequences can be used to find the real roots of any integer monic polynomial by using…
In continuation to our recent work on noncommutative polynomial factorization, we consider the factorization problem for matrices of polynomials and show the following results. (1) Given as input a full rank $d\times d$ matrix $M$ whose…
We compute the PI-exponent of the matrix ring with coefficients in an associative algebra. As a consequence, we prove the following. Let $\mathcal{R}$ be a PI-algebra with a positive PI-exponent. If $M_n(\mathcal{R})$ and $M_m(\mathcal{R})$…
Let X be an analytic set defined by polynomials whose coefficients a_1,...,a_s are holomorphic functions. We formulate conditions such that for all sequences {a_(1,n)},...,{a_(s,n)} of holomorphic functions converging locally uniformly to…
The descent polynomial of a finite $I\subseteq \mathbb{Z}^+$ is the polynomial $d(I,n)$, for which the evaluation at $n>\max(I)$ is the number of permutations on $n$ elements, such that $I$ is the set of indices where the permutation is…
We first show the existence and nature of convergence to a limiting set of roots for polynomials in a three-term recurrence of the form $p_{n+1}(z) = Q_k(z)p_{n}(z)+ \gamma p_{n-1}(z)$ as $n$ $\rightarrow$ $\infty$, where the coefficient…
Let s and t be variables. Define polynomials {n} in s, t by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. If s, t are integers then the corresponding sequence of integers is called a Lucas sequence. Define an analogue of the binomial…
In this paper, we present a new algorithm for computing the linear recurrence relations of multi-dimensional sequences. Existing algorithms for computing these relations arise in computational algebra and include constructing structured…
We give criteria for finite dimensionality or infinite dimensionality of the polynomial centralizer of the Lie algebra of a linear Lie group, in terms of invariants and relative invariants of the group. In the finite dimensional scenario…
We give a method of generating strongly polynomial sequences of graphs, i.e., sequences $(H_{\mathbf{k}})$ indexed by a multivariate parameter $\mathbf{k}=(k_1,\ldots, k_h)$ such that, for each fixed graph $G$, there is a multivariate…
Given a prime $p$ and a positive integer $k$, let $\mathrm{M}_{n}(\mathbb{Z}/p^{k}\mathbb{Z})$ be the ring of $n \times n$ matrices over $\mathbb{Z}/p^{k}\mathbb{Z}$. We consider the number of solutions $X \in…
This paper presents both a proof method and a result. The proof method presented is particularly suitable for uniformly proving families of identities satisfied by a family of recursive sequences. To illustrate the method, we study the…
A polynomial family $\{p_n(x)\}$ is Appell if it is given by $\frac{e^{xt}}{g(t)} = \sum_{n=0}^\infty p_n(x)t^n$ or, equivalently, $p_n'(x) = p_{n-1}(x)$. If $g(t)$ is an entire function, $g(0)\neq 0$, with at least one zero, the…
We study the problem of generalization of Oresme numbers with a new sequence of numbers called Oresme polynomials. Moreover, by using the matrix methods for Oresme polynomials, we obtain the identities including the general bilinear…
We generalize some previous results on random polynomials in several complex variables. A standard setting is to consider random polynomials $H_n(z):=\sum_{j=1}^{m_n} a_jp_j(z)$ that are linear combinations of basis polynomials $\{p_j\}$…
We investigate the summability of the coefficients of $m$-homogeneous polynomials and $m$-linear mappings defined on $\ell_{p}$-spaces. In our research we obtain results on the summability of the coefficients of $m$-linear mappings defined…
We investigate the sequence $(P_{n}(z))_{n=0}^{\infty}$ of random polynomials generated by the three-term recurrence relation $P_{n+1}(z)=z P_{n}(z)-a_{n} P_{n-1}(z)$, $n\geq 1$, with initial conditions $P_{\ell}(z)=z^{\ell}$, $\ell=0, 1$,…