ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let XX be a set of labels, and let LT(X)\mathcal{LT}(X) denote the set of labelled tree patterns on XX. For a pattern PP, write LTn,no-P(X)\mathcal{LT}_{n,\mathrm{no}\text{-}P}(X) for the labelled trees of size nn avoiding PP, and LTn(X)\mathcal{LT}_n(X) for all labelled trees of size nn.

Growth-rate asymptotic conjecture. For every set of labels XX, there exists an integer dd such that, for every pattern P∈LT(X)P\in\mathcal{LT}(X) with at least dd internal vertices, there are numbers c(P)>0c(P)>0 and λ(P)>1\lambda(P)>1 satisfying

∣LTn,no-P(X)∣∣LTn(X)∣∼c(P)λ(P)−n.\frac{|\mathcal{LT}_{n,\mathrm{no}\text{-}P}(X)|}{|\mathcal{LT}_n(X)|}\sim c(P)\lambda(P)^{-n}.

This conjecture generalises Warlimont's conjecture for consecutive patterns to tree patterns. It predicts a precise exponential asymptotic for the proportion of trees avoiding every sufficiently large pattern, extending the paper's earlier positive-growth results.

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.