Papers
Topics
Authors
Recent
Search
2000 character limit reached

On a Quadratic Relation Between Stanley-Wilf Limits and Füredi-Hajnal Limits

Published 19 Feb 2026 in math.CO | (2602.17401v1)

Abstract: For a permutation matrix $P$, let $s_P$ denote its Stanley-Wilf limit, the exponential growth rate of the number of $n\times n$ permutation matrices avoiding $P$. Let $c_P$ denote its Füredi-Hajnal limit, which is the limit $\displaystyle \lim_{n \to \infty} \text{ex}(n,P)/n$ where $\text{ex}(n,P)$ is the maximum number of ones in an $n\times n$ $0$-$1$ matrix avoiding $P$. Cibulka proved the universal quadratic bound $s_P\leq 2.88\,c_P2$. In this note we improve the constants in Cibulka's result through a so-called ``block contraction" argument. Defining [ F(c)=\inf_{t\in\mathbb{N}} \frac{(t!){1/t}\,15{\,c/t}}{c}, ] for $c>0$, this leads us to the revised inequality $s_P\leq F(c_P)\,c_P2$. In particular, $F(c)=\log 15+o(1) \approx 2.70805\ldots +o(1)$ as $c\to\infty$, and the constant improves $2.88$ once $c_P \geq 17$.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.