The Baxter permutation longest increasing subsequence exponent conjecture

A Baxter permutation of size nn is a permutation avoiding the two patterns specified in the source, and bipolar-oriented planar maps with general face degrees correspond to Baxter permutations; under this bijection, the longest increasing subsequence corresponds to the longest directed path. Let σn\sigma_n be a uniform Baxter permutation of size nn. Longest increasing subsequence exponent conjecture. The longest increasing subsequence in σn\sigma_n grows like n3/4n^{3/4} as nn\to\infty. This extends the paper's directed-distance predictions from bipolar-oriented triangulations to bipolar-oriented planar maps with general face-degree distributions, where the conjectured exponent is expected to follow from analogous scaling results.

Sources & referencesView supporting material

Primary source

Jacopo Borga and Ewain Gwynne, “Directed distances in bipolar-oriented triangulations: exact exponents and scaling limits”, arXiv:2510.26123 (2025).

Additional references

2 papers in this index state this conjecture (2011–2025). The statement above is taken from the most recent of them; the others are arXiv:1108.5615.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.