AI Chat AI Image Generator AI Video Text to Speech

Computing symmetric determinantal representations

05/16/2019

∙

by Justin Chen, et al.

∙

∙

We introduce the DeterminantalRepresentations package for Macaulay2, which computes definite symmetric determinantal representations of real polynomials. We focus on quadrics and plane curves of low degree (i.e. cubics and quartics). Our algorithms are geared towards speed and robustness, employing linear algebra and numerical algebraic geometry, without genericity assumptions on the polynomials.

Justin Chen
9 publications
Papri Dey
2 publications

page 1

page 2

page 3

page 4

research

∙ 11/28/2019

Schur Polynomials do not have small formulas if the Determinant doesn't!

Schur Polynomials are families of symmetric polynomials that have been c...

0 Prasad Chaugule, et al. ∙

research

∙ 06/10/2022

Some Extremal Symmetric Inequalities

Let ℋ_n,d^s := ℝ[x_1,…, x_n]_d^𝔖_n be the set of symmetric polynomials o...

0 Tetsuya Ando, et al. ∙

research

∙ 06/24/2021

The leading coefficient of Lascoux polynomials

Lascoux polynomials have been recently introduced to prove polynomiality...

0 Alessio Borzí, et al. ∙

research

∙ 03/05/2019

Planar Polynomials arising from Linearized polynomials

In this paper we construct planar polynomials of the type f_A,B(x)=x(x^q...

0 Daniele Bartoli, et al. ∙

research

∙ 06/21/2018

Real root finding for equivariant semi-algebraic systems

Let R be a real closed field. We consider basic semi-algebraic sets defi...

0 Cordian Riener, et al. ∙

research

∙ 08/24/2016

Efficient algorithms for computing the Euler-Poincaré characteristic of symmetric semi-algebraic sets

Let R be a real closed field and D⊂R an ordered domain. We consider the ...

0 Saugata Basu, et al. ∙

research

∙ 01/21/2020

On mu-Symmetric Polynomials

In this paper, we study functions of the roots of a univariate polynomia...

0 Jing Yang, et al. ∙