POLYNOMIAL ROOT SEPARATION

2010 ◽  
Vol 06 (03) ◽  
pp. 587-602 ◽  
Author(s):  
YANN BUGEAUD ◽  
MAURICE MIGNOTTE
Keyword(s):  
Integer Polynomials ◽  
Integer Polynomial

We discuss the following question: How close to each other can two distinct roots of an integer polynomial be? We summarize what is presently known on this and related problems, and establish several new results on root separation of monic, integer polynomials.

ROOTS OF POLYNOMIALS WITH DOMINANT TERM

2011 ◽  
Vol 07 (05) ◽  
pp. 1217-1228 ◽  
Author(s):  
ARTŪRAS DUBICKAS
Keyword(s):  
Constant Coefficient ◽  
Roots Of Unity ◽  
Algebraic Numbers ◽  
Algebraic Integers ◽  
Dominant Term ◽  
Minimal Weight ◽  
Number Systems ◽  
Integer Polynomials ◽  
Roots Of Polynomials ◽  
Integer Polynomial

We characterize all algebraic numbers which are roots of integer polynomials with a coefficient whose modulus is greater than or equal to the sum of moduli of all the remaining coefficients. It turns out that these numbers are zero, roots of unity and those algebraic numbers β whose conjugates over ℚ (including β itself) do not lie on the circle |z| = 1. We also describe all algebraic integers with norm B which are roots of an integer polynomial with constant coefficient B and the sum of moduli of all other coefficients at most |B|. In contrast to the above, the set of such algebraic integers is "quite small". These results are motivated by a recent paper of Frougny and Steiner on the so-called minimal weight β-expansions and are also related to some work on canonical number systems and tilings.

scholarly journals Closest integer polynomial multiple recurrence along shifted primes

2016 ◽  
Vol 38 (2) ◽  
pp. 666-685 ◽  
Author(s):  
ANDREAS KOUTSOGIANNIS
Keyword(s):  
Ergodic Theory ◽  
Correspondence Principle ◽  
Integer Part ◽  
Multiple Recurrence ◽  
Transference Principle ◽  
Empty Intersection ◽  
Integer Polynomials ◽  
Convergence Results ◽  
Shifted Primes ◽  
Integer Polynomial

Following an approach presented by Frantzikinakis et al [The polynomial multidimensional Szemerédi theorem along shifted primes. Israel J. Math.194(1) (2013), 331–348], we show that the parameters in the multidimensional Szemerédi theorem for closest integer polynomials have non-empty intersection with the set of shifted primes $\mathbb{P}-1$ (or, similarly, of $\mathbb{P}+1$). Using the Furstenberg correspondence principle, we show this result by recasting it as a polynomial multiple recurrence result in measure ergodic theory. Furthermore, we obtain integer part polynomial convergence results by the same method, which is a transference principle that enables one to deduce results for $\mathbb{Z}$-actions from results for flows. We also give some applications of our approach to Gowers uniform sets.

The Solvability of Polynomial Pell’s Equation

2020 ◽  
Vol 25 (2) ◽  
pp. 125-132
Author(s):  
Bal Bahadur Tamang ◽  
Ajay Singh
Keyword(s):  
Trivial Solution ◽  
Continued Fraction ◽  
Laurent Series ◽  
Quadratic Polynomial ◽  
Continued Fraction Expansion ◽  
Pell’S Equation ◽  
Integer Polynomials

This article attempts to describe the continued fraction expansion of ÖD viewed as a Laurent series x-1. As the behavior of the continued fraction expansion of ÖD is related to the solvability of the polynomial Pell’s equation p2-Dq2=1  where D=f2+2g  is monic quadratic polynomial with deg g<deg f  and the solutions p, q  must be integer polynomials. It gives a non-trivial solution if and only if the continued fraction expansion of ÖD  is periodic.

scholarly journals Orbit Polynomial of Graphs versus Polynomial with Integer Coefficients

Symmetry ◽  
2021 ◽  
Vol 13 (4) ◽  
pp. 710
Author(s):  
Modjtaba Ghorbani ◽  
Maryam Jalali-Rad ◽  
Matthias Dehmer
Keyword(s):  
Integer Coefficients ◽  
Integer Polynomial ◽  
Counting Polynomial

Suppose ai indicates the number of orbits of size i in graph G. A new counting polynomial, namely an orbit polynomial, is defined as OG(x) = ∑i aixi. Its modified version is obtained by subtracting the orbit polynomial from 1. In the present paper, we studied the conditions under which an integer polynomial can arise as an orbit polynomial of a graph. Additionally, we surveyed graphs with a small number of orbits and characterized several classes of graphs with respect to their orbit polynomials.

Sets with large intersection and ubiquity

2008 ◽  
Vol 144 (1) ◽  
pp. 119-144 ◽  
Author(s):  
ARNAUD DURAND
Keyword(s):  
Diophantine Approximation ◽  
Nondecreasing Function ◽  
Gauge Function ◽  
Algebraic Numbers ◽  
Positive Real ◽  
Integer Polynomials ◽  
Large Intersection ◽  
Image Position ◽  
Full Lebesgue Measure ◽  
Arbitrary Norm

AbstractA central problem motivated by Diophantine approximation is to determine the size properties of subsets of$\R^d$ ($d\in\N$)of the formwhere ‖⋅‖ denotes an arbitrary norm,Ia denumerable set, (xi,ri)i∈ Ia family of elements of$\R^d\$× (0, ∞) and ϕ a nonnegative nondecreasing function defined on [0, ∞). We show that ifFId, where Id denotes the identity function, has full Lebesgue measure in a given nonempty open subsetVof$\R^d\$, the setFϕbelongs to a class Gh(V) of sets with large intersection inVwith respect to a given gauge functionh. We establish that this class is closed under countable intersections and that each of its members has infinite Hausdorffg-measure for every gauge functiongwhich increases faster thanhnear zero. In particular, this yields a sufficient condition on a gauge functiongsuch that a given countable intersection of sets of the formFϕhas infinite Hausdorffg-measure. In addition, we supply several applications of our results to Diophantine approximation. For any nonincreasing sequenceψof positive real numbers converging to zero, we investigate the size and large intersection properties of the sets of all points that areψ-approximable by rationals, by rationals with restricted numerator and denominator and by real algebraic numbers. This enables us to refine the analogs of Jarník's theorem for these sets. We also study the approximation of zero by values of integer polynomials and deduce several new results concerning Mahler's and Koksma's classifications of real transcendental numbers.

scholarly journals Integer Polynomial Optimization in Fixed Dimension

2006 ◽  
Vol 31 (1) ◽  
pp. 147-153 ◽  
Author(s):  
Jesús A. De Loera ◽  
Raymond Hemmecke ◽  
Matthias Köppe ◽  
Robert Weismantel
Keyword(s):  
Polynomial Optimization ◽  
Fixed Dimension ◽  
Integer Polynomial

Integer Polynomial

2007 ◽  
Keyword(s):  
Integer Polynomial
Sign in / Sign up

Export Citation Format

Share Document