1 citations · 2 across the 2 of their papers we have counts for
3 papers
math.AG2008★ 1 cited
About the choice of a basis in Kedlaya's algorithm
Theo van den Bogaart
Kedlaya's algorithm (Kedlaya, J. Ramanujan Math. Soc 16, 2001) can be used to count the points of arbitrary hyperelliptic curves over finite fields of characteristic p, where p is…
math.AG2008★ 1 cited
The de Rham comparison theorem for Deligne-Mumford stacks
Theo van den Bogaart
The de Rham comparison theorem for varieties, first proved by Faltings, gives the de Rham cohomology of a variety in terms of its p-adic etale cohomology. We extend this theorem to…
math.AG2005
Algebraic stacks whose number of points over finite fields is a polynomial
Theo van den Bogaart, Bas Edixhoven
The aim of this article is to investigate the cohomology (l-adic as well as Betti) of schemes, and more generally of certain algebraic stacks, that are proper and smooth over the i…