Change of basis for m-primary ideals in one and two variables
Symbolic Computation
2019-05-14 v1
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.
Keywords
Cite
@article{arxiv.1905.04614,
title = {Change of basis for m-primary ideals in one and two variables},
author = {Seung Gyu Hyun and Stephen Melczer and Éric Schost and Catherine St-Pierre},
journal= {arXiv preprint arXiv:1905.04614},
year = {2019}
}
Comments
In Proceedings ISSAC'19, ACM, New York, USA. See proceedings version for final formatting