Related papers: An $L (1/3)$ Discrete Logarithm Algorithm for Low …

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 study the discrete logarithm problem in the finite fields $\F_{q^n}$ where $n|q-1$. The field is called a Kummer field or a Kummer extension of $\F_q$. It plays an important role in improving the AKS primality proving…

We investigate the complexity of computing the Zariski closure of a finitely generated group of matrices. The Zariski closure was previously shown to be computable by Derksen, Jeandel, and Koiran, but the termination argument for their…

In [5], without giving a detailed proof, Yamauchi provided a formula to calculate the genus of a certain family of smooth complete intersection algebraic curves. That formula is used extensively in [1] to study the algebraic curves for…

Kazhdan constants of discrete groups are hard to compute and the actual constants are known only for several classes of groups. By solving a semidefinite programming problem by a computer, we obtain a lower bound of the Kazhdan constant of…

First we solve the problem of finding minimal degree families on toric surfaces by reducing it to lattice geometry. Then we describe how to find minimal degree families on, more generally, rational complex projective surfaces.

We give an upper bound for the degree of rational curves in a family that covers a given birational ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We…

We present three families of pairs of geometrically non-isomorphic curves whose Jacobians are isomorphic to one another as unpolarized abelian varieties. Each family is parametrized by an open subset of P^1. The first family consists of…

We provide a technique to obtain explicit bounds for problems that can be reduced to linear forms in three complex logarithms of algebraic numbers. This technique can produce bounds significantly better than general results on lower bounds…

In this article we apply the classical method of focal loci of families to give a lower bound for the genus of curves lying on general surfaces. First we translate and reprove Xu's result that any curve C on a general surface in P^3 of…

For any finitely generated abelian group $Q$, we reduce the problem of classification of $Q$-graded simple Lie algebras over an algebraically closed field of "good" characteristic to the problem of classification of gradings on simple Lie…

This paper is devoted to constructing an explicit efficient representation for the Jacobian variety of a nonsingular curve of genus greater than 1, and its group law. We describe an algorithm for executing the group law on the Jacobian…

We study the algorithmic complexity of fair division problems with a focus on minimizing the number of queries needed to find an approximate solution with desired accuracy. We show for several classes of fair division problems that under…

We investigate the computational complexity of the discrete logarithm, the computational Diffie-Hellman and the decisional Diffie-Hellman problems in some identity black-box groups G_{p,t}, where p is a prime number and t is a positive…

Let ell be a prime, and H a curve of genus 2 over a field k of characteristic not 2 or ell. If S is a maximal Weil-isotropic subgroup of Jac(H)[ell], then Jac(H)/S is isomorphic to the Jacobian of some (possibly reducible) curve X. We…

As a subproduct of the Schoof-Elkies-Atkin algorithm to count points on elliptic curves defined over finite fields of characteristic p, there exists an algorithm that computes, for l an Elkies prime, l-torsion points in an extension of…

Let $p$ be an odd prime number and be an integer coprime to $p$. We survey an algorithm for computing explicit rational representations of $(\ell,...,\ell)$-isogenies between Jacobians of hyperelliptic curves of arbitrary genus over an…

The purpose of this paper is to study low degree points on plane curves. We prove results analogous to those of Debarre and Klassen for singular plane curves with a finite number $\delta$ of ordinary nodes/cusps, where $\delta$ is bounded…

Low-degree polynomials have emerged as a powerful paradigm for providing evidence of statistical-computational gaps across a variety of high-dimensional statistical models [Wein25]. For detection problems -- where the goal is to test a…

Linear differential algebraic groups (LDAGs) appear as Galois groups of systems of linear differential and difference equations with parameters. These groups measure differential-algebraic dependencies among solutions of the equations.…