Related papers: Optimal curves of low genus over finite fields
For a given curve X and divisor class C, we give lower bounds on the degree of a divisor A such that A and A-C belong to specified semigroups of divisors. For suitable choices of the semigroups we obtain (1) lower bounds for the size of a…
Let K be the function field of a connected regular scheme S of dimension 1, and let f : X -> Y be a finite cover of projective smooth and geometrically connected curves over K with g(X) greater or equal to 2. Suppose that f can be extended…
The best bounds of the form $B(\alpha,\beta,\gamma,x)=(\alpha+\sqrt{\beta^2+\gamma^2 x^2})/x$ for ratios of modified Bessel functions are characterized: if $\alpha$, $\beta$ and $\gamma$ are chosen in such a way that…
We construct new covers of the Suzuki and Ree curves which are maximal with respect to the Hasse-Weil bound over suitable finite fields. These covers are analogues of the Giulietti-Korchm\'aros curve, which covers the Hermitian curve and is…
We establish an effective version of Siegel's lower bounds for class numbers of imaginary quadratic fields in certain cures in $Y(1)^n$. Our proof goes through the G-functions method of Yves Andr\'e.
Building upon previous works by Conlon-Ferber and Wigderson, Sawin showed a few years ago that upper bounds on the minimum density of independent sets in a $K_t$-free $G$ can be used to provide lower bounds for multicolor Ramsey numbers. In…
We discuss methods for using the Weil polynomial of an isogeny class of abelian varieties over a finite field to determine properties of the curves (if any) whose Jacobians lie in the isogeny class. Some methods are strong enough to show…
We give upper bounds on the genus of a curve with general moduli assuming that it can be embedded in a projective nonsingular surface $Y$ so that $\dim(|C|) > 0$. We find such bounds for all types of surfaces of intermediate Kodaira…
A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices and exactly $4n-8$ edges, have been completely characterized,…
We give bounds on the number of non-simple closed curves on a negatively curved surface, given upper bounds on both length and self-intersection number. In particular, it was previously known that the number of all closed curves of length…
Ekedahl showed that the genus of a curve in characteristic $p>0$ with zero Cartier operator is bounded by $p(p-1)/2$. We show the bound $p+p(p-1)/2$ in case the rank of the Cartier operator is 1, improving a result of Re.
A uniform bound of intersection multiplicities of curves and divisors on abelian varieties is proved by algebraic geometric methods. It extends and improves a result obtained by A. Buium with a different method based on Kolchin's…
In this paper we study the reduction of Galois covers of curves, from characteristic 0 to characteristic p. The starting point is a is a recent result of Raynaud which gives a criterion for good reduction for covers of the projective line…
We show that the geometric classification of smooth projective curves admitting infinitely many points of degree $d\leq 5$ extends from number fields to function fields of characteristic 0. Over number fields, this classification was…
The genus g of an F_{q^2}-maximal curve satisfies g=g_1:=q(q-1)/2 or g\le g_2:= [(q-1)^2/4]. Previously, such curves with g=g_1 or g=g_2, q odd, have been characterized up to isomorphism. Here it is shown that an F_{q^2}-maximal curve with…
We introduce a new construction of towers of algebraic curves over finite fields and provide a simple example of an optimal tower.
We push further the classical proof of Weil upper bound for the number of rational points of an absolutely irreducible smooth projective curve $X$ over a finite field in term of euclidean relationships between the Neron Severi classes in…
Let $G$ be a graph and $v$ any vertex of $G$. We define the degenerate degree of $v$, denoted by $\zeta(v)$ as $\zeta(v)={\max}_{H: v\in H}~\delta(H)$, where the maximum is taken over all subgraphs of $G$ containing the vertex $v$. We show…
In this paper, we use a new method to decrease the parameterized complexity bound for finding the minimum vertex cover of connected max-degree-3 undirected graphs. The key operation of this method is reduction of the size of a particular…
We reduce the classification of finite extensions of function fields (of curves over finite fields) with the same class number to a finite computation; complete this computation in all cases except when both curves have base field…