Decomposability of multivariable polynomials
Constantin-Nicolae Beli

TL;DR
This paper characterizes the finite support sets of multivariable polynomials over algebraically closed fields that guarantee decomposability, and explores how the irreducibility depends on the field's characteristic.
Contribution
It provides a complete classification of support sets that ensure polynomial decomposability and analyzes the characteristic-dependent nature of irreducibility.
Findings
Identifies all support sets where polynomials are necessarily decomposable.
Shows the irreducibility of polynomials depends on the characteristic of the field.
Highlights the complexity of classifying irreducible polynomials based on support sets.
Abstract
Let be an algebrically closed field and let . If , , we denote by the support of , which is the finite subset of such that with . (If then .) We determine all finite, nonempty sets such that every with is decomposable. We also consider the problem of finding all such that every with is irreducible. We do not solve this problem, which is very unlikely to have a simple answer. We show however that the answer depends on the characteristic of and we determine the nature of this dependence.
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 · Algebraic Geometry and Number Theory
