Super Catalan number recurrence from generalized action graph path counts
Statement
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.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.