共查询到20条相似文献,搜索用时 15 毫秒
1.
2.
We prove the following result which was conjectured by Stichtenoth and Xing: letg be the genus of a projective, irreducible non-singular algebraic curve over the finite field
and whose number of
-rational points attains the Hasse-Weil bound; then either 4g≤(q−1)2 or 2g=(q−1)q.
Supported by a grant from the International Atomic Energy and UNESCOCorrespondence to: F. Torres
This article was processed by the author using theLatex style file from Springer-Verlag. 相似文献
3.
4.
J. Wolfmann 《代数通讯》2013,41(8):2055-2060
5.
Let U be a bounded open subset of ?d, d ≥ 2 and f ∈ C(?U). The Dirichlet solution fCU of the Dirichlet problem associated with the Laplace equation with a boundary condition f is not continuous on the closure ū of U in general if U is not regular but it is always Baire-one.Let H(U) be the space of all functions continuous on the closure ū and harmonic on U and F(H(U)) be the space of uniformly bounded absolutely convergent series of functions in H(U). We prove that fCU can be obtained as a uniform limit of a sequence of functions in F(H(U)). Thus fCU belongs to the subclass B1/2 of Baire-one functions studied for example in [8]. This is not only an improvement of the result obtained in [10] but it also shows that the Dirichlet solution on the closure ū can share better properties than to be only a Baire-one function. Moreover, our proof is more elementary than that in [10].A generalization to the abstract context of simplicial function space on a metrizable compact space is provided.We conclude the paper with a brief discussion on the solvability of the abstract Dirichlet problem with a boundary condition belonging to the space of differences of bounded semicontinuous functions complementing the results obtained in [17]. 相似文献
6.
7.
In this note, we study the fluctuations in the number of points on smooth projective plane curves over a finite field Fq as q is fixed and the genus varies. More precisely, we show that these fluctuations are predicted by a natural probabilistic model, in which the points of the projective plane impose independent conditions on the curve. The main tool we use is a geometric sieving process introduced by Poonen (2004) [8]. 相似文献
8.
Let l be a prime number and let be a finite field of characteristic with elements. Let . We determine the number N of solutions in k of the Kummer equation in terms of the trace of a certain Jacobi sum. 相似文献
9.
10.
《Comptes Rendus de l'Academie des Sciences Series IIA Earth and Planetary Science》1999,328(12):1181-1185
Currently, the best known bounds on the number of rational points on an absolutely irreducible, smooth, projective algebraic curve of genus g, defined over a finite field %plane1D;53D;q, generally come either from Serre's refinement of the Weil bound if the genus is small compared to q, or from the optimization of the explicit formulae if the genus is large. We give methods for improving these bounds in both cases. Examples of improvements on the bounds include lowering them for a wide range of small genus when q = 8, 32, 213, 27, 243, 125, and when q = 2s, s > 1. For large genera, isolated improvements are obtained for q = 3, 8, 9. 相似文献
11.
In this paper we study the number of rational points on some curves over finite fields. Moreover, zeta functions of the associated function fields are evaluated explicitly. 相似文献
12.
Let $\mathbb{F}_{q}$ be a finite field, and let b and N be integers. We prove explicit estimates for the probability that the number of rational points on a randomly chosen elliptic curve E over $\mathbb{F}_{q}$ equals b modulo N. The underlying tool is an equidistribution result on the action of Frobenius on the N-torsion subgroup of E. Our results subsume and extend previous work by Achter and Gekeler. 相似文献
13.
14.
For odd primes p and l such that the order of p modulo l is even, we determine explicitly the Jacobsthal sums l(v), ψl(v), and ψ2l(v), and the Jacobsthal–Whiteman sums and , over finite fields Fq such that . These results are obtained only in terms of q and l. We apply these results pertaining to the Jacobsthal sums, to determine, for each integer n1, the exact number of Fqn-rational points on the projective hyperelliptic curves aY2Ze−2=bXe+cZe (abc≠0) (for e=l,2l), and aY2Zl−1=X(bXl+cZl) (abc≠0), defined over such finite fields Fq. As a consequence, we obtain the exact form of the ζ-functions for these three classes of curves defined over Fq, as rational functions in the variable t, for all distinct cases that arise for the coefficients a,b,c. Further, we determine the exact cases for the coefficients a,b,c, for each class of curves, for which the corresponding non-singular models are maximal (or minimal) over Fq. 相似文献
15.
16.
17.
Kit-Ho Mak 《Monatshefte für Mathematik》2014,174(4):577-586
Let \(p\) be a prime. We study the distribution of points on a class of curves \(C\) over \(\mathbb{F }_p\) inside very small rectangles \(\mathcal{B }\) for which the Weil bound fails to give nontrivial information. In particular, we show that the distribution of points on \(C\) over long rectangles is Gaussian. 相似文献
18.
19.
We obtain analogues of several recent bounds on the number of solutions of polynomial congruences modulo a prime with variables in short intervals in the case of polynomial equations in high degree extensions of finite fields. In these settings low-dimensional affine spaces play the role of short intervals and thus several new ideas are required. 相似文献
20.
In this paper, we describe an algorithm for computing the order of the Jacobian varieties of Picard curves over finite fields. This is an extension of the algorithm of Matsuo, Chao and Tsujii (MCT) [K. Matsuo, J. Chao, S. Tsujii, An improved baby step algorithm for point counting of hyperelliptic curves over finite fields, in: LNCS vol. 2369, Springer-Verlag, 2005, pp. 461–474] for hyperelliptic curves. We study the characteristic polynomials and the Jacobian varieties of algebraic curves of genus three over finite fields. Based on this, we investigate the explicit computable bounds for coefficients of the characteristic polynomial and improve a part of the baby-step giant-step of the counting points algorithm. Usefulness of the proposed method is illustrated and verified by the simple examples. 相似文献