Normal and Triangular Determinantal Representations of Multivariate Polynomials

03/31/2018
by   Massimo Salvi, et al.
0

In this paper we give a new and simple algorithm to put any multivariate polynomial into a normal determinant form in which each entry has the form , and in each column the same variable appears. We also apply the algorithm to obtain a triangular determinant representation, a reduced determinant representation, and a uniform determinant representation of any multivariable polynomial. The algorithm could be useful for obtaining representations of dimensions smaller than those available up to now to solve numerical problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/06/2016

A Polynomial-time Algorithm to Compute Generalized Hermite Normal Form of Matrices over Z[x]

In this paper, a polynomial-time algorithm is given to compute the gener...
research
04/29/2021

Analyzing the Nuances of Transformers' Polynomial Simplification Abilities

Symbolic Mathematical tasks such as integration often require multiple w...
research
04/08/2021

Analysis of Normal-Form Algorithms for Solving Systems of Polynomial Equations

We examine several of the normal-form multivariate polynomial rootfindin...
research
02/05/2016

A fast, deterministic algorithm for computing a Hermite Normal Form of a polynomial matrix

Given a square, nonsingular matrix of univariate polynomials F∈K[x]^n × ...
research
02/10/2022

A Stieltjes algorithm for generating multivariate orthogonal polynomials

Orthogonal polynomials of several variables have a vector-valued three-t...
research
05/25/2022

High dimensional Bernoulli distributions: algebraic representation and applications

The main contribution of this paper is to find a representation of the c...
research
03/26/2019

Generalized Convolution and Efficient Language Recognition

Convolution is a broadly useful operation with applications including si...

Please sign up or login with your details

Forgot password? Click here to reset