We consider a compactification of a general system of polynomial equations in weighted projective space, and give some sufficient conditions about the solvability of a polynomial system over C and R. We also prove that for generic linear subspaces, the inverse eigenvalue problem with perturbations in the linear subspace always has n! solutions.
- Controllbility of discrete polynomial systems
- Inverse eigenvalue problems
- System of polynomial equations
- Weighted projective space