Degree distribution of the greatest common divisor of polynomials over 𝔽q

We study the degree distribution of the greatest common divisor of two or more random polynomials over a finite field ??_q. We provide estimates for several parameters like number of distinct common irreducible factors, number of irreducible factors counting repetitions, and total degree of the gcd of two or more polynomials. We show that the limiting distribution of a random variable counting the total degree of the gcd is geometric and that the distributions of random variables counting the number of common factors (with and without repetitions) are very close to Poisson distributions when q is large. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006     

最大公因数矩阵的行列式

设Ｓ＝｛ｘ１，ｘ２，…，ｘｎ）是含ｎ个不同正整数的集合，（Ｓ）表示定义在Ｓ上的最大公因数矩阵，本文证明了且等号成立当且仅当Ｓ是最大公因数封闭集．     

On linear codes whose weights and length have a common divisor

In this paper we prove that a set of points (in a projective space over a finite field of q elements), which is incident with 0 mod r points of every hyperplane, has at least (r−1)q+(p−1)r points, where 1<r<q=ph, p prime. An immediate corollary of this theorem is that a linear code whose weights and length have a common divisor r<q and whose dual minimum distance is at least 3, has length at least (r−1)q+(p−1)r. The theorem, which is sharp in some cases, is a strong generalisation of an earlier result on the non-existence of maximal arcs in projective planes; the proof involves polynomials over finite fields, and is a streamlined and more transparent version of the earlier one.     

On the graph of a function in many variables over a finite field

Some improved bounds on the number of directions not determined by a point set in the affine space AG(k, q) are presented. More precisely, if there are more than p ^e (q − 1) directions not determined by a set of q ^k-1 points then every hyperplane meets in 0 modulo p ^e+1 points. This bound is shown to be tight in the case p ^e = q ^s and when q = p ^es sets of q ^k-1 points that do not meet every hyperplane in 0 modulo p ^e+1 points and have a little less than p ^e (q − 1) non-determined directions are constructed. The author acknowledges the support of the Ramon y Cajal programme and the project MTM2005-08990-C02-01 of the Spanish Ministry of Science and Education and the project 2005SGR00256 of the Catalan Research Council.     

Congruence preserving functions in the residue class rings of polynomials over finite fields

In this paper, as an analogue of the integer case, we define congruence preserving functions over the residue class rings of polynomials over finite fields. We establish a counting formula for such congruence preserving functions, determine a necessary and sufficient condition under which all congruence preserving functions are also polynomial functions, and characterize such functions.     

On a class of diagonal equations over finite fields

Using properties of Gauss and Jacobi sums, we derive explicit formulas for the number of solutions to a diagonal equation of the form $x_1^{2^m}+\cdots +x_n^{2^m}=0$ over a finite field of characteristic $p\equiv \pm 3(\mathrm{mod}8)$. All of the evaluations are effected in terms of parameters occurring in quadratic partitions of some powers of p.     

On the number of directions determined by a pair of functions over a prime field

A three-dimensional analogue of the classical direction problem is proposed and an asymptotically sharp bound for the number of directions determined by a non-planar set in AG(3,p), p prime, is proved. Using the terminology of permutation polynomials the main result states that if there are more than pairs with the property that f(x)+ag(x)+bx is a permutation polynomial, then there exist elements c,d,e∈Fp with the property that f(x)=cg(x)+dx+e.     

Fast computation of a rational point of a variety over a finite field

We exhibit a probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence. Its time-space complexity is roughly quadratic in the logarithm of the cardinality of the field and a geometric invariant of the input system. This invariant, called the degree, is bounded by the Bézout number of the system. Our algorithm works for fields of any characteristic, but requires the cardinality of the field to be greater than a quantity which is roughly the fourth power of the degree of the input variety.

     

Sequences of consecutive smooth polynomials over a finite field

Given , we show that there are infinitely many sequences of consecutive -smooth polynomials over a finite field. The number of polynomials in each sequence is approximately .

     

Optimal curves of low genus over finite fields

We investigate maximal and minimal curves of genus 4 and 5 over finite fields with discriminant −11 and −19. As a result the Hasse–Weil–Serre bound is improved.     

A method for finding a common linear divisor of the matrix polynomials over an arbitrary field

Conditions are found which guarantee the existence of a common linear unital divisor with a given characteristic polynomial for the regular matrix polynomials over an arbitrary field. The result obtained is applied when finding a common solution of matrix polynomial equations.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 45, No. 8, pp. 1181–1183, August, 1993.