The extremal theory of forbidden 0-1 matrices studies the asymptotic growth of the function $\mathrm{Ex}(P,n)$, which is the maximum weight of a matrix $A\in\{0,1\}^{n\times n}$ whose submatrices avoid a fixed pattern $P\in\{0,1\}^{k\times l}$. This theory has been wildly successful at resolving problems in combinatorics, discrete and computational geometry, structural graph theory, and the analysis of data structures, particularly corollaries of the dynamic optimality conjecture. All these applications use acyclic patterns, meaning that when $P$ is regarded as the adjacency matrix of a bipartite graph, the graph is acyclic. The biggest open problem in this area is to bound $\mathrm{Ex}(P,n)$ for acyclic $P$. Prior results have only ruled out the strict $O(n\log n)$ bound conjectured by Furedi and Hajnal. It is consistent with prior results that $\forall P. \mathrm{Ex}(P,n)\leq n\log^{1+o(1)} n$, and also consistent that $\forall \epsilon>0.\exists P. \mathrm{Ex}(P,n) \geq n^{2-\epsilon}$. In this paper we establish a stronger lower bound on the extremal functions of acyclic $P$. Specifically, we give a new construction of relatively dense 0-1 matrices with $\Theta(n(\log n/\log\log n)^t)$ 1s that avoid an acyclic $X_t$. Pach and Tardos have conjectured that this type of result is the best possible, i.e., no acyclic $P$ exists for which $\mathrm{Ex}(P,n)\geq n(\log n)^{\omega(1)}$.

翻译：禁止0-1矩阵的极值理论研究函数$\mathrm{Ex}(P,n)$的渐近增长，该函数定义为：在$n\times n$的0-1矩阵$A$中，若其所有子矩阵均不包含固定模式$P\in\{0,1\}^{k\times l}$，则$A$的最大权重（即1的个数）为$\mathrm{Ex}(P,n)$。这一理论在解决组合学、离散与计算几何、结构图论以及数据结构分析（特别是动态最优性猜想的推论）中的问题方面取得了巨大成功。所有这些应用均涉及无环模式，即当$P$被视为二分图的邻接矩阵时，该图为无环图。该领域最大的开放问题是对无环$P$的$\mathrm{Ex}(P,n)$进行上界估计。此前的研究仅排除了Furedi和Hajnal猜想中的严格$O(n\log n)$界。现有结果一致表明：对所有$P$，有$\mathrm{Ex}(P,n)\leq n\log^{1+o(1)} n$；同时也一致表明：对任意$\epsilon>0$，存在$P$使得$\mathrm{Ex}(P,n) \geq n^{2-\epsilon}$。本文建立了无环$P$极值函数的更强下界。具体而言，我们提出了一种新的构造方法，生成相对密集的0-1矩阵，其中包含$\Theta(n(\log n/\log\log n)^t)$个1，且避免无环$X_t$。Pach和Tardos猜想此类结果已达到最优，即不存在无环$P$使得$\mathrm{Ex}(P,n)\geq n(\log n)^{\omega(1)}$。