← All problems

Super Catalan number recurrence from generalized action graph path counts

1 year old · traced to

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.

References
  1. Drew Caldwell, Ali Cochran, Nathan Glisson, Bryce Jennings, Katy McDicken, Luke Proctor, Sarah Klanderman and Amelia Tebbe, “Catalan number sequences and generalized action graphs”, arXiv:2507.22719 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.