Sparse squares of polynomials

DOI10.1090/S0025-5718-00-01294-1MaRDI QIDQ2759109zbMATH OpenFDO

Authors John Abbott

Publication date 10 December 2001

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/S0025-5718-00-01294-1

zbMATH Keywords

Gröbner basespackage CoCoAsquares of polynomials

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Number-theoretic algorithms; complexity (11Y16)

Review text

The paper is devoted to an open problem posed by \textit{D. Coppersmith} and \textit{J. Davenport} [Acta Arith. 58, 79-87 (1991; Zbl 0729.11015)] about polynomials with sparse squares. In this paper it is proved that no polynomial of degree less than \(12\) has a sparse square. Note that the author used the package CoCoA.

Recommendations

• Sparsity in sums of squares of polynomials
• Polynomials whose powers are sparse
• Sparse generalised polynomials
• On some computations on sparse polynomials
• Some properties of a class of sparse polynomials
• scientific article; zbMATH DE number 3887067
• Sparse polynomial approximation in finite fields
• On the evaluation of some sparse polynomials
• Sparse univariate polynomials with many roots over finite fields
• Computing sparse multiples of polynomials

Cites work

• scientific article; zbMATH DE number 638938 (Why is no real title available?)
• Polynomials whose powers are sparse
• Some features of \(CoCoA 3\)

Cited in

(5)

• Algebraic characterization of \(\mathbb{C}\)-regular fractions under level permutations
• Polynomials whose powers are sparse
• scientific article; zbMATH DE number 1504692 (Why is no real title available?)
• Sparse multiplication for skew polynomials
• Detecting lacunary perfect powers and computing their roots

Describes a project that uses

Uses Software

• CoCoA

This page was built for publication: Sparse squares of polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2759109)