4
$\begingroup$

Let $M$ be a $2^n \times 2^n$ matrix over real number field, where the rows and columns are indexed by subsets of $[n] := \{1,2,\ldots,n\}$, and defined as follows, $ M_{A, B} = 1 $ if $A \subseteq B$; $M_{A, B} = -1$ if $B \subsetneq A$; $M_{A, B}$ can take arbitrary value over $\mathbb{R}$.

In words, $M$ is a matrix with some missing entries. Is there some result lower bounds the rank of matrix $M$, for example, $rk(M) \ge n^{\Omega(\log n)}$.

$\endgroup$
5
  • $\begingroup$ What does "undefined" mean? Do you need the lower bound for all matrices with some prescribed values? $\endgroup$ Feb 7, 2013 at 15:16
  • $\begingroup$ "undefined" = could take any value. Lower bound means the lower bound for all such matrices $\endgroup$
    – jsliyuan
    Feb 8, 2013 at 0:43
  • $\begingroup$ Do you have constructions that allow reducing the rank so much?? $\endgroup$
    – Suvrit
    Feb 8, 2013 at 3:57
  • $\begingroup$ (it seems to be easy to reduce the rank $2^{n/2}$, but one needs something more clever to reduce it even further...) $\endgroup$
    – Suvrit
    Feb 8, 2013 at 4:00
  • $\begingroup$ I think I have constructions achieving this bound. But I don't know how to prove the lower bound. $\endgroup$
    – jsliyuan
    Feb 8, 2013 at 7:26

1 Answer 1

3
$\begingroup$

Amazingly (to me) the rank can be as low as $n$. Simply define $M_{A,B}=1$ when $|A| \le |B|$ and $M_{A,B}=-1$ when $|A| \gt |B|.$ This is consistent with the previous requirements and makes the $A$ row depend only on $|A|.$

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.