ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GnG_n be the action graph associated with S(0,n)S(0,n), and let Kℓ,v,nK_{\ell,v,n} be the number of paths of length ℓ\ell in GnG_n that start at a vertex labeled vv and end at a vertex labeled nn. Super Catalan computation conjecture. The subsequent super Catalan number can be computed from the nn-table of its previous action graph via

S(0,n+1)=∑ℓ=0n(22ℓ∑v=0nKℓ,v,n).S(0,n+1) = \displaystyle \sum_{\ell=0}^{n} \left(\frac{2}{2^\ell} \sum_{v=0}^{n} K_{\ell,v,n}\right).

If the path-count recurrence conjecture holds, the authors believe this formula computes S(0,n+1)S(0,n+1) from the nn-table and establishes that GnG_n satisfies Axiom1. The formula is presented as part of an approach whose general validity remains open.

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.