Extractors for Images of Varieties
Zeyu Guo, Ben Lee Volk, Akhil Jalan, David Zuckerman
Abstract
We construct explicit deterministic extractors for polynomial images of varieties, that is, distributions sampled by applying a low-degree polynomial map f : F r q → F n q to an element sampled uniformly at random from a k-dimensional variety V ⊆ F r q . This class of sources generalizes both polynomial sources, studied by Dvir, Gabizon and Wigderson (FOCS 2007, Comput. Complex. 2009), and variety sources, studied by Dvir (CCC 2009, Comput. Complex. 2012). Assuming certain natural non-degeneracy conditions on the map f and the variety V , which in particular ensure that the source has enough min-entropy, we extract almost all the minentropy of the distribution. Unlike the Dvir-Gabizon-Wigderson and Dvir results, our construction works over large enough finite fields of arbitrary characteristic. One key part of our construction is an improved deterministic rank extractor for varieties. As a by-product, we obtain explicit Noether normalization lemmas for affine varieties and affine algebras. Additionally, we generalize a construction of affine extractors with exponentially small error due to Bourgain, Dvir and Leeman (Comput. Complex. 2016) by extending it to all finite prime fields of quasipolynomial size.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 26952896-8636-4757-924f-a4e4f035ad9cCited by top-tier papers2
- Extracting Randomness from Samplable Distributions, RevisitedMarshall Ball, Eli Goldin, Dana Dachman-Soled, Saachi MutrejaFOCS 2023 · 3 citations
- Random Gabidulin Codes Achieve List Decoding Capacity in the Rank MetricZeyu Guo, Chaoping Xing, Chen Yuan, Zihan ZhangFOCS 2024 · 2 citations
Builds on2
- Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else)Divesh Aggarwal, Huck Bennett, Alexander Golovnev, Noah Stephens-DavidowitzSODA 2021 · 22 citations
- Affine Extractors for Almost Logarithmic EntropyEshan Chattopadhyay, Jesse Goodman, Jyun-Jie LiaoFOCS 2021 · 7 citations
Related papers
- Extractors for Samplable Distributions from the Two-Source Extractor RecipeJustin Oh, Ronen ShaltielSTOC 2026 · 2 citations
- Extractors for sum of two sourcesEshan Chattopadhyay, Jyun-Jie LiaoSTOC 2022 · 2 citations
- Efficient Randomized Strong 2-Source Non-malleable Extractor for Any Linear Min-EntropyDivesh Aggarwal, Pranjal Dutta, Saswata Mukherjee, Satyajeet Nagargoje et al.CRYPTO 2025
- Improved Extractors for Small-Space SourcesEshan Chattopadhyay, Jesse GoodmanFOCS 2021 · 6 citations
- Leakage-Resilient Extractors against Number-on-Forehead ProtocolsEshan Chattopadhyay, Jesse GoodmanSTOC 2025 · 1 citation
