Related papers: Algorithm for motivic Hilbert zeta function of som…
This paper generalizes Bass' work on zeta functions for uniform tree lattices. Using the theory of von Neumann algebras, machinery is developed to define the zeta function of a discrete group of automorphisms of a bounded degree tree. The…
We associate with an infinite cyclic cover of a punctured neighborhood of a simple normal crossing divisor on a complex quasi-projective manifold (assuming certain finiteness conditions are satisfied) a rational function in $K_0({\rm…
We introduce an algorithm to compute the functions belonging to a suitable set ${\mathscr F}$ defined as follows: $f\in {\mathscr F}$ means that $f(s,x)$, $s\in A\subset {\mathbb R}$ being fixed and $x>0$, has a power series expansion…
We present a deterministic algorithm that computes the zeta function of a nonsupersingular elliptic curve E over a finite field with p^n elements in time quasi-quadratic in n. An older algorithm having the same time complexity uses the…
Suppose X is a (smooth projective irreducible algebraic) curve over a finite field k. Counting the number of points on X over all finite field extensions of k will not determine the curve uniquely. Actually, a famous theorem of Tate implies…
In this paper, we show the full flag Hilbert scheme of points of nodal curves has only complete intersection singularities. We study the Hilbert scheme of points of the cusp curve and show the punctual Hilbert scheme is isomorphic to…
The zeta function of a motive over a finite field is multiplicative with respect to the direct sum of motives. It has beautiful analytic properties, as were predicted by the Weil conjectures. There is also a multiplicative zeta function,…
For $n\geq 1$, we construct the Hilbert scheme of $n$ points on any crepant partial resolution of a Kleinian singularity as a Nakajima quiver variety for an explicit GIT stability parameter. This generalises and unifies existing quiver…
We present an efficient algorithm to compute the Euler factor of a genus 2 curve C/Q at an odd prime p that is of bad reduction for C but of good reduction for the Jacobian of C (a prime of ``almost good'' reduction). Our approach is based…
We study Hilbert functions of certain non-reduced schemes A supported at finite sets of points in projective space, in particular, fat point schemes. We give combinatorially defined upper and lower bounds for the Hilbert function of A using…
In this article, we describe the irreducible components of the Hilbert scheme of $d$ points on $\mathbb{A}^n$ for $d=9,10$. The main techniques we use are the variety of commuting matrices and analyzing loci of local algebras with a…
Let $p$ and $l$ be rational primes such that $l$ is odd and the order of $p$ modulo $l$ is even. For such primes $p$ and $l$, and for $e=l, 2l$, we consider the non-singular projective curves $aY^e = bX^e + cZ^e$ ($abc \neq 0$) defined over…
A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…
The Grover algorithm is one of the most famous quantum algorithms. On the other hand, the absolute zeta function can be regarded as a zeta function over $\mathbb{F}_{1}$ defined by a function satisfying the absolute automorphy. In this…
We define motivic analogues of Igusa's local zeta functions. These functions take their values in a Grothendieck group of Chow motives. They specialize to p-adic Igusa local zeta functions and to the topological zeta functions we introduced…
In this article, we study Hilbert Series of non-Cohen-Maculay tangent cones for some 4-generated pseudo symmetric monomial curves. We show that the Hilbert Function is nondecreasing by explicitly computing it. We also compute standard bases…
In this paper we study the Hilbert function of $\gr_{\mathfrak{m}}(R)$, when $R$ is a numerical semigroup ring or, equivalently, the coordinate ring of a monomial curve. In particular, we prove a sufficient condition for a numerical…
We develop a new general method for computing the decomposition type of the normal bundle to a projective rational curve. This method is then used to detect and explain an example of a Hilbert scheme that parametrizes all the rational…
The Hilbert scheme of points $\mathrm{Hilb}^n(S)$ of a smooth surface $S$ is a well-studied parameter space, lying at the interface of algebraic geometry, commutative algebra, representation theory, combinatorics, and mathematical physics.…
We describe the Hilbert schemes parametrizing curves on a cubic threefold of degree at most 5. In a forthcoming paper, we use this description to give a new proof and extension of a theorem of Iliev, Markushevich and Tikhimirov.