DeepAI AI Chat
Log In Sign Up

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

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.


page 1

page 2

page 3

page 4


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

In an earlier article together with Carlos D'Andrea [BDKSV2017], we desc...

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

In 1977, Strassen invented a famous baby-step/giant-step algorithm that ...

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

We present a simple and fast algorithm for computing the N-th term of a ...

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

Complexity bounds for many problems on matrices with univariate polynomi...

Algorithm for computing μ-bases of univariate polynomials

We present a new algorithm for computing a μ-basis of the syzygy module ...

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

We formalize the univariate fragment of Ben-Or, Kozen, and Reif's (BKR) ...

Gaussian width bounds with applications to arithmetic progressions in random settings

Motivated by two problems on arithmetic progressions (APs)---concerning ...