zbMATH — the first resource for mathematics

Smith normal form of augmented degree matrix and its applications. (English) Zbl 1184.15012
Let \(\mathbb{F}_{q}\) be a finite field of \(q\) elements and \(p\) its characteristic. Let \(f\left( x_{1},x_{2},\dots,x_{n}\right) \) be a nonzero polynomial in \(n\) variables over \(\mathbb{F}_{q}\). For each positive integer \(r\), let \(N_{q}(f)\) denote the number of \(\mathbb{F}_{q^{r}}\)-rational points on the affine hypersurface \(f=0\), i.e.
\[ N_{q}(f)=\#\left\{ \left( x_{1},x_{2},\dots,x_{n}\right) \in \mathbb{A} ^{n}\left( \mathbb{F}_{q^{r}}\right) \left| f\left( x_{1},x_{2},\dots,x_{n}\right) =0\right. \right\} \] The author uses the Smith normal forms of an augmented degree matrix to evaluate the number \(N_{q}(f).\) This work is a generalization of the author’s previous results. As he mentions, one of the benefit of this result is that there are algorithms for finding the Smith normal form of a matrix, and these are programmed into common Computer Algebra packages such as Maple and Mupad. He gives, at the end of the paper an example to compare this result with the results previously obtained.

15A21 Canonical forms, reductions, classification
11T24 Other character sums and Gauss sums
11C20 Matrices, determinants in number theory
15B33 Matrices over special rings (quaternions, finite fields, etc.)
EDIM; GAP; Maple
Full Text: DOI
[1] Berndt, B.; Evans, R.; Williams, K., Gauss and Jacobi sums, (1998), Wiley Interscience New York · Zbl 0906.11001
[2] Cao, W., A short proof to some results of Sun and Wang, Algebra colloq., 14, 177-180, (2007) · Zbl 1127.11029
[3] W. Cao, On generalized Markoff-Hurwitz-type equations over finite fields, in preparation. · Zbl 1218.11038
[4] Cao, W.; Sun, Q., On a class of equations with special degrees over finite fields, Acta arith., 130, 195-202, (2007) · Zbl 1130.11069
[5] Cohen, H., A course in computational algebraic number theory, Gtm 138, (1996), Springer-Verlag
[6] The GAP Group, Groups, Algorithms, and Programming - A System for Computational Discrete Algebra, Ver. 4.4.12, 2008. <http://www.gap-system.org>.
[7] Havas, G.; Sterling, L., Integer matrices and abelian groups, (), 431-451
[8] Koblitz, N., \(p\)-adic numbers, \(p\)-adic analysis and zeta functions, Gtm 58, (1996), Springer-Verlag
[9] Lidl, R.; Niederreiter, H., Finite fields, Encyclopedia of mathematics and its applications, vol. 20, (1983), Addison-Wesley Reading, MA
[10] Lübeck, F., On the computation of elementary divisors of integer matrices, J. symb. comput., 33, 57-65, (2002) · Zbl 1017.65037
[11] F. Lübeck, EDIM-elementary divisors and integer matrices, RWTH Aachen, Lehrstuhl Dfür Mathematik, 2006. <http://www.gap-system.org/Manuals/pkg/edim/xmldoc/chap0.html> (or <http://www.math.rwth-aachen.de/Frank.Luebeck/gap/EDIM>).
[12] Newman, M., Integral matrices, Pure and appl. math. series, vol. 45, (1972), Academic Press New York · Zbl 0254.15009
[13] Smith, J.S., On systems of linear indeterminate equations and congruences, Philos. trans. royal soc. London, 151, 293-326, (1861)
[14] Storjohann, A., Nearly optimal algorithms for computing Smith normal forms of integer matrices, (), 267-274 · Zbl 0914.65043
[15] Storjohann, A., Computing Hermite and Smith normal forms of triangular integer matrices, Linear algebra appl., 282, 25-45, (1998) · Zbl 0936.65056
[16] A. Storjohann, Algorithms for Matrix Canonical Forms, Ph.D. Thesis, Swiss Federal Institute of Technology-ETH, 2000.
[17] Wan, D., Mirror symmetry for zeta functions, AMS/IP stud. adv. math, vol. 38, (2006), Amer. Math. Soc. Providence, RI · Zbl 1116.11044
[18] Wan, D., Modular counting of rational points over finite fields, Found. comput. math., 8, 597-605, (2008) · Zbl 1235.11061
[19] Wang, W.; Sun, Q., The number of solutions of certain equations over finite fields, Finite fields appl., 2, 182-192, (2005) · Zbl 1153.11309
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.