Re: linear algebra: help needed w/ counting algorithm

From: Aldar C-F. Chan (aldar_at_comm.utoronto.ca)
Date: 02/25/05 

Date: Fri, 25 Feb 2005 01:37:27 GMT

"Navin Kumar" <navin.kumar@gmail.com> wrote in message
news:1109284922.424400.63190@f14g2000cwb.googlegroups.com...

Sorry that I have mis-understood your question. So you want to find the
size of a subset S of F_p^N such that any N elements in S are linearly
independent. It is an interesting problem, but hard. Where are you
going to use it. I am wondering if the inclusion-exclusion principle helps
here, but it doesn't sound trivial. Just an off-the-track question, how the
dual of S would look like; I asked this because I am thinking would
counting the exclusion of the spanning set of S be easier. It's just some
random thoughts.

Quantcast