论文标题
二项式的算法局部元素化：不同方法的比较
Algorithmic local monomialization of a binomial: a comparison of different approaches
论文作者
论文摘要
我们通过炸毁适当的中心来研究不同的方法将给定的二项式转化为单一方法。特别是，我们在{\ c singular}中开发了明确的实现，这些实现允许根据众多示例进行比较。我们专注于本地变体，其中不需要全球选择中心。此外，我们不一定要求将中心包含在奇异基因座中。尽管有这些限制，这些技术仍连接到$ p $ - adic积分的计算，其数据由有限的许多二项式提供。
We investigate different approaches to transform a given binomial into a monomial via blowing up appropriate centers. In particular, we develop explicit implementations in {\sc Singular}, which allow to make a comparison on the basis of numerous examples. We focus on a local variant, where centers are not required to be chosen globally. Moreover, we do not necessarily demand that centers are contained in the singular locus. Despite these restrictions, the techniques are connected to the computation of $ p $-adic integral whose data is given by finitely many binomials.
