Change of basis for m-primary ideals in one and two variables

DOI10.1145/3326229.3326268MaRDI QIDQ5121111zbMATH OpenOpenAlexWikidataFDO

Authors Seung Gyu Hyun, Stephen Melczer, Éric Schost, Catherine st-Pierre

Publication date 10 September 2020

Published in Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1905.04614

zbMATH Keywords

algorithmscomplexitypolynomials

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Abstract: Following recent work by van der Hoeven and Lecerf (ISSAC 2017), we discuss the complexity of linear mappings, called untangling and tangling by those authors, that arise in the context of computations with univariate polynomials. We give a slightly faster tangling algorithm and discuss new applications of these techniques. We show how to extend these ideas to bivariate settings, and use them to give bounds on the arithmetic complexity of certain algebras.

Recommendations

• Ideal basis and primary decompositions: case of two variables
• The virtues of laziness: Complexity of the tangent cone algorithm
• scientific article; zbMATH DE number 2151177
• Multivariate power series multiplication
• scientific article; zbMATH DE number 16653

Cited in

(5)

• p-adic algorithm for bivariate Gröbner bases
• Chinese Remainder Theorem for bivariate lexicographic Gröbner bases
• Bivariate polynomial reduction and elimination ideal over finite fields
• An \(\mathfrak{m}\)-adic algorithm for bivariate Gröbner bases
• Elimination ideal and bivariate resultant over finite fields

This page was built for publication: Change of basis for \(\mathfrak{m}\)-primary ideals in one and two variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5121111)