home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!caen!uwm.edu!proclus.csd.uwm.edu!litow
- From: litow@csd4.csd.uwm.edu (bruce e litow)
- Newsgroups: sci.math
- Subject: some more exponential sums
- Date: 15 Oct 1992 18:36:52 GMT
- Organization: Computing Services Division, University of Wisconsin - Milwaukee
- Lines: 14
- Distribution: world
- Message-ID: <1bkdo4INNjvb@uwm.edu>
- NNTP-Posting-Host: 129.89.7.41
- Originator: litow@proclus.csd.uwm.edu
-
- Thanks to those who pointed out what I missed. Here is another
- question which seems to be more algebraic in nature. Let alpha be a
- primitive n-th root of unity and let P(x) be a polynomial over the
- integers of degree < PHI(n) the magnitude of whose coefficients is
- bounded above by 2^k. Clearly P(alpha) != 0 but is there a lower
- bound on |P(alpha)| in terms of n and k? Please mail responses to
- me. Thanks,
-
-
- Bruce Litow
- Computing Services Division
- P.O. Box 413
- Univ. Wisconsin-Milwaukee, Milwaukee, WI, 53201
- litow@proclus.csd.uwm.edu
-