Four posts ago I wrote about three recent breakthroughs in combinatorics and in the following post I would like to mention some problems that I posed over the years that are loosely related to these advances.

## Rank of incidence matrices and *q*-analogs

The goal of finding *q*-analogs of combinatorial results where, roughly speaking, sets are replaced by subspaces of vector spaces over a field with elements, is common both in enumerative combinatorics and in extremal combinatorics. A recent breakthrough we discussed by Keevash, Sah, and Sawhney was about the existence of -analogs of designs (subspace designs).

I will mention a problem (Question 4) in this direction about incidence matrices, following three questions that have largely been solved.

### Incidence matrices and weighted incidence matrices for sets

The incidence matrix of -subsets vs. -subsets of , is a matrix whose rows correspond to -subsets of , whose columns correspond to -subsets of , and the entry equals 1 if , and equals 0 if .

A weighted incidence matrix of -subsets vs. -subsets of , is a matrix whose rows correspond to -subsets of , whose columns correspond to -subsets of , and if and if .

**Question 1:** What is the rank of the incidence matrix of -subsets vs. -subsets of , over a field of characteristic .

This question was beautifully answered by Richard Wilson in 1990 . The problem was posed by Nati Linial and Bruce Rothschild in 1981 and they settled the case . (The answer for , , that motivated the question, had been observed earlier by Perles and by Frankl.) It is unforgivable that I did not present the statement of Wilson’s theorem here on the blog.

**Question 2:** What is the minimum rank, denoted by , of a weighted incidence matrix of -subsets vs. -subsets of $[n]$ over a field of characteristic .

I answered this question in the early 80s (it is related also related to various results presented by other researchers around the same time). The answer is , and remarkably it is independent from the characteristic .

### Incidence matrices and weighted incidence matrices for subspaces

The incidence matrix of -dimensional subspaces vs. -dimensional subspaces of ( has entries if and if .

A weighted incidence matrix of -dimensional subspaces vs. -dimensional subspaces of () has entries if and if .

We pose two additional questions which are the “*q*-analogs” of Questions 1 and 2.

**Question 3:** What is the rank of the incidence matrix over a field of characteristic $p$ (you can simply take the field ).

Frumkin and Yakir settled problem 3 when is not a power of .

The problem I wish to pose (again) here is:

**Question 4: ** What is the minimum rank denoted by of a weighted incidence matrix over a field of characteristic .

In particular, I would like to know if the answer does not depend on and if it agrees with some easy lower bounds (obtained from certain identity submatrices) like in the case of a field with one element (namely, subsets).

## q-trees

**Qoestion 5:** What are the *q*-analogs of trees? (and hypertrees).

The basic idea is first to first find weights so that the incidence matrix of 1-subspace vs 2-subspaces has rank , and then the -trees will correspond to collection of 2-spaces with linearly independent columns. (I don’t expect uniqueness.) This is a somewhat related to a -analog of the notion of symmetric matroids that I studied in the late 80s.

A year ago Ferdinand Ihringer, Motaz Mokatren and I made some very preliminary steps in this direction before moving on (separately) to other projects. It will be nice to come back to it.

**Remark:** There are even greater generalities where problems can be extended from set systems (graphs and hypergraphs) to more general algebraic objects. Those could be related to general primitive permutation groups, to association schemes, and to other objects in algebraic combinatorics.

## Unit distances and related problems in discrete geometry.

Let be a normed space. For a set the unit distance graph is the graph whose vertices are points in and two vertices are adjacent if their distance is one.

We can consider the following quantities

1) : The maximum size of a unit distance set in . (In other words, the maximum clique in .)

2) : The number of colors needed for if two points of unit distance are colored with different colors.

3) : The maximum number of colors needed to color points in a set of diameter 1 if every color set has a diameter smaller than 1. (This is the Borsuk number of .)

4) The maximum number of colors needed to color points in a finite set of diameter 1 if two points of unit distance are colored with different colors.

5) The maximum number of points of norm 1 with pairwise distances at least 1.

6) The maximum over all sets with points of pairwise distance at least one, of the minimum degree in the unit distance graph .

7) The maximum over all sets with points of pairwise distance at least one of the chromatic number of the unit distance graph of .

Estimating these seven quantities for Euclidean spaces and for other normed spaces are well-known problems. (See my survey article on problems around Borsuk’s problem.) Alon, Bucić, and Sauermann made a remarkable breakthrough on the first problem of the largest clique in unit distance graphs for arbitrary normed spaces.

Jordan Ellenberg asked: “Does the Alon-Bucic-Sauermann result give you upper bounds for the chromatic number of (the unit distance graph of) with a typical norm? (Or is that already easy for some reason?) “. But I know little about Jordan’s question.

There is much to say about them but I will not discuss these problems here. I will mention a single annoying problem.

**Question 6:** Is there an example of a normed space such that ?

(I am not even sure if for the seventh item it makes a difference to consider finite .)

## Intersection patterns of standard boxes

In the post that I mentioned we also discussed Tomon’s remarkable result on intersection patterns of standard boxes. Here is a loosely related problem. In short, we want to find topological analogs for results on intersection patterns of standard boxes.

Topological Helly-type theorems is an important direction in geometric and topological combinatorics. The idea is to prove Helly type theorems about convex sets in a much wider topological context.

A primary goal of Topological Helly-type theorems is to extend results for nerves of families of convex sets in to the class of -Leray simpilcial complexes. Among the results achieved so far are: The upper bound theorem; Eckhoff’s conjecture; Alon and Kleitman’s (p,q)-theorem; colorful and matroidal Helly’s theorem; topological Amenta’s theorem, and more.

Another goal of Topological Helly-type theorems is to study if results on nerves of standard boxes can be extended to flag -Leray simplicial complexes?

In this direction the immediate goal is to extend Eckhoff’s upper bound theorem. (Item 3 in this post.)

**Question 7.** Conjecture: Let be a Leray flag complex of dimension with $n$ vertices. Then the -vector of obeys Eckhoff’s upper bound theorem for standard boxes.

A closely related question is

**Question 8.** Conjecture: Let be a -Leray flag complex of dimension , then the -vector of is the -vector of a completely balanced -dimensional -Leray complex.

Studying the equality cases of the conjecture is also of interest and the extremal complexes can also be regarded as some sort of ultra-trees.

Roy Meshulam and I worked together on topological Helly type theorems for more than two decades.