Algebraic osculation and application to factorization of sparse polynomials (Q434417): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / review text | |||
Is quite of interest to find good algorithms for factorizations of a form \(f \in K[t_1,t_2]\), where \(K\subset {\mathbb C}\) is a number field. The main existing algorithms present problems when \(f\) is sparse (i.e. when there are many zeros as coefficients in a monomial expression of \(f\)), in fact they are not able to use the amount of information encoded in the Newton polytope \(N_f\) associated to \(f\). In this paper a new algorithm is found which allows to factorize sparse polynomials using the geometry of their Newton polytope. The way to achieve this result is to consider an embedding of the complex affine curve given by \(\{ f=0\}\subset {\mathbb C}^2\) into a compactification \(X\) of \({\mathbb C}^2\). If \(X\) is well-chosen, \(N_f\) can be recovered from the Picard class of a compactification \(C \subset X\) of \(\{ f=0\}\). Let \(\partial X\) be \(X \backslash {\mathbb C}^2\), then Pic(\(\partial X\)) = Pic(\(X\)), so the idea is to use \(C|_D\), where \(D\) is a divisor with support in \(|\partial X|\). The main result of the paper is a theorem which detects the irreducible components of \(C\) via necessary and sufficient conditions for a Cartier divisor on \(D\) to extend to \(C\). This ``osculation criterion'' is expressed via residues. | |||
Property / review text: Is quite of interest to find good algorithms for factorizations of a form \(f \in K[t_1,t_2]\), where \(K\subset {\mathbb C}\) is a number field. The main existing algorithms present problems when \(f\) is sparse (i.e. when there are many zeros as coefficients in a monomial expression of \(f\)), in fact they are not able to use the amount of information encoded in the Newton polytope \(N_f\) associated to \(f\). In this paper a new algorithm is found which allows to factorize sparse polynomials using the geometry of their Newton polytope. The way to achieve this result is to consider an embedding of the complex affine curve given by \(\{ f=0\}\subset {\mathbb C}^2\) into a compactification \(X\) of \({\mathbb C}^2\). If \(X\) is well-chosen, \(N_f\) can be recovered from the Picard class of a compactification \(C \subset X\) of \(\{ f=0\}\). Let \(\partial X\) be \(X \backslash {\mathbb C}^2\), then Pic(\(\partial X\)) = Pic(\(X\)), so the idea is to use \(C|_D\), where \(D\) is a divisor with support in \(|\partial X|\). The main result of the paper is a theorem which detects the irreducible components of \(C\) via necessary and sufficient conditions for a Cartier divisor on \(D\) to extend to \(C\). This ``osculation criterion'' is expressed via residues. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Alessandro Gimigliano / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 14C20 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 14M25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 32A27 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 13P05 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6054166 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
factorizations | |||
Property / zbMATH Keywords: factorizations / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Newton polytope | |||
Property / zbMATH Keywords: Newton polytope / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
binary forms | |||
Property / zbMATH Keywords: binary forms / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
osculation | |||
Property / zbMATH Keywords: osculation / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1978233844 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 0904.0178 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Factoring polynomials via polytopes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Factoring bivariate sparse (lacunary) polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4434669 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Factoring polynomials over global fields / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4657306 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: From an approximate to an exact absolute polynomial factorization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lifting and recombination techniques for absolute factorization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: THE GEOMETRY OF TORIC VARIETIES / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Towards toric absolute factorization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Introduction to Toric Varieties. (AM-131) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Irreducible decomposition of curves / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decomposition of polytopes and polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Secant Functions, the Reiss Relation and its Converse / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Variations on a theorem of Abel / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4195061 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Residues and zero-cycles on algebraic varieties / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Abelian differentials on singular varieties and variations on a theorem of Lie-Griffiths / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Improved dense multivariate polynomial factorization algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On multiplication and factorization of polynomials. I: Lexicographic orderings and extreme aggregates of terms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4023363 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4248250 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Trace and residue calculus: a new version of the Abel-inverse theorem, abelian forms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An interpolation theorem in toric varieties / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A lifting and recombination algorithm for rational factorization of sparse polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Osculation by algebraic hypersurfaces / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:29, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Algebraic osculation and application to factorization of sparse polynomials |
scientific article |
Statements
Algebraic osculation and application to factorization of sparse polynomials (English)
0 references
10 July 2012
0 references
Is quite of interest to find good algorithms for factorizations of a form \(f \in K[t_1,t_2]\), where \(K\subset {\mathbb C}\) is a number field. The main existing algorithms present problems when \(f\) is sparse (i.e. when there are many zeros as coefficients in a monomial expression of \(f\)), in fact they are not able to use the amount of information encoded in the Newton polytope \(N_f\) associated to \(f\). In this paper a new algorithm is found which allows to factorize sparse polynomials using the geometry of their Newton polytope. The way to achieve this result is to consider an embedding of the complex affine curve given by \(\{ f=0\}\subset {\mathbb C}^2\) into a compactification \(X\) of \({\mathbb C}^2\). If \(X\) is well-chosen, \(N_f\) can be recovered from the Picard class of a compactification \(C \subset X\) of \(\{ f=0\}\). Let \(\partial X\) be \(X \backslash {\mathbb C}^2\), then Pic(\(\partial X\)) = Pic(\(X\)), so the idea is to use \(C|_D\), where \(D\) is a divisor with support in \(|\partial X|\). The main result of the paper is a theorem which detects the irreducible components of \(C\) via necessary and sufficient conditions for a Cartier divisor on \(D\) to extend to \(C\). This ``osculation criterion'' is expressed via residues.
0 references
factorizations
0 references
Newton polytope
0 references
binary forms
0 references
osculation
0 references
0 references
0 references