Related papers: Zeros and factorizations of quaternion polynomials…
We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…
Polynomials are common algebraic structures, which are often used to approximate functions including probability distributions. This paper proposes to directly define polynomial distributions in order to describe stochastic properties of…
We study the structure of the Fourier coefficients of low degree multivariate polynomials over finite fields. We consider three properties: (i) the number of nonzero Fourier coefficients; (ii) the sum of the absolute value of the Fourier…
In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…
Solving a quadratic equation $P(x)=ax^2+bx+c=0$ with real coefficients is known to middle school students. Solving the equation over the quaternions is not straightforward. Huang and So \cite{Huang} give a complete set of formulas, breaking…
We consider polynomials with integer coefficients and discuss their factorization properties in Z[[x]], the ring of formal power series over Z. We treat polynomials of arbitrary degree and give sufficient conditions for their reducibility…
The purpose of this paper is to present three new methods for finding all simple zeros of polynomials simultaneously. First, we give a new method for finding simultaneously all simple zeros of polynomials constructed by applying the…
Systems of differential equations with polynomial right-hand sides are very common in applications. On the other hand, their mathematical analysis is very challenging in general, due to the possibility of complex dynamics: multiple basins…
Combinatorial properties of zeons have been applied to graph enumeration problems, graph colorings, routing problems in communication networks, partition-dependent stochastic integrals, and Boolean satisfiability. Power series of elementary…
Let $\Phi(x,y)$ be a bivariate polynomial with complex coefficients. The zeroes of $\Phi(x,y)$ are given a combinatorial structure by considering them as arcs of a directed graph $G(\Phi)$. This paper studies some relationship between the…
In the context of space-time block codes (STBCs), the theory of generalized quaternion and biquaternion algebras (i.e., tensor products of two quaternion algebras) over arbitrary base fields is presented, as well as quadratic form theoretic…
For each $\alpha>0$ and $A(z),B(z)\in\mathbb{C}[z]$, we study the zero distribution of the sequence of polynomials $\left\{ P_{m}^{(\alpha)}(z)\right\} _{m=0}^{\infty}$ generated by $(1+B(z)t+A(z)t^{3})^{-\alpha}$. We show that for large…
The purpose of this note is to extend in a simple and unified way the known results on interlacing of zeros of paraorthogonal polynomials on the unit circle. These polynomials can be regarded as the characteristic polynomials of any matrix…
We give an algorithm for factoring quadratic polynomials over any UFD, Z in particular. We prove the correctness of this algorithm and give examples over Z and Z[i].
Finding an approximate region containing all the zeros of analytic polynomials is a well-studied problem. But the numb er of the zeros and regions containing all the zeros of complex-valued harmonic polynomials is relatively a fresh…
We study the root distribution of some univariate polynomials satisfying a recurrence of order two with linear and quadratic polynomial coefficients. We show that the set of non-isolated limits of zeros of the polynomials is the closure of…
In this note, we provide a wide range of upper bounds for the moduli of the zeros of a complex polynomial. The obtained bounds complete a series of previous papers on the location of zeros of polynomials.
We present new polynomial-based methods for discrete-time quaternionic systems, highlighting how noncommutative multiplication modifies classical control approaches. Defining quaternionic polynomials via a backward-shift operator, we…
A collection of subroutines and examples of their uses, as well as the underlying numerical methods, are described for generating orthogonal polynomials relative to arbitrary weight functions. The object of these routines is to produce the…
The subject of Polynomiography deals with algorithmic visualization of polynomial equations, having many applications in STEM and art, see [Kal04]. Here we consider the polynomiography of the partial sums of the exponential series. While…