相关论文: Relating decision and search algorithms for ration…
Based on computational evidence, we formulate a number of conjectures on the distribution of rational points on curves of genus 2 over the rational numbers, in terms of the size of the coefficients of an equation of the form y^2 = f(x) >.
We consider all genus 2 curves over Q given by an equation y^2 = f(x) with f a squarefree polynomial of degree 5 or 6, with integral coefficients of absolute value at most 3. For each of these roughly 200000 isomorphism classes of curves,…
Two curves are affinely equivalent if there exists an affine mapping transforming one of them onto the other. Thus, detecting affine equivalence comprises, as important particular cases, similarity, congruence and symmetry detection. In…
We determine the maximum number of rational points on a curve over $\mathbb{F}_2$ with fixed gonality and small genus.
A novel and deterministic algorithm is presented to detect whether two given rational plane curves are related by means of a similarity, which is a central question in Pattern Recognition. As a by-product it finds all such similarities, and…
We describe a method that allows, under some hypotheses, to compute all the rational points of some genus 5 curves defined over a number field. This method is used to solve some arithmetic problems that remained open.
We use class field theory to search for curves with many rational points over small finite fields. By going through abelian covers of curves of small genus we find a number of new curves. In particular, we settle the question of how many…
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…
Using class field theory one associates to each curve C over a finite field, and each subgroup G of its divisor class group, unramified abelian covers of C whose genus is determined by the index of G. By listing class groups of curves of…
A method is presented for computing all the affine equivalences between two rational ruled surfaces defined by rational parametrizations that works directly in parametric rational form, i.e. without computing or making use of the implicit…
We present an algorithm for computing curves and families of curves of prescribed degree and geometric genus on real rational surfaces.
It is well known that an irreducible algebraic curve is rational (i.e. parametric) if and only if its genus is zero. In this paper, given a tolerance $\epsilon>0$ and an $\epsilon$-irreducible algebraic affine plane curve $\mathcal C$ of…
We describe an algorithm that determines a set of unramified covers of a given hyperelliptic curve, with the property that any rational point will lift to one of the covers. In particular, if the algorithm returns an empty set, then the…
We design and analyze an algorithm for computing solutions with coefficients in a finite field $\mathbb{F}_q$ of underdetermined systems defined over $\mathbb{F}_q$. The algorithm is based on reductions to zero-dimensional searches. The…
Plotting solution sets for particular equations may be complicated by the existence of turning points. Here we describe an algorithm which not only overcomes such problematic points, but does so in the most general of settings. Applications…
We design and analyze an algorithm for computing rational points of hypersurfaces defined over a finite field based on searches on "vertical strips", namely searches on parallel lines in a given direction. Our results show that, on average,…
This short article concerns a method to obtain effectivity for the search of integral points on certain (sets of) curves of genus 2. More precisely, we wish to illustrate just an example of application of a criterion of Bilu, to derive…
In this article we prove the explicit Mordell Conjecture for large families of curves. In addition, we introduce a method, of easy application, to compute all rational points on curves of quite general shape and increasing genus. The method…
We construct curves of each genus $g\geq 2$ for which Coleman's effective Chabauty bound is sharp and Coleman's theorem can be applied to determine rational points if the rank condition is satisfied. We give numerous examples of genus two…
Given a planar curve defined by means of a real rational parametrization, we prove that the affine values of the parameter generating the real singularities of the offset are real roots of a univariate polynomial that can be derived from…