Date & Time:
September 3, 2019 2:30 pm – 3:30 pm
Location:
Crerar 298, 5730 S. Ellis Ave., Chicago, IL,
09/03/2019 02:30 PM 09/03/2019 03:30 PM America/Chicago Timothy Black (UChicago) – Group-Theoretic Aspects of Complexity Theory and Coding Theory Crerar 298, 5730 S. Ellis Ave., Chicago, IL,

Group-Theoretic Aspects of Complexity Theory and Coding Theory

Group theory has long played a role in complexity theory, and vice versa. We explore two of these connections — to evasiveness, and to local list-decoding.

A boolean function in n variables is weakly evasive if its decision-tree complexity is Ω(n). By k-graphs we mean k-uniform hypergraphs. A k-graph property on v vertices is a boolean function on n = (v choose k) variables corresponding to the k-subsets of a v-set that is invariant under the v! permutations of the v-set (isomorphisms of k-graphs).

Rivest and Vuillemin (1976) proved that all non-constant monotone graph properties (k = 2) are weakly evasive, confirming a conjecture of Aanderaa and Rosenberg (1973). Kulkarni, Qiao, and Sun (2013) proved the analogous result for 3-graphs. We extend these results to k-graphs for every fixed k. From this, we show that monotone boolean functions invariant under the action of a large primitive group are weakly evasive.
While KQS (2013) employ the powerful topological approach of Kahn, Saks, and Sturtevant (1984) combined with heavy number theory, our argument is elementary and self-contained (modulo some basic group theory). Inspired by the outline of the KQS approach, we formalize the general framework of “orbit augmentation sequences” of sets with group actions. We show that a parameter of such sequences, called the “spacing,” is a lower bound on the decision-tree complexity for any nontrivial monotone property that is Γ-invariant for all groups Γ involved in the orbit augmentation sequence, assuming all those groups are p-groups. We develop operations on such sequences such as composition and direct product which will provide helpful machinery for our applications. We apply this general technique to k-graphs via certain liftings of k-graphs with wreath product action of p-groups.

The codewords of the homomorphism code aHom(G, H) are the affine homomorphisms between two finite groups, G and H, generalizing Hadamard codes. Following the work of Goldreich–Levin (1989), Grigorescu et al. (2006), Dinur et al. (2008), and Guo and Sudan (2014), we further expand the range of groups for which local list-decoding is possible up to mindist, the minimum distance of the code. In particular, for the first time, we do not require either G or H to be solvable. Specifically, we demonstrate a poly(1/ε) bound on the list size, i.e., on the number of codewords within distance (mindist – ε) from any received word, when G is either abelian or an alternating group, and H is an arbitrary (finite or infinite) group. We conjecture that a similar bound holds for all finite simple groups as domains; the alternating groups serve as the first test case.

The abelian vs. arbitrary result permits us to adapt previous techniques to obtain efficient local list-decoding for this case. In the alternating vs. arbitrary setting, we obtain a local algorithm that produces partial homomorphisms that uniquely extend to the homomorphisms in the list. We introduce this “semi-algorithmic” model, which we call Certificate List-Decoding, due to the severe technical difficulties in extending partial homomorphisms to full homomorphisms, even when the extension is unique. A homomorphism extender applied to a list of certificates  yields the desired list. 

The results on list decoding homomorphism codes are joint work with László Babai and Angela Wuu.
 

Timothy Black

Assistant Instructional Professor, Department of Computer Science

Timothy Black is an Assistant Instructional Professor.

Related News & Events

Students posing at competition

UChicago Undergrad Team Places Second Overall In Regionals For World’s Largest Programming Competition

Mar 17, 2023
Haifeng Xu

New CS and DSI Faculty Haifeng Xu Brings Strategic Intelligence to NeurIPS 2022

Nov 28, 2022

UChicago CS Research Finds New Angle on Database Query Processing with Geometry

Nov 08, 2022

Asst. Prof. Aloni Cohen Receives Award For Revealing Flaws in Deidentifying Data

Sep 09, 2022

UChicago Hosts NSF Workshop on Frontiers of Quantum Advantage

Aug 15, 2022

New 2022-23 Faculty Add Expertise in Linguistics, Visualization, Economics, and Data Science Education

Aug 11, 2022

UChicago Co-Leads $10 Million NSF Institute on Foundations of Data Science

Aug 09, 2022

Bill Fefferman Comments on New Standards for Quantum-Proof Cryptography

Jul 07, 2022

UChicago London Colloquium Features Data Science, Quantum Research

Jul 01, 2022

Faculty Bill Fefferman and Chenhao Tan Receive Google Research Scholar Awards

Jun 21, 2022

First-Year PhD Student Co-Authors Outstanding Paper Award Winner at TQC 2022

Apr 28, 2022

Quanta Magazine Features Prof. Bill Fefferman’s Work on Quantum Algorithms

Jan 20, 2022
arrow-down-largearrow-left-largearrow-right-large-greyarrow-right-large-yellowarrow-right-largearrow-right-smallbutton-arrowclosedocumentfacebookfacet-arrow-down-whitefacet-arrow-downPage 1CheckedCheckedicon-apple-t5backgroundLayer 1icon-google-t5icon-office365-t5icon-outlook-t5backgroundLayer 1icon-outlookcom-t5backgroundLayer 1icon-yahoo-t5backgroundLayer 1internal-yellowinternalintranetlinkedinlinkoutpauseplaypresentationsearch-bluesearchshareslider-arrow-nextslider-arrow-prevtwittervideoyoutube