Displaying 81 – 100 of 199

Showing per page

Nonreciprocal algebraic numbers of small Mahler's measure

Artūras Dubickas, Jonas Jankauskas (2013)

Acta Arithmetica

We prove that there exist at least cd⁵ monic irreducible nonreciprocal polynomials with integer coefficients of degree at most d whose Mahler measures are smaller than 2, where c is some absolute positive constant. These polynomials are constructed as nonreciprocal divisors of some Newman hexanomials 1 + x r + + x r , where the integers 1 ≤ r₁ < ⋯ < r₅ ≤ d satisfy some restrictions including 2 r j < r j + 1 for j = 1,2,3,4. This result improves the previous lower bound cd³ and seems to be closer to the correct value of...

Nonreciprocal algebraic numbers of small measure

Artūras Dubickas (2004)

Commentationes Mathematicae Universitatis Carolinae

The main result of this paper implies that for every positive integer d 2 there are at least ( d - 3 ) 2 / 2 nonconjugate algebraic numbers which have their Mahler measures lying in the interval ( 1 , 2 ) . These algebraic numbers are constructed as roots of certain nonreciprocal quadrinomials.

On Alternatives of Polynomial Congruences

Mariusz Skałba (2004)

Bulletin of the Polish Academy of Sciences. Mathematics

What should be assumed about the integral polynomials f ( x ) , . . . , f k ( x ) in order that the solvability of the congruence f ( x ) f ( x ) f k ( x ) 0 ( m o d p ) for sufficiently large primes p implies the solvability of the equation f ( x ) f ( x ) f k ( x ) = 0 in integers x? We provide some explicit characterizations for the cases when f j ( x ) are binomials or have cyclic splitting fields.

On an iterated construction of irreducible polynomials over finite fields of even characteristic by Kyuregyan

Simone Ugolini (2016)

Czechoslovak Mathematical Journal

We deal with the construction of sequences of irreducible polynomials with coefficients in finite fields of even characteristic. We rely upon a transformation used by Kyuregyan in 2002, which generalizes the Q -transform employed previously by Varshamov and Garakov (1969) as well as by Meyn (1990) for the synthesis of irreducible polynomials. While in the iterative procedure described by Kyuregyan the coefficients of the initial polynomial of the sequence have to satisfy certain hypotheses, in the...

Currently displaying 81 – 100 of 199