ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let m>1m>1, and let Cn(m)C_n^{(m)} denote the generalized Catalan numbers considered in the paper. Define

Km={e3/2if m=2,2(22)(42)⋯(m−12)/m(2m−3)/2if m≥3 and is odd,2(32)(52)⋯(m−12)/m(2m−3)/2if m≥4 and is even.K_m=\begin{cases} e^{3/2}&\text{if }m=2,\\ 2\binom{2}{2}\binom{4}{2}\dotsb\binom{m-1}{2}/m^{(2m-3)/2}&\text{if }m\geq 3\text{ and is odd},\\ \sqrt{2}\binom{3}{2}\binom{5}{2}\dotsb\binom{m-1}{2}/m^{(2m-3)/2}&\text{if }m\geq 4\text{ and is even.} \end{cases}

Generalized Catalan asymptotic conjecture. As n→∞n\rightarrow\infty,

Cn(m)∼Km⋅(mm−1(m−1)!)n+1(n!)m−1(πn)(m−1)/2.C_n^{(m)}\sim K_m\cdot\frac{\bigl(\frac{m^{m-1}}{(m-1)!}\bigr)^{n+1}(n!)^{m-1}}{(\pi n)^{(m-1)/2}}.

This conjecture proposes precise factorial-exponential asymptotics for the generalized Catalan numbers associated with hypergraphs, including an explicitly specified constant in each parity case. The case m=2m=2 is supported by high-precision numerical experiments, while the general formula is presented as a conjecture based on asymptotic data.

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.