research
∙
07/18/2023
Approximately counting independent sets in dense bipartite graphs via subspace enumeration
We give a randomized algorithm that approximates the number of independe...
share
research
∙
01/23/2023
Blocking sets, minimal codes and trifferent codes
We prove new upper bounds on the smallest size of affine blocking sets, ...
research
∙
04/05/2022
Algorithms for the ferromagnetic Potts model on expanders
We give algorithms for approximating the partition function of the ferro...
research
∙
09/28/2021
On the Geometry of Stable Steiner Tree Instances
In this note we consider the Steiner tree problem under Bilu-Linial stab...
research
∙
09/13/2021
Enumerating independent sets in Abelian Cayley graphs
We show that any connected Cayley graph Γ on an Abelian group of order 2...
research
∙
09/08/2021
Approximately counting independent sets in bipartite graphs via graph containers
By implementing algorithmic versions of Sapozhenko's graph container met...
research
∙
05/04/2020
On the list recoverability of randomly punctured codes
We show that a random puncturing of a code with good distance is list re...
research
∙
07/18/2019
On the AC^0[⊕] complexity of Andreev's Problem
Andreev's Problem states the following: Given an integer d and a subset ...
research
∙
07/07/2019
A spectral bound on hypergraph discrepancy
Let H be a t-regular hypergraph on n vertices and m edges. Let M be the ...
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
∙
02/20/2019
Improved efficiency for explicit covering codes matching the sphere-covering bound
A covering code is a subset of vectors over a finite field with the prop...
research
∙
11/05/2018
Discrepancy in random hypergraph models
We study hypergraph discrepancy in two closely related random models of ...
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
∙
12/17/2017
Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields
Reed-Muller codes are some of the oldest and most widely studied error-c...
research
∙
09/03/2017
