Bounding sequence extremal functions with formations
J.T. Geneson, Rohil Prasad, Jonathan Tidor

TL;DR
This paper introduces the concept of formation width to analyze extremal functions of sequences, providing new bounds for sequences with specific structures and applications to graph theory.
Contribution
It defines formation width and uses it to establish upper bounds on extremal functions for various sequences, generalizing previous results and introducing new bounds.
Findings
Established that fw((12...l)^t)=2t-1
Derived bounds for Ex((12...l)^t, n) involving inverse Ackermann function
Proved fw and extremal bounds for sequences of the form a v a v' a
Abstract
An -formation is a concatenation of permutations of letters. If is a sequence with distinct letters, then let be the maximum length of any -sparse sequence with distinct letters which has no subsequence isomorphic to . For every sequence define , the formation width of , to be the minimum for which there exists such that there is a subsequence isomorphic to in every -formation. We use to prove upper bounds on for sequences such that contains an alternation with the same formation width as . We generalize Nivasch's bounds on by showing that and for every and , such…
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
TopicsComputational Geometry and Mesh Generation · Point processes and geometric inequalities · Mathematical Approximation and Integration
