The Degree of the Splitting Field of a Random Polynomial over a Finite Field
نویسندگان
چکیده
The asymptotics of the order of a random permutation have been widely studied. P. Erdös and P. Turán proved that asymptotically the distribution of the logarithm of the order of an element in the symmetric group Sn is normal with mean 12(log n) 2 and variance 13(log n) 3. More recently R. Stong has shown that the mean of the order is asymptotically exp(C √ n/ log n + O( √ n log log n/ log n)) where C = 2.99047 . . .. We prove similar results for the asymptotics of the degree of the splitting field of a random polynomial of degree n over a finite field.
منابع مشابه
Splitting fields for characteristic polynomials of matrices with entries in a finite field
Let Mn(q) be the set of all n× n matrices with entries in the finite field Fq. With asymptotic probability one, the characteristic polynomial of a random A ∈ Mn(q) does not have all its roots in Fq. Let Xn(A) be the degree of the splitting field of the characteristic polynomial of A, and let μn be the average degree: μn = 1 |Mn(q)| ∑
متن کاملGray Images of Constacyclic Codes over some Polynomial Residue Rings
Let be the quotient ring where is the finite field of size and is a positive integer. A Gray map of length over is a special map from to ( . The Gray map is said to be a ( )-Gray map if the image of any -constacyclic code over is a -constacyclic code over the field . In this paper we investigate the existence of ( )-Gray maps over . In this direction, we find an equivalent ...
متن کاملPartial proof of Graham Higman's conjecture related to coset diagrams
Graham Higman has defined coset diagrams for PSL(2,ℤ). These diagrams are composed of fragments, and the fragments are further composed of two or more circuits. Q. Mushtaq has proved in 1983 that existence of a certain fragment γ of a coset diagram in a coset diagram is a polynomial f in ℤ[z]. Higman has conjectured that, the polynomials related to the fragments are monic and for a fixed degree...
متن کاملQUASI-PERMUTATION REPRESENTATIONS OF SUZtTKI GROUP
By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fai...
متن کاملFactoring Multivariate Polynomials over Finite Fields
We consider the deterministic complexity of the problem of polynomial factorization over finite fields given a finite field Fq and a polynomial h(x, y) ∈ Fq[x, y] compute the unique factorization of h(x, y) as a product of irreducible polynomials. This problem admits a randomized polynomial-time algorithm and no deterministic polynomial-time algorithm is known. In this chapter, we give a determ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 11 شماره
صفحات -
تاریخ انتشار 2004