Binomial sums and Mellin asymptotics with explicit error bounds: a case study
<|reference_start|>Binomial sums and Mellin asymptotics with explicit error bounds: a case study: 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\'ona and DeJonge on 132-avoiding permutations with a unique longest increasing subsequence that can be translated into an inequality for a certain binomial sum.<|reference_end|>
@article{hackl2024binomial,
    title={Binomial sums and Mellin asymptotics with explicit error bounds: a case
  study},
    author={Benjamin Hackl, Stephan Wagner},
    journal={arXiv preprint arXiv:2403.09408},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.09408},
    primaryClass={math.CO cs.DM cs.MS}
}