Related papers: Frobenius lifts and point counting for smooth curv…
We describe and analyze a numerical algorithm for computing the homology (Betti numbers and torsion coefficients) of semialgebraic sets given by Boolean formulas. The algorithm works in weak exponential time. This means that outside a…
In this manuscript, we give effective methods for computing the zeta function of maximal orders on surfaces.
The Witt group of a smooth curve over a real closed field is explicitely calculated. The method uses a comparison theorem between the graded Witt group and the etale cohomology groups. In the second part of the paper, the torsion Picard…
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$,…
In this paper we derive an explicit expression for the normal zeta function of class two nilpotent groups whose associated Pfaffian hypersurface is smooth. In particular, we show how the local zeta function depends on counting mod p…
We present an algorithm for the computation of the topological type of a real compact Riemann surface associated to an algebraic curve, i.e., its genus and the properties of the set of fixed points of the anti-holomorphic involution $\tau$,…
For a genus $2$ curve $C$ over $\mathbb{Q}$ whose Jacobian $A$ admits only trivial geometric endomorphisms, Serre's open image theorem for abelian surfaces asserts that there are only finitely many primes $\ell$ for which the Galois action…
We derive formulas for the number of points on the basic stratum of certain Kottwitz varieties in terms of automorphic representations and certain explicit polynomials, for which we present efficient algorithms for computation. We obtain…
Let $Q(x)$ be a quadratic form over $\mathbb{R}^n$. The Epstein zeta function associated to $Q(x)$ is a well known function in number theory. We generalize the construction of the Epstein zeta function to a class of function $\phi(x)$…
Using the sieve for Frobenius, we show that, in a certain sense, the roots of the L-functions of "most" algebraic curves over finite fields do not satisfy any non-trivial (linear or multiplicative) rational dependency relations. This can be…
Seminal works by Birch and Ihara gave formulas for the $m$th power moments of the traces of Frobenius endomorphisms of elliptic curves over $\mathbb{F}_{p}$ for primes $p \geq 5$. Recent works by Kaplan and Petrow generalized these results…
In this paper, we present formulas for the edge zeta function and the second weighted zeta function with respect to the group matrix of a finite abelian group $\Gamma $. Furthermore, we give another proof of Dedekind Theorem for the group…
We use partial zeta functions to analyse the asymptotic behaviour of certain smooth arithmetical sums over smooth k-free integers.
Topological data analysis (TDA) has become an attractive area for the application of quantum computing. Recent advances have uncovered many interesting connections between the two fields. On one hand, complexity theoretic results show that…
Finite-sum optimization has wide applications in machine learning, covering important problems such as support vector machines, regression, etc. In this paper, we initiate the study of solving finite-sum optimization problems by quantum…
We propose a method for calculating cohomology operations for finite simplicial complexes. Of course, there exist well--known methods for computing (co)homology groups, for example, the reduction algorithm consisting in reducing the…
This paper proposes a new, visual method to study numerical semigroups and the Frobenius problem. The method is based on building a so-called reduction graph, whose nodes usually correspond to monogenic semigroups, and whose edges can have…
The Integral Image algorithm is often applied in tasks that require efficient integration over images, such as object detection. In this paper we discuss theoretical aspects of the algorithm's continuous version. We suggest to define the…
We provide an algorithm for computing an effective basis of homology of elliptic surfaces over the complex projective line on which integration of periods can be carried out. This allows the heuristic recovery of several algebraic…
We present a general diagrammatic approach to the construction of efficient algorithms for computing a Fourier transform on a semisimple algebra. This extends previous work wherein we derive best estimates for the computation of a Fourier…