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.

翻译：利用计算机代数系统SageMath中最新开发的软件包，我们展示了如何通过Mellin变换执行具有显式误差界的完整渐近分析。作为该方法的应用，我们回答了Bóna和DeJonge关于具有唯一最长递增子序列的132避免排列问题，该问题可转化为特定二项式求和的不等式。