Related papers: Roots multiplicity without companion matrices
We extend the algorithms of Robinson, Smyth, and McKee--Smyth to enumerate all real-rooted integer polynomials of a fixed degree, where the first few (at least three) leading coefficients are specified. Additionally, we introduce new linear…
By representing elements in free fields (over a commutative field and a finite alphabet) using Cohn and Reutenauer's linear representations, we provide an algorithmic construction for the (partial) non-commutative (or Hausdorff-) derivative…
We prove that the generating polynomials of partitions of an $n$-element set into non-singleton blocks, counted by the number of blocks, have real roots only and we study the asymptotic behavior of the leftmost roots. We apply this…
Recent work of Belinschi, Mai and Speicher resulted in a general algorithm to calculate the distribution of any selfadjoint polynomial in free variables. Since many classes of independent random matrices become asymptotically free if the…
We show that if the connected sum of two knots with coprime Alexander polynomials has vanishing von Neumann rho-invariants associated with certain metabelian representations then so do both knots. As an application, we give a new example of…
We develop a robust matrix-free, communication avoiding parallel, high-degree polynomial preconditioner for the Conjugate Gradient method for large and sparse symmetric positive definite linear systems. We discuss the selection of a scaling…
In this paper, we tackle the parametric complete multiplicity problem for a univariate polynomial. Our approach to the parametric complete multiplicity problem has a significant difference from the classical method, which relies on repeated…
We propose several techniques to construct complete permutation polynomials of finite fields by virtue of complete permutations of subfields. In some special cases, any complete permutation polynomials over a finite field can be used to…
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algebraic numbers. One motivation is to explain the method's good…
We develop a framework to apply tropical and nonarchimedean analytic techniques to multiplication maps on linear series and study degenerations of these multiplications maps when the special fiber is not of compact type. As an application,…
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…
As a generalization of Hermite interpolation problem, Birkhoff interpolation is an important subject in numerical approximation. This paper generalizes the existing Generalized Recursive Polynomial Interpolation Algorithm (GRPIA) that is…
Craig interpolation has emerged as an effective means of generating candidate program invariants. We present interpolation procedures for the theories of Presburger arithmetic combined with (i) uninterpreted predicates (QPA+UP), (ii)…
Given any polynomial system with fixed monomial term structure, we give explicit formulae for the generic number of roots with specified coordinate vanishing restrictions. For the case of affine space minus an arbitrary union of coordinate…
In this paper we introduce the theory of multiplication alteration by two-cocycles for nonassociative structures like nonassociative bimonoids with left (right) division. Also we explore the connections between Yetter-Drinfeld modules for…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a real coefficient polynomial. They can be approximated at a low computational cost if the…
This note aims to construct an ``intrinsic'' splitting field for the polynomial $Y^n-1$ over the rational field $\bf Q$, in a way that Gauss, Kummer, Kronecker and Bishop would have liked. Contrary to the usual presentations, our…
For bivariate polynomials of degree $n\le 5$ we give fast numerical constructions of determinantal representations with $n\times n$ matrices. Unlike some other available constructions, our approach returns matrices of the smallest possible…
The method of constructing Hermite trigonometric polynomials, which interpolate the values of a certain periodic function and its derivatives up to (including ) the -th ( ) order in nodes of a uniform grid, is considered. The proposed…
We seek complex roots of a univariate polynomial $P$ with real or complex coefficients. We address this problem based on recent algorithms that use subdivision and have a nearly optimal complexity. They are particularly efficient when only…