Related papers: A point counting algorithm using cohomology with c…

The enumeration of points on (or off) the union of some linear or affine subspaces over a finite field is dealt with in combinatorics via the characteristic polynomial and in algebraic geometry via the zeta function. We discuss the basic…

In this article, we present a method for computing rational points on hyperelliptic curves of genus~3 and isolated quadratic points on hyperelliptic curves of genus~2 and~3 whose Jacobians have rank~0. Our approach begins by computing the…

Let k be a finite field of odd characteristic. We find a closed formula for the number of k-isomorphism classes of pointed, and non-pointed, hyperelliptic curves of genus g over k, admitting a Koblitz model. These numbers are expressed as a…

We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(n D kappa(f)) iterations where n is the number of polynomials (as well as the dimension of the ambient space), D…

We compute the rational points on certain members of the following family of hyperelliptic curves \[C_a \colon y^2 = x^8 + (4-4a^4) x^6 + (8a^4 + 6)x^4 + (4-4a^4)x^2 + 1\] via the method first developed by Dem'yanenko \cite{dem1966rational}…

We present experimental evidence to support the widely held belief that one half of all elliptic curves have infinitely many rational points. The method used to gather this evidence is a refinement of an algorithm due to the author which is…

We consider the moduli space $\Hh_{g,n}$ of $n$-pointed smooth hyperelliptic curves of genus $g$. In order to get cohomological information we wish to make $\s_n$-equivariant counts of the numbers of points defined over finite fields of…

Consider the smooth projective models C of curves y^2=f(x) with f(x) in Z[x] monic and separable of degree 2g+1. We prove that for g >= 3, a positive fraction of these have only one rational point, the point at infinity. We prove a lower…

The circular coordinates algorithm, a key tool in topological data analysis, relies on a theoretically unvalidated lifting step to convert cocycles from a prime field to integer coefficients. We provide a rigorous analysis of this…

In their homonymous article, Sam Payne and Thomas Willwacher construct a combinatorial graph complex to compute the weight 11 part of the compactly supported cohomology of the moduli space of curves $\cM_{g,n}$ and compute explicitly the…

We give a new method for calculating the cohomology of the normal bundles over rational varieties which are smooth projections of Veronese embeddings. The method can be used also when the projections are not smooth, in this case it provides…

We give a recursive algorithm for computing the character of the cohomology of the moduli space $\Mmb_{0,n}$ of stable $n$-pointed genus zero curves as a representation of the symmetric group $\Sg_n$ on $n$ letters. Using the algorithm we…

We calculate the rational cohomology of the classifying space of the diffeomorphism group of the manifolds $U_{g,1}^n:= \#^g(S^n \times S^{n+1})\setminus \mathrm{int}{D^{2n+1}}$, for large $g$ and $n$, up to approximately degree $n$. The…

This paper presents algorithmic approaches to study superspecial hyperelliptic curves. The algorithms proposed in this paper are: an algorithm to enumerate superspecial hyperelliptic curves of genus $g$ over finite fields $\mathbb{F}_q$,…

A new algorithm for computing a point on a polynomial or rational curve in B\'{e}zier form is proposed. The method has a geometric interpretation and uses only convex combinations of control points. The new algorithm's computational…

Fix a finite group $G$. We study the computational complexity of counting problems of the following flavor: given a group $\Gamma$, count the number of homomorphisms $\Gamma \to G$. Our first result establishes that this problem is…

Abstract notions of convexity over the vertices of a graph, and corresponding notions of halfspaces, have recently gained attention from the machine learning community. In this work we study monophonic halfspaces, a notion of graph…

We study a variety of questions centered around the computation of cohomology of line bundles on the incidence correspondence (the partial flag variety parametrizing pairs consisting of a point in projective space and a hyperplane…

We develop a probabilistic algorithm of Kronecker type for computing a Kronecker representation of a zero-dimensional linear section of an algebraic variety $V$ defined over a perfect field $k$. The variety $V$ is the Zariski closure of the…

The Hilbert scheme X^{[a]} of points on a complex manifold X is a compactification of the configuration space of a-element subsets of X. The integral cohomology of X^{[a]} is more subtle than the rational cohomology. In this paper, we…