Super Catalan number recurrence from generalized action graph path counts
Let be the action graph associated with , and let be the number of paths of length in that start at a vertex labeled and end at a vertex labeled . Super Catalan computation conjecture. The subsequent super Catalan number can be computed from the -table of its previous action graph via
If the path-count recurrence conjecture holds, the authors believe this formula computes from the -table and establishes that satisfies Axiom1. The formula is presented as part of an approach whose general validity remains open.
References
- 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.