Splitting Behavior of SnS_n-Polynomials

We analyze the probability that, for a fixed finite set of primes S, a random, monic, degree n polynomial f(x) with integer coefficients in a box of side B around 0 satisfies: (i) f(x) is irreducible over the rationals, with splitting field over the rationals having Galois group $S_n$; (ii) the polynomial discriminant Disc(f) is relatively prime to all primes in S; (iii) f(x) has a prescribed splitting type at each prime p in S. The limit probabilities as $B \to \infty$ are described in terms of values of a one-parameter family of measures on $S_n$, called splitting measures, with parameter $z$ evaluated at the primes p in S. We study properties of these measures. We deduce that there exist degree n extensions of the rationals with Galois closure having Galois group $S_n$ with a given finite set of primes S having given Artin symbols, with some restrictions on allowed Artin symbols for p<n. We compare the distributions of these measures with distributions formulated by Bhargava for splitting probabilities for a fixed prime $p$ in such degree $n$ extensions ordered by size of discriminant, conditioned to be relatively prime to $p$.Comment: 33 pages, v2 34 pages, introduction revise

Efficient linear feedback shift registers with maximal period

We introduce and analyze an efficient family of linear feedback shift registers (LFSR's) with maximal period. This family is word-oriented and is suitable for implementation in software, thus provides a solution to a recent challenge posed in FSE '94. The classical theory of LFSR's is extended to provide efficient algorithms for generation of irreducible and primitive LFSR's of this new type