activity
20082023
most citedOn generic and maximal k-ranks of binary forms

14 citations · 57 across the 15 of their papers we have counts for

collaborators
Showing 2008Show all

2 papers · 1 filter

math.AC2008★ 5 cited

Complexity of comparing monomials and two improvements of the BM-algorithm

Samuel Lundqvist

We give a new algorithm for merging sorted lists of monomials. Together with a projection technique we obtain a new complexity bound for the BM-algorithm.

math.AC2008★ 1 cited

Vector space bases associated to vanishing ideals of points

Samuel Lundqvist

We discuss four different constructions of vector space bases associated to vanishing ideals of points. We show how to compute normal forms with respect to these bases and give new…