Bounds on degrees of p-adic separating polynomials

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

• Type: Journal
• Year: 2008
• Where: JCT
• Authors: Daniel J. Katz, Joshua Zahl
• Keywords: Discrete Optimization Problem, JCT 2008, Optimization Problem, Polynomials