相关论文: How to Construct Curves over Finite Fields With Ma…

We settle the conjecture posed by Sziklai on the number of points of a plane curve over a finite field under the assumption that the curve is nonsingular.

We introduce one dimensional sets to help describe and constrain the integral curves of an $n$ dimensional dynamical system. These curves provide more information about the system than the zero-dimensional sets (fixed points) do. In fact,…

We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on…

We give new examples of plane curves with two or more Galois points as a family, and describe the number of Galois points for these curves, by using finite fields.

We estimate the maximal number of integral points which can be on a convex arc in the plane with given length, minimal radius of curvature and initial slope.

The weight hierarchy of generalized Reed-Muller codes over arbitrary finite fields was determined by Heijnen and Pellikaan. In this paper we produce curves over finite fields with many points which are closely related to this weight…

We propose several techniques to construct complete permutation polynomials of finite fields by virtue of complete permutations of subfields. In some special cases, any complete permutation polynomials over a finite field can be used to…

We give effective upper bounds for the number of purely inseparable points on non isotrivial curves over function fields of positive characteristic and of transcendence degree one. These bounds depend on the genus of the curve, the genus of…

We study arithmetical and geometrical properties of {\it maximal curves}, that is, curves defined over the finite field $\mathbb F_{q^2}$ whose number of $\mathbb F_{q^2}$-rational points reachs the Hasse-Weil upper bound. Under a…

We construct special conics configurations from some points configurations which are the singularities of the dual of a quartic curve.

We obtain explicit formulas for the number of non-isomorphic elliptic curves with a given group structure (considered as an abstract abelian group). Moreover, we give explicit formulas for the number of distinct group structures of all…

A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.

A point on a plane curve is said to be Galois (for the curve) if the projection from the point as a map from the curve to a line induces a Galois extension of function fields. It is known that the number of Galois points is finite except…

We study the problem of lifting curves from finite fields to number fields in a genus and gonality preserving way. More precisely, we sketch how this can be done efficiently for curves of gonality at most four, with an in-depth treatment of…

In this paper, we study the finiteness problem of torsion points on an elliptic curve whose coordinates satisfy some multiplicative dependence relations. In particular, we prove that on an elliptic curve defined over a number field there…

We study the number of rational points of smooth projective curves over finite fields in some relative situations in the spirit of a previous paper from an euclidean point of vue. We prove some kinds of relative Weil bounds, derived from…

Among all the dynamical modular curves associated to quadratic polynomial maps, we determine which curves have infinitely many quadratic points. This yields a classification statement on preperiodic points for quadratic polynomials over…

We consider ruled surfaces with finite multiplicity. We study behaviors of the striction curves and the singularities of the ruled surfaces. We also give geometric meanings of invariants related to the ruled surfaces.

We obtain a coarse relationship between geometric intersection numbers of curves and the sum of their subsurface projection distances with explicit quasi-constants. By using this relationship, we give applications in the studies of the…

Given a point set, mostly a grid in our case, we seek upper and lower bounds on the number of curves that are needed to cover the point set. We say a curve covers a point if the curve passes through the point. We consider such coverings by…