ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For t≥2t\geq 2, let PP be a tt-pattern, and let Tt(n,P)T_t(n,P) denote the set of all tt-dimensional n×⋯×nn\times\cdots\times n 00–11 matrices avoiding PP. Higher-dimensional Stanley–Wilf conjecture. For every tt-pattern PP, there exists a constant c=cPc=c_P such that

∣Tt(n,P)∣≤cnt−1.|T_t(n,P)|\leq c^{n^{t-1}}.

In the source statement, the final display writes ∣T2(n,P)∣|T_2(n,P)|, although the surrounding definition and the proposed higher-dimensional generalization use Tt(n,P)T_t(n,P); the row follows that intended generalization. The conjecture extends the singly exponential bound in dimension two to growth exponential in the number of (t−1)(t-1)-dimensional slices.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.