A new lower bound for the growth rate of Av(1324)

Abstract

The growth rate of Av(1324) is the last unknown Stanley-Wilf limit of a length-four pattern. Since 2020 the best rigorous lower bound has been the 10.271012 of Bevan, Brignall, Elvey Price and Pantone; we raise it to 10.412263. Their construction lays 1324-avoiders along an infinite staircase of two-cell blocks alternating with single connecting cells, and forbids a 1324 by a local condition on how the points of a block interleave with the components of the cell beside it. Certain points of a block, its leaves, may be exempted from that condition. They exempt them on one axis only, and report that they could not count the possibilities when both are exempted. This paper exempts them on both axes and counts the result. The second relaxation is their own argument read in the other axis, and the Harris correlation inequality bounds the joint count below by the product of the two counts taken separately, at the cost of one factor of the component generating function.

An explicit lower bound for the growth exponent of three-dimensional loop-erased random walk
Runsheng Liu
arXiv16 Sep 2026PreprintarXiv licenceFull textProbabilityarXiv
An explicit lower bound for the unit distance problem
Will Sawin
arXiv (Cornell University)20 May 2026PreprintLicence not statedFull text30 citedCombinatorics & discrete mathematicsOpenAlex
Optimizing Explicit Unit-Distance Lower-Bound Certificates
Michael T. M. Emmerich
arXiv (Cornell University)2 Jun 2026PreprintLicence not statedFull text9 citedCombinatorics & discrete mathematicsOpenAlex
Information Lower Bound for Regime Boundary Estimation — Optimal Precision Limit at the n² Scale and Universal Constant c=1/8 in the Fixed-Breakpoint Model
Shuiping Tang
Zenodo (CERN European Organization for Nuclear Research)1 Sep 2026PreprintLicence not stated7 citedStatisticsOpenAlex
Mathematical Classification of Switching Types and Hierarchical Structures: Three Switching Types, Six Hierarchical Structures, Coefficient of Variation Lower Bound, and Discretization Plateau Effect in the k-Regime Linear Switching Model
Shuiping Tang
Zenodo (CERN European Organization for Nuclear Research)7 Sep 2026PreprintLicence not stated6 citedStatisticsOpenAlex

Cite

BibTeX RIS

BibTeX

@misc{norton2026lower,
  title = {{A new lower bound for the growth rate of Av(1324)}},
  author = {Charles C. Norton},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2608.20292},
  eprint = {2608.20292},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2608.20292},
}

RIS

TY  - UNPB
TI  - A new lower bound for the growth rate of Av(1324)
AU  - Charles C. Norton
PY  - 2026
DA  - 2026/09/04
PB  - arXiv
DO  - 10.48550/arxiv.2608.20292
UR  - https://arxiv.org/abs/2608.20292
AB  - The growth rate of Av(1324) is the last unknown Stanley-Wilf limit of a length-four pattern. Since 2020 the best rigorous lower bound has been the 10.271012 of Bevan, Brignall, Elvey Price and Pantone; we raise it to 10.412263. Their construction lays 1324-avoiders along an infinite staircase of two-cell blocks alternating with single connecting cells, and forbids a 1324 by a local condition on how the points of a block interleave with the components of the cell beside it. Certain points of a block, its leaves, may be exempted from that condition. They exempt them on one axis only, and report that they could not count the possibilities when both are exempted. This paper exempts them on both axes and counts the result. The second relaxation is their own argument read in the other axis, and the Harris correlation inequality bounds the joint count below by the product of the two counts taken separately, at the cost of one factor of the component generating function.
ER  -

Abstract

Related

Cite