Related papers: Encoding points on hyperelliptic curves over finit…

Let $K$ be a field, $a, b\in K$ and $ab\neq 0$. Let us consider the polynomials $g_{1}(x)=x^n+ax+b, g_{2}(x)=x^n+ax^2+bx$, where $n$ is a fixed positive integer. In this paper we show that for each $k\geq 2$ the hypersurface given by the…

We describe the automorphism groups of finite $p$-groups arising naturally via Hessian determinantal representations of elliptic curves defined over number fields. Moreover, we derive explicit formulas for the orders of these automorphism…

The complexity of the elliptic curve method of factorization (ECM) is proven under the celebrated conjecture of existence of smooth numbers in short intervals. In this work we tackle a different version of ECM which is actually much more…

We construct two new families of basis for finite field extensions. Basis in the first family, the so-called elliptic basis, are not quite normal basis, but they allow very fast Frobenius exponentiation while preserving sparse…

We present a deterministic distributed algorithm, in the LOCAL model, that computes a $(1+o(1))\Delta$-edge-coloring in polylogarithmic-time, so long as the maximum degree $\Delta=\tilde{\Omega}(\log n)$. For smaller $\Delta$, we give a…

We construct families of smooth, proper, algebraic curves in characteristic 0, of arbitrary genus g, together with g elements in the kernel of the tame symbol. We show that those elements are in general independent by a limit calculation of…

Conics and Cartesian ovals are very important curves in various fields of science. Also aspheric curves based on conics are useful in optics. Superconic curves recently suggested by A. Greynolds are extensions of both conics and Cartesian…

We give a new deterministic algorithm that non-adaptively learns a hidden hypergraph from edge-detecting queries. All previous non-adaptive algorithms either run in exponential time or have non-optimal query complexity. We give the first…

We give a completely explicit upper bound for integral points on (standard) affine models of hyperelliptic curves, provided we know at least one rational point and a Mordell-Weil basis of the Jacobian. We also explain a powerful refinement…

We give the complete list of possible torsion subgroups of elliptic curves with complex multiplication over number fields of degree 1-13. Additionally we describe the algorithm used to compute these torsion subgroups and its implementation.

For any number field K with a complex place, we present an infinite family of elliptic curves defined over K such that $dim \mathbb{F}_2 Sel_2(E^F/K) \ge dim \mathbb{F}_2 E^F(K)[2] + r_2$ for every quadratic twist E^F of every curve E in…

We prove formulas for power moments for point counts of elliptic curves over a finite field $k$ such that the groups of $k$-points of the curves contain a chosen subgroup. These formulas express the moments in terms of traces of Hecke…

We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the…

Abstractly, tropical hyperelliptic curves are metric graphs that admit a two-to-one harmonic morphism to a tree. They also appear as embedded tropical curves in the plane arising from triangulations of polygons with all interior lattice…

We give an infinite family of congruent number elliptic curves, each with rank at least two, which are related to integral solutions of $m^2=n^2+nl+l^2$.

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…

Given a pair of translation surfaces it is very difficult to determine whether they are supported on the same algebraic curve. In fact, there are very few examples of such pairs. In this note we present infinitely many examples of finite…

The P versus NP problem asks whether every language verifiable in polynomial time can also be decided in deterministic polynomial time. In this paper, we present a constructive proof that P = NP by introducing a universal, graph-based…

Let $q$ be an odd prime power, and $H_{d,q}$ denote the set of square-free monic polynomials $D(x) \in F_q[x]$ of degree $d$. Katz and Sarnak showed that the moments, over $H_{d,q}$, of the zeta functions associated to the curves…

For a given point P in the group of K-rational points E(K) of an elliptic curve, we consider the sequence of values (F_1(P),F_2(P),F_3(P),...) of the division polynomials of E at P. If K is a finite field, we prove that the sequence is…