Is this a known problem? Suppose I have a matrix A of size n x m and
entries in {0,1}, with the property that the columns are distinct. I
want to delete as many rows rows as possible without spoiling that
property, ending up with a subset of the rows which is as small as
possible, still with the property that the (shorter) columns are all
distinct. Ideally this will contain something like the ceiling of
log_2(m) rows, as that is a lower bound.
Someone with a more combinatorial background than me might recognise
it as a well-known problem in disguise?
John
--
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.
