NDLI: From Affine to Two-Source Extractors via Approximate Duality

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Ben-Sasson, Eli Ron-Zewi, Noga
Copyright Year	2015
Abstract	We establish a new connection between affine and two-source extractors by presenting black-box constructions of two-source extractors for min-entropy rate below half from any affine extractor for min-entropy rate below half. Two such constructions are presented, and one of our constructions can reach arbitrarily small min-entropy rate assuming that the affine extractor has sufficiently good parameters. The first part of our analysis shows that our constructions are two-source dispersers which are weak (but nontrivial) kinds of two-source extractors, also known as bipartite Ramsey graphs. To strengthen this result and obtain two-source extractors we introduce the approximate duality conjecture (ADC) and initiate its study. The ADC leads to a rather general result that can be used to convert a natural class of two-source dispersers---``low-rank dispersers''---into two-source extractors. More specifically, we first prove a special case of ADC that implies that the constructions mentioned above are two-source extractors with large (but nontrivial) constant error. In an attempt to reduce the error in our constructions we show that the polynomial Freiman--Ruzsa conjecture (PFR) in additive combinatorics implies a stronger approximate duality statement (and that this stronger statement also implies a weak but as-of-yet-unknown version of PFR). This stronger statement implies in turn that our constructions are two-source extractors with exponentially small error.
Starting Page	1670
Ending Page	1697
Page Count	28
File Format	PDF
ISSN	00975397
DOI	10.1137/12089003X
e-ISSN	10957111
Journal	SIAM Journal on Computing (SMJCAT)
Issue Number	6
Volume Number	44
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2015-11-10
Access Restriction	Subscribed
Subject Keyword	approximate duality polynomial Freiman--Ruzsa conjecture Probability in computer science extractors independent sources affine sources discrepancy ramSey graphs dispersers Graph theory Combinatorics
Content Type	Text
Resource Type	Article
Subject	Mathematics Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

From affine to two-source extractors via approximate duality

2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction

Affine Dispersers from Subspace Polynomials

A counterexample to a strong variant of the Polynomial Freiman-Ruzsa conjecture

Query complexity and the polynomial Freiman-Ruzsa conjecture

A counterexample to a strong variant of the Polynomial Freiman-Ruzsa conjecture in Euclidean space

Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs

Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors

An Additive Combinatorics Approach Relating Rank to Communication Complexity

From Affine to Two-Source Extractors via Approximate Duality

Similar Documents

From affine to two-source extractors via approximate duality

2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction

Affine Dispersers from Subspace Polynomials

A counterexample to a strong variant of the Polynomial Freiman-Ruzsa conjecture

Query complexity and the polynomial Freiman-Ruzsa conjecture

A counterexample to a strong variant of the Polynomial Freiman-Ruzsa conjecture in Euclidean space

Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs

Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors

An Additive Combinatorics Approach Relating Rank to Communication Complexity

From Affine to Two-Source Extractors via Approximate Duality