Bivariate systems of polynomial equations with roots of high multiplicity
I.Nikitin

TL;DR
This paper investigates the possible multiplicities of solutions in bivariate polynomial systems with fixed supports, providing a classification of systems based on the maximum achievable solution multiplicities.
Contribution
It proves the existence of systems with solutions of all multiplicities within a specific range and classifies support pairs that cannot have solutions of multiplicity three.
Findings
Existence of systems with solutions of all multiplicities in a certain range.
Classification of support pairs without solutions of multiplicity 3.
Explicit bounds on solution multiplicities based on support sets.
Abstract
Given a bivariate system of polynomial equations with fixed support sets it is natural to ask which multiplicities its solutions can have. We prove that there exists a system with a solution of multiplicity for all in the range , where is the set of all integral vectors that shift B to a subset of . As an application of this result we classify all pairs such that the system supported at does not have a solution of multiplicity .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Differential Equations and Dynamical Systems · Polynomial and algebraic computation · Coding theory and cryptography
