Max-3-Lin over Non-Abelian Groups with Universal Factor Graphs

by   Amey Bhangale, et al.

Factor graph of an instance of a constraint satisfaction problem with n variables and m constraints is the bipartite graph between [m] and [n] describing which variable appears in which constraints. Thus, an instance of a CSP is completely defined by its factor graph and the list of predicates. We show inapproximability of Max-3-LIN over non-abelian groups (both in the perfect completeness case and in the imperfect completeness case), with the same inapproximability factor as in the general case, even when the factor graph is fixed. Along the way, we also show that these optimal hardness results hold even when we restrict the linear equations in the Max-3-LIN instances to the form x * y * z = g, where x, y, z are the variables and g is a group element. We use representation theory and Fourier analysis over non-abelian groups to analyze the reductions.



There are no comments yet.


page 1

page 2

page 3

page 4


Optimal Inapproximability of Satisfiable k-LIN over Non-Abelian Groups

A seminal result of Håstad [J. ACM, 48(4):798–859, 2001] shows that it i...

Linear Space Streaming Lower Bounds for Approximating CSPs

We consider the approximability of constraint satisfaction problems in t...

Imperfect Gaps in Gap-ETH and PCPs

We study the role of perfect completeness in probabilistically checkable...

The complexity of 3-colouring H-colourable graphs

We study the complexity of approximation on satisfiable instances for gr...

Factor Graph Grammars

We propose the use of hyperedge replacement graph grammars for factor gr...

On SAT representations of XOR constraints

We study the representation of systems S of linear equations over the tw...

Estimating grouped data models with a binary dependent variable and fixed effect via logit vs OLS: the impact of dropped units

This letter deals with a very simple issue: if we have grouped data with...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.