research
∙
08/12/2023
Effective Bounds for Restricted 3-Arithmetic Progressions in 𝔽_p^n
For a prime p, a restricted arithmetic progression in 𝔽_p^n is a triplet...
share
research
∙
07/30/2023
On Approximability of Satisfiable k-CSPs: IV
We prove a stability result for general 3-wise correlations over distrib...
research
∙
11/17/2021
Max-3-Lin over Non-Abelian Groups with Universal Factor Graphs
Factor graph of an instance of a constraint satisfaction problem with n ...
research
∙
09/26/2021
Mixing of 3-term progressions in Quasirandom Groups
In this note, we show the mixing of three-term progressions (x, xg, xg^2...
research
∙
09/06/2020
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...
research
∙
06/24/2020
Hardness of Approximation of (Multi-)LCS over Small Alphabet
The problem of finding longest common subsequence (LCS) is one of the fu...
research
∙
05/06/2020
Rigid Matrices From Rectangular PCPs
We introduce a variant of PCPs, that we refer to as rectangular PCPs, wh...
research
∙
04/02/2019
Simplified inpproximability of hypergraph coloring via t-agreeing families
We reprove the results on the hardness of approximating hypergraph color...
research
∙
10/05/2018
Improved Inapproximability of Rainbow Coloring
A rainbow q-coloring of a k-uniform hypergraph is a q-coloring of the ve...
research
∙
01/14/2018
Near-optimal approximation algorithm for simultaneous Max-Cut
In the simultaneous Max-Cut problem, we are given k weighted graphs on t...
research
∙
09/03/2017
