Algorithmic local monomialization of a binomial: A comparison of different approaches
DOI10.1142/S0218196723500108MaRDI QIDQ5877368FDOQ5877368
Authors: Sabrina Alexandra Gaube, Bernd Schober 
Publication date: 10 February 2023
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.14910
Recommendations
- Algorithms for testing monomials in multivariate polynomials
- Exact algorithms via monotone local search
- Exact algorithms via monotone local search
- Complexity of Comparing Monomials and Two Improvements of the Buchberger-Möller Algorithm
- Algorithms in local algebra
- The monomial method: Extensions, variations, and performance issues
- scientific article; zbMATH DE number 1929302
- COMPLEXITY OF VILLAMAYOR'S ALGORITHM IN THE NON-EXCEPTIONAL MONOMIAL CASE
- Algorithm of polynomial complexity for factoring polynomials over local fields
- Decomposition of monomial algebras: applications and algorithms
Singularities in algebraic geometry (14B05) Singularities of surfaces or higher-dimensional varieties (14J17) Computational aspects and applications of commutative rings (13P99) Commutative rings defined by binomial ideals, toric rings, etc. (13F65)
Cites Work
- Wonderful compactification of an arrangement of subvarieties
- A compactification of open varieties
- A strictly decreasing invariant for resolution of singularities in dimension two
- Resolution of singularities of an algebraic variety over a field of characteristic zero. II
- Invariance of Hironaka's characteristic polyhedron
- Embedded desingularization for arithmetic surfaces – toward a parallel implementation
Cited In (1)
Uses Software
This page was built for publication: Algorithmic local monomialization of a binomial: A comparison of different approaches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5877368)
