Maximal disjoint Hyperplanes - MathOverflow most recent 30 from http://mathoverflow.net 2013-05-23T10:47:23Z http://mathoverflow.net/feeds/question/68824 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/68824/maximal-disjoint-hyperplanes Maximal disjoint Hyperplanes unknown (yahoo) 2011-06-26T01:44:44Z 2011-09-25T02:03:00Z <p>Given a set of $n^{r}$ points $X_{r} = \{ x_{1}, \cdots, x_{n^{r}} \}$ occupying a codim $t^{r}$ subspace in $\mathbb{R}^{n^{r}}$. Let $M_{r}$ be the set of $t^{r}$-tuples of these points.. So $|M_{r}| = \frac{n^{r}!}{(n^{r}-t^{r})!t^{r}!}$. Each $m \in M_{r}$ lie in a dim $t^{r}-1$ hyperplane in $\mathbb{R}^{n^{r}-t^{r}}$. So $M_{r}$ can be thought of as a set of dim $t^{r}-1$ hyperplanes. Consider $M_{sub,r}$ a subset of $M_{r}$. What is the maximum number of hyperplanes in $M_{sub,r}$ such that their intersection is empty?</p> <p>In my case there is a particular tensor structure to $M_{sub,r}$. That is $M_{sub,r}$ is just the $r$-fold tensor product of $M_{sub,1}$ and $|M_{sub,1}| = n$. Also $X_{r}$ is $n$-fold tensor product of $X$.</p> <p>Are there any known results or techniques to study this type of problem?</p>