LIPIcs.AofA.2024.19.pdf
- Filesize: 0.72 MB
- 15 pages
Making use of a newly developed package in the computer algebra system SageMath, we show how to perform a full asymptotic analysis by means of the Mellin transform with explicit error bounds. As an application of the method, we answer a question of Bóna and DeJonge on 132-avoiding permutations with a unique longest increasing subsequence that can be translated into an inequality for a certain binomial sum.
Feedback for Dagstuhl Publishing