@inproceedings{f2fbdd53ca644bceb6d51a96d55cbce2,
title = "Binomial Sums and Mellin Asymptotics with Explicit Error Bounds: A Case Study",
abstract = "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{\'o}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.",
keywords = "asymptotics, B-terms, binomial sum, explicit error bounds, Mellin transform",
author = "Benjamin Hackl and Stephan Wagner",
note = "Publisher Copyright: {\textcopyright} Benjamin Hackl and Stephan Wagner.; 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms : A of A 2024, A of A 2024 ; Conference date: 17-06-2024 Through 21-06-2024",
year = "2024",
month = jul,
doi = "10.4230/LIPIcs.AofA.2024.19",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik",
editor = "Cecile Mailler and Sebastian Wild",
booktitle = "35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, A of A 2024",
address = "Germany",
}