Page 1

Displaying 1 – 10 of 10

Showing per page

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...

Representations of multivariate polynomials by sums of univariate polynomials in linear forms

A. Białynicki-Birula, A. Schinzel (2008)

Colloquium Mathematicae

The paper is concentrated on two issues: presentation of a multivariate polynomial over a field K, not necessarily algebraically closed, as a sum of univariate polynomials in linear forms defined over K, and presentation of a form, in particular a zero form, as the sum of powers of linear forms projectively distinct defined over an algebraically closed field. An upper bound on the number of summands in presentations of all (not only generic) polynomials and forms of a given number of variables and...

Currently displaying 1 – 10 of 10

Page 1