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

05/12/2019

∙

by Seung Gyu Hyun, et al.

∙

University of Waterloo

∙

University of Pennsylvania

∙

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.

READ FULL TEXT

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

Subresultants of (x-α)^m and (x-β)^n, Jacobi polynomials and complexity

Fast Computation of the N-th Term of a q-Holonomic Sequence and Applications

A Simple and Fast Algorithm for Computing the N-th Term of a Linearly Recurrent Sequence

Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants

Algorithm for computing μ-bases of univariate polynomials

A Verified Decision Procedure for Univariate Real Arithmetic with the BKR Algorithm

Gaussian width bounds with applications to arithmetic progressions in random settings

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

Related Research

Subresultants of (x-α)^m and (x-β)^n, Jacobi polynomials and complexity

Fast Computation of the N-th Term of a q-Holonomic Sequence and Applications

A Simple and Fast Algorithm for Computing the N-th Term of a Linearly Recurrent Sequence

Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants

Algorithm for computing μ-bases of univariate polynomials

A Verified Decision Procedure for Univariate Real Arithmetic with the BKR Algorithm

Gaussian width bounds with applications to arithmetic progressions in random settings