Rudiments of algebraic geometry. The number of points in varieties over finite fields

Author(s):  
Wolfgang M. Schmidt
10.37236/386 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
Jesús A. De Loera ◽  
Christopher J. Hillar ◽  
Peter N. Malkin ◽  
Mohamed Omar

Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of the polynomial method and show how the algorithmic theory of polynomial ideals can be used to detect $k$-colorability, unique Hamiltonicity, and automorphism rigidity of graphs. Our techniques are diverse and involve Nullstellensatz certificates, linear algebra over finite fields, Gröbner bases, toric algebra, convex programming, and real algebraic geometry.


2020 ◽  
Vol 16 (06) ◽  
pp. 1355-1368
Author(s):  
Nurdagül Anbar ◽  
Seher Tutdere

There are two types of Belyi’s Theorems for curves defined over finite fields of characteristic [Formula: see text], namely the Wild and the Tame [Formula: see text]-Belyi Theorems. In this paper, we discuss them in the language of function fields. In particular, we provide a constructive proof for the existence of a pseudo-tame element introduced in [Y. Sugiyama and S. Yasuda, Belyi’s theorem in characteristic two, Compos. Math. 156(2) (2020) 325–339], which leads to a self-contained proof for the Tame [Formula: see text]-Belyi Theorem. Moreover, we provide unified and simple proofs for Belyi’s Theorems unlike the known ones that use technical results from Algebraic Geometry.


2021 ◽  
Vol 76 (1) ◽  
pp. 29-89
Author(s):  
S Ballet ◽  
J Pieltant ◽  
M Rambaud ◽  
H Randriambololona ◽  
R Rolland ◽  
...  

Author(s):  
Rudolf Lidl ◽  
Harald Niederreiter
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document