Published October 2008
| public
Journal Article
Bounds on degrees of p-adic separating polynomials
- Creators
- Katz, Daniel J.
- Zahl, Joshua
Abstract
We study a discrete optimization problem introduced by Babai, Frankl, Kutin, and Stefankovic (2001), which provides bounds on degrees of polynomials with p-adically controlled behavior. Such polynomials are of particular interest because they furnish bounds on the size of set systems satisfying Frankl-Wilson-type conditions modulo prime powers, with lower degree polynomials providing better bounds. We elucidate the asymptotic structure of solutions to the optimization problem, and we also provide an improved method for finding solutions in certain circumstances.
Additional Information
© 2008 Elsevier Inc. Received 18 July 2007. Available online 17 March 2008. Communicated by Bruce Rothschild. The authors wish to thank Richard M. Wilson for his helpful advice on this work and its presentation.Additional details
- Eprint ID
- 13581
- Resolver ID
- CaltechAUTHORS:KATjcta08
- Created
-
2009-05-08Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field