Finally, my blogging break is over, and I plan to return to blogging regularly.

One of the topics that I wish to focus on now is incidences in . Already before the break I had a couple of posts about bounding incidences in by applying a second polynomial partitioning. The current post describes a recent application of incidences in , concerning minors of matrices. It is taken from a recent paper by Miriam Farber, Saurabh Ray, and Shakhar Smorodinsky.

* Miriam Farber, Saurabh Ray, and Shakhar Smorodinsky.*

Recall that a minor of a matrix is the determinant of some square submatrix of . For example, the following figure depicts a matrix with a minor of -6 and a minor of -4.

(Unlike in the figure, the rows and columns of the submatrix are not required to be consecutive.) Let be an matrix where is a constant that does not depend on . What can be said about the number of equal minors of ? There are such minors, and if we take all of the rows of to be identical, all of these minors become zero. This is of course cheating, since a zero minor means that the corresponding rows of are not linearly independent. Can we get a large number of minors whose value is, say, 1?

Indeed we can! Consider a matrix whose determinant is 1. Now replicate each of the rows in this matrix times, to obtain an matrix. One can easily verify that this matrix consists of exactly one minors. However, notice that the majority of the minors in this matrix are still zero. The question becomes more interesting when we do not allow our matrix to contain zero minors.

The analysis of Farber, Ray, and Smorodinsky works for the case when there are no zero minors, though they only mention it for the significantly more constrained case of totally positive matrices. My guess is that they specifically focus on such matrices since they are more well known and have many applications. Moreover, this seems to be a special case of a more general question concerning repeated minors in an totally positive matrix.

Let be an matrix with no zero minors, and consider the maximum number of 1 minors. The main idea is to reduce the problem to an incidence problem in , as follows. Each row of is a -dimensional vector, and can thus also be considered as a point in . Denote the set of these points as . For every set of rows of , we consider the zero set of

Advertisements