Document Open Access Logo

Hilbert Functions and Low-Degree Randomness Extractors

Authors Alexander Golovnev , Zeyu Guo , Pooya Hatami , Satyajeet Nagargoje , Chao Yan

PDF
Thumbnail PDF

File

LIPIcs.APPROX-RANDOM.2024.41.pdf
  • Filesize: 0.86 MB
  • 24 pages

Document Identifiers

Author Details

Alexander Golovnev
  • Georgetown University, Washington, DC, United States of America
Zeyu Guo
  • The Ohio State University, Columbus, OH, United States of America
Pooya Hatami
  • The Ohio State University, Columbus, OH, United States of America
Satyajeet Nagargoje
  • Georgetown University, Washington, DC, United States of America
Chao Yan
  • Georgetown University, Washington, DC, United States of America

Funding

  • Golovnev, Alexander: Supported by the NSF CAREER award (grant CCF-2338730)
  • Hatami, Pooya: Supported by NSF grant CCF-1947546.
  • Nagargoje, Satyajeet: Supported by the NSF CAREER award (grant CCF-2338730)
  • Yan, Chao: Research supported in part by by a gift to Georgetown University.

Acknowledgements

We thank Omar Alrabiah, Jesse Goodman, Jonathan Mosheiff, and João Ribeiro for sharing with us an early draft of their work. We would also like to thank Jesse Goodman and S. Venkitesh for helpful discussions and pointers. We are very grateful to the anonymous reviewers for their comments and pointers to related work. Part of this work was conducted while the second author was visiting the Simons Institute for the Theory of Computing at UC Berkeley; he extends his thanks to the institute for its support and hospitality.

Cite AsGet BibTex

Alexander Golovnev, Zeyu Guo, Pooya Hatami, Satyajeet Nagargoje, and Chao Yan. Hilbert Functions and Low-Degree Randomness Extractors. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 317, pp. 41:1-41:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.41

Abstract

For S ⊆ 𝔽ⁿ, consider the linear space of restrictions of degree-d polynomials to S. The Hilbert function of S, denoted h_S(d,𝔽), is the dimension of this space. We obtain a tight lower bound on the smallest value of the Hilbert function of subsets S of arbitrary finite grids in 𝔽ⁿ with a fixed size |S|. We achieve this by proving that this value coincides with a combinatorial quantity, namely the smallest number of low Hamming weight points in a down-closed set of size |S|. Understanding the smallest values of Hilbert functions is closely related to the study of degree-d closure of sets, a notion introduced by Nie and Wang (Journal of Combinatorial Theory, Series A, 2015). We use bounds on the Hilbert function to obtain a tight bound on the size of degree-d closures of subsets of 𝔽_qⁿ, which answers a question posed by Doron, Ta-Shma, and Tell (Computational Complexity, 2022). We use the bounds on the Hilbert function and degree-d closure of sets to prove that a random low-degree polynomial is an extractor for samplable randomness sources. Most notably, we prove the existence of low-degree extractors and dispersers for sources generated by constant-degree polynomials and polynomial-size circuits. Until recently, even the existence of arbitrary deterministic extractors for such sources was not known.

Subject Classification

ACM Subject Classification
  • Theory of computation → Pseudorandomness and derandomization
Keywords
  • Extractors
  • Dispersers
  • Circuits
  • Hilbert Function
  • Randomness
  • Low Degree Polynomials

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, and João Ribeiro. Low-degree polynomials extract from local sources. In ICALP, 2022. Google Scholar
  2. Omar Alrabiah, Jesse Goodman, Jonathan Mosheiff, and João Ribeiro. Low-degree polynomials are good extractors. Manuscript, 2024. Google Scholar
  3. Dave Bayer and David Mumford. What can be computed in algebraic geometry? arXiv preprint, 1993. URL: https://arxiv.org/abs/alg-geom/9304003.
  4. Paul Beame, Shayan Oveis Gharan, and Xin Yang. On the bias of Reed-Muller codes over odd prime fields. SIAM Journal on Discrete Mathematics, 34(2):1232-1247, 2020. Google Scholar
  5. Peter Beelen and Mrinmoy Datta. Generalized Hamming weights of affine Cartesian codes. Finite Fields and Their Applications, 51:130-145, 2018. Google Scholar
  6. Ido Ben-Eliezer, Rani Hod, and Shachar Lovett. Random low-degree polynomials are hard to approximate. computational complexity, 21(1):63-81, 2012. Google Scholar
  7. Manuel Blum. Independent unbiased coin flips from a correlated biased source - A finite state Markov chain. Combinatorica, 6:97-108, 1986. Google Scholar
  8. Andrej Bogdanov and Siyao Guo. Sparse extractor families for all the entropy. In ITCS, 2013. Google Scholar
  9. Eshan Chattopadhyay, Jesse Goodman, and Mohit Gurumukhani. Extractors for polynomial sources over 𝔽₂. In ITCS, 2024. Google Scholar
  10. Kuan Cheng and Xin Li. Randomness extraction in AC⁰ and with small locality. In RANDOM, 2018. Google Scholar
  11. Benny Chor and Oded Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM Journal on Computing (SICOMP), 17(2):230-261, 1988. Google Scholar
  12. Gil Cohen and Avishay Tal. Two structural results for low degree polynomials and applications. In RANDOM, 2015. Google Scholar
  13. David Cox, John Little, and Donal O'Shea. Ideals, varieties, and algorithms: an introduction to computational algebraic geometry and commutative algebra. Springer, 2013. Google Scholar
  14. Anindya De and Thomas Watson. Extractors and lower bounds for locally samplable sources. In RANDOM, 2011. Google Scholar
  15. Yevgeniy Dodis, Shien Jin Ong, Manoj Prabhakaran, and Amit Sahai. On the (im)possibility of cryptography with imperfect randomness. In FOCS, 2004. Google Scholar
  16. Yevgeniy Dodis and Kevin Yeo. Doubly-affine extractors, and their applications. In ITC, 2021. Google Scholar
  17. Dean Doron, Amnon Ta-Shma, and Roei Tell. On hitting-set generators for polynomials that vanish rarely. Computational Complexity, 31(2):16, 2022. Google Scholar
  18. Bálint Felszeghy. Gröbner theory of zero dimensional ideals with a view toward combinatorics. PhD thesis, Budapest University of Technology and Economics, 2007. Google Scholar
  19. Oded Goldreich, Emanuele Viola, and Avi Wigderson. On randomness extraction in AC⁰. In CCC, 2015. Google Scholar
  20. Alexander Golovnev, Zeyu Guo, Pooya Hatami, Satyajeet Nagargoje, and Chao Yan. Hilbert functions and low-degree randomness extractors, 2024. URL: https://eccc.weizmann.ac.il/report/2024/092/.
  21. Petra Heijnen. Some classes of linear codes: observations about their structure, construction, (non-)existence and decoding. PhD thesis, Technische Universiteit Eindhoven, 1999. Google Scholar
  22. Petra Heijnen and Ruud Pellikaan. Generalized Hamming weights of q-ary Reed-Muller codes. IEEE Transactions on Information Theory (ToIT), 44(1):181-196, 1998. Google Scholar
  23. Wassily Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13-30, 1963. Google Scholar
  24. Xuangui Huang, Peter Ivanov, and Emanuele Viola. Affine extractors and AC⁰-parity. In RANDOM, 2022. Google Scholar
  25. Piotr Indyk. Uncertainty principles, extractors, and explicit embeddings of L2 into L1. In STOC, 2007. Google Scholar
  26. Tali Kaufman, Shachar Lovett, and Ely Porat. Weight distribution and list-decoding size of Reed-Muller codes. IEEE Transactions on Information Theory (ToIT), 58(5):2689-2696, 2012. Google Scholar
  27. Peter Keevash and Benny Sudakov. Set systems with restricted cross-intersections and the minimum rank ofinclusion matrices. SIAM Journal on Discrete Mathematics, 18(4):713-727, 2005. Google Scholar
  28. Swastik Kopparty and Srikanth Srinivasan. Certifying polynomials for AC⁰[⊕] circuits, with applications to lower bounds and circuit compression. Theory of Computing, 14(12):1-24, 2018. Google Scholar
  29. Jiatu Li and Tianqi Yang. 3.1n-o(n) circuit lower bounds for explicit functions. In STOC, 2022. Google Scholar
  30. Xin Li. Two source extractors for asymptotically optimal entropy, and (many) more. arXiv preprint, 2023. URL: https://arxiv.org/abs/2303.06802.
  31. Michael Mitzenmacher and Eli Upfal. Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis. Cambridge University Press, 2017. Google Scholar
  32. Shay Moran and Cyrus Rashtchian. Shattered sets and the Hilbert function. In MFCS, 2016. Google Scholar
  33. Zipei Nie and Anthony Y. Wang. Hilbert functions and the finite degree Zariski closure in finite field combinatorial geometry. Journal of Combinatorial Theory, Series A, 134:196-220, 2015. Google Scholar
  34. Noam Nisan and David Zuckerman. Randomness is linear in space. Journal of Computer and System Sciences, 52(1):43-52, 1996. URL: https://doi.org/10.1006/jcss.1996.0004.
  35. Igor Carboni Oliveira, Rahul Santhanam, and Srikanth Srinivasan. Parity helps to compute majority. In CCC, 2019. Google Scholar
  36. Alexander A. Razborov. Lower bounds on the size of bounded depth circuits over a complete basis with logical addition. Mathematical notes of the Academy of Sciences of the USSR, 41(4):333-338, 1987. Google Scholar
  37. Zachary Remscrim. The Hilbert function, algebraic extractors, and recursive Fourier sampling. In FOCS, 2016. Google Scholar
  38. Miklos Santha and Umesh V. Vazirani. Generating quasi-random sequences from semi-random sources. Journal of Computer and System Sciences (JCSS), 33(1):75-87, 1986. URL: https://doi.org/10.1016/0022-0000(86)90044-9.
  39. Roman Smolensky. Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In STOC, 1987. Google Scholar
  40. Roman Smolensky. On representations by low-degree polynomials. In FOCS, 1993. Google Scholar
  41. Srikanth Srinivasan. A robust version of Hegedűs’s lemma, with applications. TheoretiCS, 2, 2023. Google Scholar
  42. Amnon Ta-Shma and David Zucherman. Extractor codes. In STOC, 2001. Google Scholar
  43. Luca Trevisan and Salil Vadhan. Extracting randomness from samplable distributions. In FOCS, 2000. Google Scholar
  44. Salil P. Vadhan. Constructing locally computable extractors and cryptosystems in the bounded-storage model. Journal of Cryptology, 17:43-77, 2004. Google Scholar
  45. Emanuele Viola. The complexity of constructing pseudorandom generators from hard functions. Computational Complexity, 13(3-4):147-188, 2005. Google Scholar
  46. Emanuele Viola. The complexity of distributions. SIAM Journal on Computing (SICOMP), 41(1):191-218, 2012. Google Scholar
  47. Emanuele Viola. Extractors for circuit sources. SIAM Journal on Computing (SICOMP), 43(2):655-672, 2014. Google Scholar
  48. Emanuele Viola. Quadratic maps are hard to sample. ACM Transactions on Computation Theory (TOCT), 8(4):1-4, 2016. Google Scholar
  49. Victor K. Wei. Generalized Hamming weights for linear codes. IEEE Transactions on Information Theory (ToIT), 37(5):1412-1418, 1991. Google Scholar
  50. Avi Wigderson and David Zuckerman. Expanders that beat the eigenvalue bound: Explicit construction and applications. Combinatorica, 19(1):125-138, 1999. URL: https://doi.org/10.1007/s004930050049.
  51. David Zuckerman. Linear degree extractors and the inapproximability of max clique and chromatic number. Theory of Computing, 3(6):103-128, 2007. URL: https://doi.org/10.4086/toc.2007.v003a006.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact