Stability Theorems for Forbidden Configurations
Richard P. Anstee, Benjamin Kreiswirth, Bowen Li, Attila Sali, Jaehwan, Seok

TL;DR
This paper investigates stability phenomena in forbidden configurations within (0,1)-matrices, establishing conditions under which matrices close to extremal size maintain a specific structure.
Contribution
It provides new stability theorems for forbidden configurations, characterizing when matrices near extremal size resemble extremal structures in various growth regimes.
Findings
Matrices with size close to extremal have similar structure.
Characterization of forbidden configurations with quadratic and linear growth.
Structural stability results for different asymptotic regimes.
Abstract
Stability is a well investigated concept in extremal combinatorics. The main idea is that if some object is close in size to an extremal object, then it retains the structure of the extremal construction. In the present paper we study stability in the context of forbidden configurations. -matrix is a configuration in a -matrix if is a row and columns permutation of a submatrix of . denotes the set of -rowed -matrices with pairwise distinct columns without configuration , is the largest number of columns of a matrix in , while is the set of matrices in of size . We show cases (i) when each element of have the structure of element(s) in , (ii) and the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms
