标题： 计算双有理映射次数增长的快速算法方法 显示英文标题

标题： A fast algorithmic way to calculate the degree growth of birational mappings

摘要： 我们提出一种算法方法，用于计算有理映射的迭代次数，该方法基于Halburd用于从映射的奇点结构中获得次数的方法。 该方法仅使用整数算术，包括加法，某些情况下还包括乘以小整数的乘法。 因此，它非常快速。 给出了可积和不可积映射的几个例子。 在后一种情况下，我们方法得到的动态次数总是与之前已知方法计算的结果一致。 显示英文摘要

摘要： We present an algorithmic method for the calculation of the degrees of the iterates of birational mappings, based on Halburd's method for obtaining the degrees from the singularity structure of the mapping. The method uses only integer arithmetic with additions and, in some cases, multiplications by small integers. It is therefore extremely fast. Several examples of integrable and non-integrable mappings are presented. In the latter case the dynamical degree we obtain from our method is always in agreement with that calculated by previously known methods.