A note on the van der Waerden conjecture on random polynomials with symmetric Galois group for function fields

04/06/2022
by   Erich L. Kaltofen, et al.
0

Let f(x) = x^n + (a[n-1] t + b[n-1]) x^(n-1) + ... + (a[0] t + b[0]) be of constant degree n in x and degree <= 1 in t, where all a[i],b[i] are randomly and uniformly selected from a finite field GF(q) of q elements. Then the probability that the Galois group of f over the rational function field GF(q)(t) is the symmetric group S(n) on n elements is 1 - O(1/q). Furthermore, the probability that the Galois group of f(x) over GF(q)(t) is not S(n) is >= 1/q for n >= 3 and > 1/q - 1/(2q^2) for n = 2.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/10/2022

Some Extremal Symmetric Inequalities

Let ℋ_n,d^s := ℝ[x_1,…, x_n]_d^𝔖_n be the set of symmetric polynomials o...
research
07/22/2020

Rational points on complete symmetric hypersurfaces over finite fields

For any affine hypersurface defined by a complete symmetric polynomial i...
research
03/23/2020

Improved Lower Bounds for Permutation Arrays Using Permutation Rational Functions

We consider rational functions of the form V(x)/U(x), where both V(x) an...
research
11/15/2021

A geometric generalization of Kaplansky's direct finiteness conjecture

Let G be a group and let k be a field. Kaplansky's direct finiteness con...
research
06/06/2018

The stabilizer for n-qubit symmetric states

The stabilizer group for an n-qubit state |ϕ〉 is the set of all invertib...
research
03/22/2022

An Algorithm for Solving Solvable Polynomial Equations of Arbitrary Degree by Radicals

This work provides a method(an algorithm) for solving the solvable unary...
research
03/14/2022

Computing a Group Action from the Class Field Theory of Imaginary Hyperelliptic Function Fields

We explore algorithmic aspects of a simply transitive commutative group ...

Please sign up or login with your details

Forgot password? Click here to reset