Related papers: Simple determinantal representations of up to quin…
We construct biorthogonal polynomials for a measure over the complex plane which consists in the exponential of a potential V(z,z*) and in a set of external sources at the numerator and at the denominator. We use the pseudonorm of these…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
The set of linear, differential operators preserving the vector space of couples of polynomials of degrees n and n-2 in one real variable leads to an abstract associative graded algebra A(2). The irreducible, finite dimensional…
We provide a complete description of the ideal that serves as the resultant ideal for n univariate polynomials of degree d. We in particular describe a set of generators of this resultant ideal arising as maximal minors of a set of…
Newton iteration (NI) is an almost 350 years old recursive formula that approximates a simple root of a polynomial quite rapidly. We generalize it to a matrix recurrence (allRootsNI) that approximates all the roots simultaneously. In this…
This paper investigates defining equations for secant varieties of the variety of reducible polynomials, which geometrically encode the notions of strength and slice rank of homogeneous polynomials. We present three main results. First, we…
We present a complete algorithm for finding an exact minimal polynomial from its approximate value by using an improved parameterized integer relation construction method. Our result is superior to the existence of error controlling on…
This paper presents an alternative proof of the Fundamental Theorem of Algebra that has several distinct advantages. The proof is based on simple ideas involving continuity and differentiation. Visual software demonstrations can be used to…
We give a specific method to solve with quadratic complexity the linear systems arising in known algorithms to deal with the sign determination problem. In particular, this enable us to improve the complexity bound for sign determination in…
Multi-homogeneous polynomial systems arise in many applications. We provide bit complexity estimates for solving them which, up to a few extra other factors, are quadratic in the number of solutions and linear in the height of the input…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
We consider positive solutions to parametrized systems of generalized polynomial equations (with real exponents and positive parameters). By a fundamental result obtained in parallel work, polynomial systems are determined by geometric…
The algebra of holomorphic polynomial Sp_{2n}-invariants of k complex 2n by 2n matrices (under diagonal conjugation action) is generated by the traces of words in these matrices and their symplectic adjoints. No concrete minimal generating…
Using modular forms we determine formulas for the number of representations of a positive integer by diagonal octonary quadratic forms with coefficients $1$, $2$, $3$ or $6$.
We collect here elementary properties of differentiation matrices for univariate polynomials expressed in various bases, including orthogonal polynomial bases and non-degree-graded bases such as Bernstein bases and Lagrange \& Hermite…
Motion polynomials (polynomials over the dual quaternions with nonzero real norm) describe rational motions. We present a necessary and sufficient condition for reduced bounded motion polynomials to admit factorizations into monic linear…
Given a zero-dimensional polynomial system consisting of n integer polynomials in n variables, we propose a certified and complete method to compute all complex solutions of the system as well as a corresponding separating linear form l…
We use recent results on algorithms for Markov decision problems to show that a canonical form for a generalized P-matrix can be computed, in some important cases, by a strongly polynomial algorithm.
We find the cardinality of the value sets of polynomial maps associated with simple complex Lie algebras $B_2$ and $G_2$ over finite fields. We achieve this by using a characterization of their fixed points in terms of sums of roots of…
We obtain minimal dimension matrix representations for each indecomposable five-dimensional Lie algebra over $\R$ and justify in each case that they are minimal. In each case a matrix Lie group is given whose matrix Lie algebra provides the…