Search Results for author: Mirjam Friesen

Found 2 papers, 2 papers with code

Fooling-sets and rank in nonzero characteristic (extended abstract)

1 code implementation2 May 2013 Mirjam Friesen, Dirk Oliver Theis

An n\times n matrix M is called a fooling-set matrix of size n, if its diagonal entries are nonzero, whereas for every k\ne \ell we have M_{k,\ell} M_{\ell, k} = 0.

Combinatorics 15B35, 05C70, 15B34, 94A05, 68Q15

Fooling sets and rank

1 code implementation14 Aug 2012 Mirjam Friesen, Aya Hamed, Troy Lee, Dirk Oliver Theis

An $n\times n$ matrix $M$ is called a \textit{fooling-set matrix of size $n$} if its diagonal entries are nonzero and $M_{k,\ell} M_{\ell, k} = 0$ for every $k\ne \ell$.

Combinatorics Computational Complexity 15B35, 05C70, 15B34, 94A05, 68Q15

Cannot find the paper you are looking for? You can Submit a new open access paper.