The paper proves the Pons-Batle conjecture for bounded reticulation number k via explicit bijections to Young tableaux with walls and holes, derives closed-form recurrences, and shows Beta(2,1), Beta(1,2), and Uniform limit laws for k=1 structural parameters.
European Journal of Combinatorics , volume=
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Spinal tree-child networks are enumerated via restricted words with fixed multiplicities modulo relabeling for closed formulas and via bivariate generating functions from recursive marked-tree specifications.
citing papers explorer
-
A Combinatorial Framework for the Pons-Batle Identity: Young Tableaux, Lattice Paths, and Limit Laws
The paper proves the Pons-Batle conjecture for bounded reticulation number k via explicit bijections to Young tableaux with walls and holes, derives closed-form recurrences, and shows Beta(2,1), Beta(1,2), and Uniform limit laws for k=1 structural parameters.
-
Counting Spinal Tree-Child Networks via Word Encodings and Generating Functions
Spinal tree-child networks are enumerated via restricted words with fixed multiplicities modulo relabeling for closed formulas and via bivariate generating functions from recursive marked-tree specifications.