A dynamic-programming recurrence over overlapping ballots counts pop-stacked permutations in polynomial time, producing 1000 terms and rigorous bounds on the generating function.
Series analysis
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Counting pop-stacked permutations in polynomial time
A dynamic-programming recurrence over overlapping ballots counts pop-stacked permutations in polynomial time, producing 1000 terms and rigorous bounds on the generating function.