On 12 March 2016 at 18:45, Dima Pasechnik <dimp...@gmail.com> wrote: > this lower bound is too optimistic. E.g. consider the nx(n choose 2) matrix > with 2 nonzeros per column. Erasing any two rows creates a O(n) > indistinguishable columns.
Ah, then I mis-stated the problem. I will go away and come back when I have sorted out what I meant to ask. John > > Dima > > -- > You received this message because you are subscribed to the Google Groups > "sage-support" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to sage-support+unsubscr...@googlegroups.com. > To post to this group, send email to sage-support@googlegroups.com. > Visit this group at https://groups.google.com/group/sage-support. > For more options, visit https://groups.google.com/d/optout. -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-support+unsubscr...@googlegroups.com. To post to this group, send email to sage-support@googlegroups.com. Visit this group at https://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/d/optout.
