MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $p(x,y,z)$ be a homogeneous irreducible polynomial of degree $d$, with real coefficients. From Dickson in 1920 we know that there exists $A$, $B$ and $C$ such that

$ det(Ax + By + Cz) = c p(x,y,z)$,

where $c$ is some constant.

Vinnokov in 1988 was able to describe all the non-equivalent determinantal representations as points on the Jacobian variety that are not on the exceptional sub variety. The theoretical work in this paper is relatively constructive, but is still a long way from a numerically stable constructive algorithm for $A$, $B$ and $C$.

Given any polynomial $p(x,y,z)$, can one triple $(A, B,C)$ be constructed in a numerically stable way?

Thanks in advance.

share|cite|improve this question
up vote 2 down vote accepted

This is discussed in a recent work of Plaumann, Sturmfels and Vinzant:

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.