Bounding extremal functions of forbidden $0-1$ matrices using $(r,s)$-formations
Jesse Geneson, Meghal Gupta

TL;DR
This paper establishes tight bounds on the extremal functions of certain forbidden ordered sequences and 0-1 matrices using the concept of $(r,s)$-formations, advancing understanding in combinatorial matrix theory.
Contribution
It introduces a method to derive tight bounds on extremal functions for forbidden sequences and matrices using $(r,s)$-formations, connecting sequence and matrix extremal problems.
Findings
Derived tight bounds for extremal functions of specific ordered sequences.
Extended the $(r,s)$-formation technique to 0-1 matrix extremal problems.
Provided a unified approach for sequence and matrix extremal bounds.
Abstract
First, we prove tight bounds of on the extremal function of the forbidden pair of ordered sequences and using bounds on a class of sequences called -formations. Then, we show how an analogous method can be used to derive similar bounds on the extremal functions of forbidden pairs of matrices consisting of horizontal concatenations of identical identity matrices and their horizontal reflections.
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
Topicsgraph theory and CDMA systems · Mathematical Approximation and Integration · Point processes and geometric inequalities
