64 citations · 346 across the 53 of their papers we have counts for
Showing 2010Show all
3 papers · 1 filter
math.CO2010
The Graph Isomorphism Problem and approximate categories
Harm Derksen
It is unknown whether two graphs can be tested for isomorphism in polynomial time. A classical approach to the Graph Isomorphism Problem is the d-dimensional Weisfeiler-Lehman algo…
math.NT2010★ 13 cited
Linear equations over multiplicative groups, recurrences, and mixing I
Harm Derksen, David Masser
Let K be a field of positive characteristic. When V is a linear variety in K^n and G is a finitely generated subgroup of K^*, we show how to compute the intersection of V and G^n e…
math.AG2010
Unipotent group actions on affine varieties
Harm Derksen, Arno van den Essen, David R. Finston +1
Algebraic actions of unipotent groups actions on affine varieties ( an algebraically closed field of characteristic 0) for which the algebraic quotient has sm…