All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 13 Next

Displaying 241 – 260 of 374

Showing per page

Quasi-permutation polynomials

Vichian Laohakosol, Suphawan Janphaisaeng (2010)

Czechoslovak Mathematical Journal

A quasi-permutation polynomial is a polynomial which is a bijection from one subset of a finite field onto another with the same number of elements. This is a natural generalization of the familiar permutation polynomials. Basic properties of quasi-permutation polynomials are derived. General criteria for a quasi-permutation polynomial extending the well-known Hermite's criterion for permutation polynomials as well as a number of other criteria depending on the permuted domain and range are established....

Random Galois extensions of Hilbertian fields

Lior Bary-Soroker, Arno Fehm (2013)

Journal de Théorie des Nombres de Bordeaux

Let L be a Galois extension of a countable Hilbertian field K . Although L need not be Hilbertian, we prove that an abundance of large Galois subextensions of L / K are.

Reducibility of Symmetric Polynomials

A. Schinzel (2005)

Bulletin of the Polish Academy of Sciences. Mathematics

A necessary and sufficient condition is given for reducibility of a symmetric polynomial whose number of variables is large in comparison to degree.

Reduction and specialization of polynomials

Pierre Dèbes (2016)

Acta Arithmetica

We show explicit forms of the Bertini-Noether reduction theorem and of the Hilbert irreducibility theorem. Our approach recasts in a polynomial context the geometric Grothendieck good reduction criterion and the congruence approach to HIT for covers of the line. A notion of “bad primes” of a polynomial P ∈ ℚ[T,Y] irreducible over ℚ̅ is introduced, which plays a central and unifying role. For such a polynomial P, we deduce a new bound for the least integer t₀ ≥ 0 such that P(t₀,Y) is irreducible...

Currently displaying 241 – 260 of 374