SearcharxivSearch

arXiv · 2609.13764

Coincidences and Growth of Boxed Mesh Patterns

Abstract

A boxed mesh pattern is a mesh pattern whose selected entries lie in an empty axis-parallel rectangle. We classify coincidences of boxed patterns with classical and vincular patterns, exhibit a genuinely bivincular coincidence, and prove that no boxed--bivincular coincidence occurs for patterns of length at least five. Together with known results, this shows that every boxed pattern of length at least five has factorial growth and hence fails the Stanley--Wilf property. At length four, one exceptional orbit is enumerated by the semi-Baxter numbers, while the remaining exceptional orbit, $\{2143,3412\}$, is unresolved; we conjecture that it has factorial growth. For Box(123), we derive an exact maximum-insertion identity and prove the subfactorial upper bound $2^{5n}n^{βn}$, where $β=\log_2(2\cos(π/7))<0.85$. A closed enumeration remains open. We also prove a general first-moment formula for boxed mesh patterns that depends only on the length of the underlying pattern; in particular, the expected number of Box(123) occurrences in a uniformly random permutation of length $n$ is asymptotic to $n\log n$. For Box(12), we identify the occurrence statistic with the up-degree in the strong Bruhat order, obtaining its maximum, its mean, and an exact insertion identity for the distribution polynomials. We conjecture that the coefficients of these polynomials are unimodal.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sergey Kitaev, Dun Qiu, Chao Xu. 2026-09-12. Coincidences and Growth of Boxed Mesh Patterns. https://arxiv.org/abs/2609.13764

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Orthogonal Pairs in Maps from the Sphere to the Circle

We prove that, for any $f:S^2\to S^1$ and any $\varepsilon>0$, there exist orthogonal vectors $x,y\in S^2$ such that the length of the shortest arc between $f(x)$ and $f(y)$ is at most $π/2 +\varepsilon$. This proves a conjecture of Ghebleh from 2007 that the circular chromatic number of the real orthogonality graph is equal to four.

math.CO

Exact Area-Range Minima in the Quantitative Monsky Problem for Five and Seven Triangles

For a dissection $D$ of the unit square into $n$ nondegenerate triangles, let $R(D)=\max_i a_i-\min_i a_i, Δ(n)=\inf_D R(D).$ We prove that this infimum is attained for every $n\ge2$, and determine the exact minima for $n=5$ and $n=7$, allowing T-junctions. For five triangles, $Δ(5)=\frac{5\sqrt5-11}{8};$ equality holds precisely when three areas equal $(3-\sqrt5)/4$ and two equal $(3\sqrt5-5)/8$. For seven triangles, $Δ(7)=r_7$, where $r_7$ is the unique root in $(0,1/4900)$ of $864r^4+2160r^3-6060r^2+4972r-1.$ Every minimizer has four areas $(1+3r_7)/7$ and three areas $(1-4r_7)/7$, although its geometry need not be unique. The proofs combine finite combinatorial classification with exact symbolic and integer-interval certificates. For nine triangles, a tilted-strip construction gives the explicit algebraic upper bound $Δ(9)\le 0.0001273496861283553341\ldots,$ which is the exact minimum within that topology. Conversely, every dissection in the complete single-cap two-rail zig-zag family, with arbitrary continuous areas, has range greater than $1/3500$; hence a global minimizer must lie outside that family. The exact value of $Δ(9)$ remains open.

math.CO

Chromatic symmetric functions for annular webs

We introduce a combinatorial definition of chromatic symmetric functions for annular webs. We prove their symmetry by constructing a web analogue of the Shareshian--Wachs involution and show that they coincide with the symmetric functions associated to annular webs via Turaev's isomorphism. We then derive explicit formulas for their hook Schur coefficients. We also introduce web LLT functions, whose hook Schur coefficients admit positive Laurent-polynomial formulas. These formulas yield a combinatorial expression for the coefficients of the HOMFLY--PT polynomial of an annular web.

math.CO