On multiplication and factorization of polynomials. I: Lexicographic orderings and extreme aggregates of terms
From MaRDI portal
Publication:1222692
DOI10.1007/BF01836524zbMath0319.13004OpenAlexW2039640342MaRDI QIDQ1222692
Publication date: 1975
Published in: Aequationes Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/136541
Related Items (18)
Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations ⋮ Random algebraic construction of extremal graphs ⋮ Modular Las Vegas algorithms for polynomial absolute factorization ⋮ A lifting and recombination algorithm for rational factorization of sparse polynomials ⋮ Unnamed Item ⋮ Ranks of matrices with few distinct entries ⋮ Universal Analytic Gröbner Bases and Tropical Geometry ⋮ Irreducibility of polynomials modulo \(p\) via Newton polytopes. ⋮ The cluster modular group of the dimer model ⋮ Dilation of Newton polytope and \(p\)-adic estimate ⋮ Algebraic osculation and application to factorization of sparse polynomials ⋮ Darboux theory of integrability in the sparse case ⋮ Images of locally finite derivations of polynomial algebras in two variables ⋮ Absolute irreducibility of polynomials via Newton polytopes ⋮ Efficient \(q\)-integer linear decomposition of multivariate polynomials ⋮ Towards toric absolute factorization ⋮ Dynamic balancing of planar mechanisms using toric geometry ⋮ Irreducibility of a sum of polynomials depending on disjoint sets of variables
This page was built for publication: On multiplication and factorization of polynomials. I: Lexicographic orderings and extreme aggregates of terms
