Minimum number of monotone subsequences of length 4 in permutations

Abstract

We show that for every sufficiently large $n$, the number of monotone subsequences of length four in a permutation on $n$ points is at least $\left(\genfrac{}{}{0ex}{}{\lfloor n/3\rfloor }{4}\right)+\left(\genfrac{}{}{0ex}{}{\lfloor (n+1)/3\rfloor }{4}\right)+\left(\genfrac{}{}{0ex}{}{\lfloor (n+2)/3\rfloor }{4}\right)$. Furthermore, we characterize all permutations on $[n]$ that attain this lower bound. The proof uses the flag algebra framework together with some additional stability arguments. This problem is equivalent to some specific type of edge colorings of complete graphs with two colors, where the number of monochromatic $K_4$'s is minimized. We show that all the extremal colorings must contain monochromatic $K_4$'s only in one of the two colors. This translates back to permutations, where all the monotone subsequences of length four are all either increasing, or decreasing only.

arXiv comment24 pages, 7 figures, accepted to Combinatorics, Probability and Computing

References in corpus (10)

• On the Number of Pentagons in Triangle-Free Graphs
• Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
• Non-three-colorable common graphs exist
• Asymptotic Structure of Graphs with the Minimum Number of Triangles
• A new lower bound based on Gromov's method of selecting heavily covered points
• Turán densities of hypercubes
• On the minimal monochromatic K4-density
• The inducibility of small oriented graphs
• Counting monochromatic copies of K_4: a new lower bound for the Ramsey multiplicity problem
• On the number of monotone sequences

Cited by in corpus (17)

• Maximum density of an induced 5-cycle is achieved by an iterated blow-up of a 5-cycle
• Rainbow triangles in three-colored graphs
• Crossing numbers of complete tripartite and balanced complete multipartite graphs
• Inducibility of directed paths
• Counting Small Permutation Patterns
• Solving Turán's Tetrahedron Problem for the ${\ell }_2$-Norm
• The number of additive triples in subsets of abelian groups
• Improving bounds on packing densities of 4-point permutations
• Maximizing five-cycles in $K_r$-free graphs
• Semidefinite Programming and Ramsey Numbers
• Decomposing graphs into edges and triangles
• Patterns in Random Permutations
• Maximum Number of Almost Similar Triangles in the Plane
• On the number of monotone sequences
• Packing densities of layered permutations and the minimum number of monotone sequences in layered permutations
• The dimension of the feasible region of pattern densities
• Getting to the Root of the Problem: Sums of Squares for Limits of Trees