Enumeration of interval graphs and d‑representable complexes

How many essentially distinct ways are there to arrange n convex sets in R^d? Here, 'essentially distinct' means 'with different intersection pattern'. We discuss this question both in the dimension 1, where it amounts to counting the interval graphs, and in higher dimensions. Based on the joint works with Amzi Jeffs.

Bio
http://www.borisbukh.org/