Michal Parnas

activity

20172020

collaborators

4 papers

math.CO2020

Circulant almost cross intersecting families

Michal Parnas

Let $F$ and $G$ be two $t$ -uniform families of subsets over $[k] = {1, 2, ..., k}$ , where $∣ F ∣ = ∣ G ∣$ , and let $C$ be the adjacency matrix of…

cs.DS2019

Property testing of the Boolean and binary rank

Michal Parnas, Dana Ron, Adi Shraibman

We present algorithms for testing if a $(0, 1)$ -matrix $M$ has Boolean/binary rank at most $d$ , or is $ε$ -far from Boolean/binary rank $d$ (i.e., at least an $ε$ -fraction of the ent…

math.CO2019

On maximal isolation sets in the uniform intersection matrix

Michal Parnas, Adi Shraibman

Let $A_{k, t}$ be the matrix that represents the adjacency matrix of the intersection bipartite graph of all subsets of size $t$ of ${1, 2, ..., k}$ . We give constructions of large i…

cs.CC2017

The Augmentation Property of Binary Matrices for the Binary and Boolean Rank

Michal Parnas, Adi Shraibman

We define the Augmentation property for binary matrices with respect to different rank functions. A matrix $A$ has the Augmentation property for a given rank function, if for any s…