|
Sparse squares of polynomials
Author(s):
John
Abbott.
Journal:
Math. Comp.
71
(2002),
407-413.
MSC (2000):
Primary 11C04;
Secondary 12Y05
Posted:
October 17, 2000
MathSciNet review:
1863010
Retrieve article in:
PDF
This article is available free of charge
Abstract |
References |
Similar articles |
Additional information
Abstract:
We answer a question left open in an article of Coppersmith and Davenport which proved the existence of polynomials whose powers are sparse, and in particular polynomials whose squares are sparse (i.e., the square has fewer terms than the original polynomial). They exhibit some polynomials of degree having sparse squares, and ask whether there are any lower degree complete polynomials with this property. We answer their question negatively by reporting that no polynomial of degree less than has a sparse square, and explain how the substantial computation was effected using the system CoCoA.
References:
-
- 1.
- W Adams, P Loustaunau, An Introduction to Gröbner Bases, Graduate Studies in Mathematics 3, Amer. Math. Soc., Providence, 1994. MR 95g:13025
- 2.
- D Coppersmith, J Davenport, ``Polynomials whose powers are sparse'' Acta Arithmetica 58 (1991), 79-87. MR 92h:12001
- 3.
- A Capani, G Niesi, L Robbiano, CoCoA: Computations in Commutative Algebra http://cocoa.dima.unige.it/
Similar Articles:
Retrieve articles in Mathematics of Computation
with
MSC (2000):
11C04,
12Y05
Retrieve articles in all Journals with
MSC (2000):
11C04,
12Y05
Additional Information:
John
Abbott
Affiliation:
Dipartimento di Matematica, Università di Genova, Italy
Email:
abbott@dima.unige.it
DOI:
10.1090/S0025-5718-00-01294-1
PII:
S 0025-5718(00)01294-1
Received by editor(s):
February 1, 2000
Posted:
October 17, 2000
Copyright of article:
Copyright
2000,
American Mathematical Society
|