Page 1

Displaying 1 – 16 of 16

Showing per page

Integer Linear Programming applied to determining monic hyperbolic irreducible polynomials with integer coefficients and span less than 4

Souad El Otmani, Armand Maul, Georges Rhin, Jean-Marc Sac-Épée (2013)

Journal de Théorie des Nombres de Bordeaux

In this work, we propose a new method to find monic irreducible polynomials with integer coefficients, only real roots, and span less than 4. The main idea is to reduce the search of such polynomials to the solution of Integer Linear Programming problems. In this frame, the coefficients of the polynomials we are looking for are the integer unknowns. We give inequality constraints specified by the properties that the polynomials should have, such as the typical distribution of their roots. These...

Integer-valued polynomials on algebras: a survey

Sophie Frisch (2010)

Actes des rencontres du CIRM

We compare several different concepts of integer-valued polynomials on algebras and collect the few results and many open questions to be found in the literature.

Irreducible Jacobian derivations in positive characteristic

Piotr Jędrzejewicz (2014)

Open Mathematics

We prove that an irreducible polynomial derivation in positive characteristic is a Jacobian derivation if and only if there exists an (n-1)-element p-basis of its ring of constants. In the case of two variables we characterize these derivations in terms of their divergence and some nontrivial constants.

Currently displaying 1 – 16 of 16

Page 1