跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.23333 · v1

Classification of Forbidden 0-1 Patterns by Their Extremal Function

首次提交 2026-11-17 06:37
版本更新 2026-11-17 06:37
雷达观测 2026-11-19 19:09
arXiv ↗PDF ↗

摘要

This paper concerns the maximum weight of n×nn\times n 0-1 matrices that avoid some pattern PP, denoted ex⁡(n,P)\operatorname{ex}(n,P). Furedi and Hajnal initiated a research program of classifying all patterns according to their extremal function, but to date, only the weight-4 patterns are completely understood. In this paper we make progress on several fronts of the classification problem. A pattern is light if its columns have weight 1 and linear if ex⁡(n,P)=O(n)\operatorname{ex}(n,P)=O(n). We characterize the set of weight-5 linear light patterns, and the set of weight-5 linear patterns more generally. Along the way we identify several new infinite classes of linear patterns, which support the Pettie-Tardos conjecture on characterizing all linear light patterns. It was known that there exist infinitely many minimally nonlinear patterns. We identify a specific infinite set of minimally nonlinear patterns. We also prove that there are 2Ω(r)2^{Ω(r)} weight-rr minimally nonlinear patterns, and that every minimally nonlinear pattern has extremal function O(nlog⁡n)O(n\log n), with the exception of the 4-cycle. We classify many of the outstanding weight-5 patterns according to their extremal function, leaving only a small set remaining. The newly classified weight-5 patterns have extremal function Θ(n)Θ(n) or Θ(nα(n))Θ(nα(n)). We also exhibit a large number of weight-6 patterns with extremal function Θ(nlog⁡n/log⁡log⁡n)Θ(n\log n/\log\log n), which is notable in that this function had not been encountered before for any single pattern PP, though it was known to be the correct extremal function for a pair of forbidden patterns.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-17 06:37 · 最新观测版本

Classification of Forbidden 0-1 Patterns by Their Extremal Function

This paper concerns the maximum weight of n×nn\times n 0-1 matrices that avoid some pattern PP, denoted ex⁡(n,P)\operatorname{ex}(n,P). Furedi and Hajnal initiated a research program of classifying all patterns according to their extremal function, but to date, only the weight-4 patterns are completely understood. In this paper we make progress on several fronts of the classification problem. A pattern is light if its columns have weight 1 and linear if ex⁡(n,P)=O(n)\operatorname{ex}(n,P)=O(n). We characterize the set of weight-5 linear light patterns, and the set of weight-5 linear patterns more generally. Along the way we identify several new infinite classes of linear patterns, which support the Pettie-Tardos conjecture on characterizing all linear light patterns. It was known that there exist infinitely many minimally nonlinear patterns. We identify a specific infinite set of minimally nonlinear patterns. We also prove that there are 2Ω(r)2^{Ω(r)} weight-rr minimally nonlinear patterns, and that every minimally nonlinear pattern has extremal function O(nlog⁡n)O(n\log n), with the exception of the 4-cycle. We classify many of the outstanding weight-5 patterns according to their extremal function, leaving only a small set remaining. The newly classified weight-5 patterns have extremal function Θ(n)Θ(n) or Θ(nα(n))Θ(nα(n)). We also exhibit a large number of weight-6 patterns with extremal function Θ(nlog⁡n/log⁡log⁡n)Θ(n\log n/\log\log n), which is notable in that this function had not been encountered before for any single pattern PP, though it was known to be the correct extremal function for a pair of forbidden patterns.

查看此版本解读 →查看此版本原文 ↗