Algorithmic local monomialization of a binomial: a comparison of different approaches

Research output: Contribution to journal › Article › Research › peer review

Authors

  • Sabrina Alexandra Gaube
  • Bernd Schober

Research Organisations

View graph of relations

Details

Original languageEnglish
Pages (from-to)161-195
JournalInternational Journal of Algebra and Computation
Volume33
Issue number1
Publication statusPublished - 9 Dec 2022

Abstract

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.

Keywords

    math.AG, math.AC, 13F65, 14B05, 14J17, 13P99

Cite this

Algorithmic local monomialization of a binomial: a comparison of different approaches. / Gaube, Sabrina Alexandra; Schober, Bernd.
In: International Journal of Algebra and Computation, Vol. 33, No. 1, 09.12.2022, p. 161-195.

Research output: Contribution to journal › Article › Research › peer review

Gaube SA, Schober B. Algorithmic local monomialization of a binomial: a comparison of different approaches. International Journal of Algebra and Computation. 2022 Dec 9;33(1):161-195. doi: 10.48550/arXiv.2012.14910, 10.1142/S0218196723500108
Gaube, Sabrina Alexandra ; Schober, Bernd. / Algorithmic local monomialization of a binomial : a comparison of different approaches. In: International Journal of Algebra and Computation. 2022 ; Vol. 33, No. 1. pp. 161-195.
Download
@article{c1a29dbc1f68423098d2553e0080bbe7,
title = "Algorithmic local monomialization of a binomial: a comparison of different approaches",
abstract = " 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. ",
keywords = "math.AG, math.AC, 13F65, 14B05, 14J17, 13P99",
author = "Gaube, {Sabrina Alexandra} and Bernd Schober",
year = "2022",
month = dec,
day = "9",
doi = "10.48550/arXiv.2012.14910",
language = "English",
volume = "33",
pages = "161--195",
journal = "International Journal of Algebra and Computation",
issn = "0218-1967",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "1",

}

Download

TY - JOUR

T1 - Algorithmic local monomialization of a binomial

T2 - a comparison of different approaches

AU - Gaube, Sabrina Alexandra

AU - Schober, Bernd

PY - 2022/12/9

Y1 - 2022/12/9

N2 - 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.

AB - 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.

KW - math.AG

KW - math.AC

KW - 13F65, 14B05, 14J17, 13P99

U2 - 10.48550/arXiv.2012.14910

DO - 10.48550/arXiv.2012.14910

M3 - Article

VL - 33

SP - 161

EP - 195

JO - International Journal of Algebra and Computation

JF - International Journal of Algebra and Computation

SN - 0218-1967

IS - 1

ER -