Nonreciprocal algebraic numbers of small Mahler's measure

Artūras Dubickas; Jonas Jankauskas

The search session has expired. Please query the service again.

Displaying similar documents to “Nonreciprocal algebraic numbers of small Mahler's measure”

Factorization of irreducible polynomials over a finite field with the substitution $x^{(} q^{r}) - x$ for x

Andrew Long (1973)

Acta Arithmetica

Similarity:

A class of irreducible polynomials

Joshua Harrington, Lenny Jones (2013)

Colloquium Mathematicae

Similarity:

Let $f (x) = x ⁿ + k_{n - 1} x^{n - 1} + k_{n - 2} x^{n - 2} + \dots + k ₁ x + k ₀ \in ℤ [x]$ , where $3 \leq k_{n - 1} \leq k_{n - 2} \leq \dots \leq k ₁ \leq k ₀ \leq 2 k_{n - 1} - 3$ . We show that f(x) and f(x²) are irreducible over ℚ. Moreover, the upper bound of $2 k_{n - 1} - 3$ on the coefficients of f(x) is the best possible in this situation.

Polynomial relations amongst algebraic units of low measure

John Garza (2014)

Acta Arithmetica

Similarity:

For an algebraic number field and a subset $α_{1}, . . ., α_{r} \subseteq_{}$ , we establish a lower bound for the average of the logarithmic heights that depends on the ideal of polynomials in $ℚ [x_{1}, . . ., x_{r}]$ vanishing at the point $(α_{1}, . . ., α_{r})$ .

Recurrences for the coefficients of series expansions with respect to classical orthogonal polynomials

Stanislaw Lewanowicz (2002)

Applicationes Mathematicae

Similarity:

Let $P_{k}$ be any sequence of classical orthogonal polynomials. Further, let f be a function satisfying a linear differential equation with polynomial coefficients. We give an algorithm to construct, in a compact form, a recurrence relation satisfied by the coefficients $a_{k}$ in $f = \sum_{k} a_{k} P_{k}$ . A systematic use of the basic properties (including some nonstandard ones) of the polynomials $P_{k}$ results in obtaining a low order of the recurrence.

Estimates for polynomials in the unit disk with varying constant terms

Stephan Ruscheweyh, Magdalena Wołoszkiewicz (2011)

Annales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica

Similarity:

Let $∥ \cdot ∥$ be the uniform norm in the unit disk. We study the quantities $M_{n} (α) : = inf (∥ z P (z) + α ∥ - α)$ where the infimum is taken over all polynomials $P$ of degree $n - 1$ with $∥ P (z) ∥ = 1$ and $α > 0$ . In a recent paper by Fournier, Letac and Ruscheweyh (Math. Nachrichten 283 (2010), 193-199) it was shown that ${inf}_{α > 0} M_{n} (α) = 1 / n$ . We find the exact values of $M_{n} (α)$ and determine corresponding extremal polynomials. The method applied uses known cases of maximal ranges of polynomials.

The factorization of $f (x) x^{n} + g (x)$ with $f (x)$ monic and of degree $\leq 2$ .

Joshua Harrington, Andrew Vincent, Daniel White (2013)

Journal de Théorie des Nombres de Bordeaux

Similarity:

In this paper we investigate the factorization of the polynomials $f (x) x^{n} + g (x) \in ℤ [x]$ in the special case where $f (x)$ is a monic quadratic polynomial with negative discriminant. We also mention similar results in the case that $f (x)$ is monic and linear.

A Green's function for θ-incomplete polynomials

Joe Callaghan (2007)

Annales Polonici Mathematici

Similarity:

Let K be any subset of $ℂ^{N}$ . We define a pluricomplex Green’s function $V_{K, θ}$ for θ-incomplete polynomials. We establish properties of $V_{K, θ}$ analogous to those of the weighted pluricomplex Green’s function. When K is a regular compact subset of $ℝ^{N}$ , we show that every continuous function that can be approximated uniformly on K by θ-incomplete polynomials, must vanish on $K ∖ s u p p {(d d^{c} V_{K, θ})}^{N}$ . We prove a version of Siciak’s theorem and a comparison theorem for θ-incomplete polynomials. We compute $s u p p {(d d^{c} V_{K, θ})}^{N}$ when K is a compact...

Inequalities for two sine polynomials

Horst Alzer, Stamatis Koumandos (2006)

Colloquium Mathematicae

Similarity:

We prove: (I) For all integers n ≥ 2 and real numbers x ∈ (0,π) we have $α \leq \sum_{j = 1}^{n - 1} 1 / (n ² - j ²) s i n (j x) \leq β$ , with the best possible constant bounds α = (15-√2073)/10240 √(1998-10√2073) = -0.1171..., β = 1/3. (II) The inequality $0 < \sum_{j = 1}^{n - 1} (n ² - j ²) s i n (j x)$ holds for all even integers n ≥ 2 and x ∈ (0,π), and also for all odd integers n ≥ 3 and x ∈ (0,π - π/n].

Calculation of the greatest common divisor of perturbed polynomials

Zítko, Jan, Eliaš, Ján

Similarity:

The coefficients of the greatest common divisor of two polynomials $f$ and $g$ (GCD $(f, g)$ ) can be obtained from the Sylvester subresultant matrix $S_{j} (f, g)$ transformed to lower triangular form, where $1 \leq j \leq d$ and $d =$ deg(GCD $(f, g)$ ) needs to be computed. Firstly, it is supposed that the coefficients of polynomials are given exactly. Transformations of $S_{j} (f, g)$ for an arbitrary allowable $j$ are in details described and an algorithm for the calculation of the GCD $(f, g)$ is formulated. If inexact polynomials are given, then an approximate...

Lower bounds for norms of products of polynomials on $L_{p}$ spaces

Daniel Carando, Damián Pinasco, Jorge Tomás Rodríguez (2013)

Studia Mathematica

Similarity:

For 1 < p < 2 we obtain sharp lower bounds for the uniform norm of products of homogeneous polynomials on $L_{p} (μ)$ , whenever the number of factors is no greater than the dimension of these Banach spaces (a condition readily satisfied in infinite-dimensional settings). The result also holds for the Schatten classes $_{p}$ . For p > 2 we present some estimates on the constants involved.

The algebra of polynomials on the space of ultradifferentiable functions

Katarzyna Grasela (2010)

Banach Center Publications

Similarity:

We consider the space $^{ℳ}$ of ultradifferentiable functions with compact supports and the space of polynomials on $^{ℳ}$ . A description of the space $(^{ℳ})$ of polynomial ultradistributions as a locally convex direct sum is given.

Approximation by weighted polynomials in $ℝ^{k}$

Maritza M. Branker (2005)

Annales Polonici Mathematici

Similarity:

We apply pluripotential theory to establish results in $ℝ^{k}$ concerning uniform approximation by functions of the form wⁿPₙ where w denotes a continuous nonnegative function and Pₙ is a polynomial of degree at most n. Then we use our work to show that on the intersection of compact sections $Σ \subset ℝ^{k}$ a continuous function on Σ is uniformly approximable by θ-incomplete polynomials (for a fixed θ, 0 < θ < 1) iff f vanishes on θ²Σ. The class of sets Σ expressible as the intersection of compact...

Some hypergeometric polynomials associated with the Lauricella function $F_{D}$ of several variables. I

L. Carlitz, H. M. Srivastava (1976)

Matematički Vesnik

Similarity:

Some hypergeometric polynomials associated with the Lauricella function $F_{D}$ of several variables. II

L. Carlitz, H. M. Srivastava (1976)

Matematički Vesnik

Similarity:

The R₂ measure for totally positive algebraic integers

V. Flammang (2016)

Colloquium Mathematicae

Similarity:

Let α be a totally positive algebraic integer of degree d, i.e., all of its conjugates $α ₁ = α, . . ., α_{d}$ are positive real numbers. We study the set ₂ of the quantities ${(\prod_{i = 1}^{d} {(1 + α ²_{i})}^{1 / 2})}^{1 / d}$ . We first show that √2 is the smallest point of ₂. Then, we prove that there exists a number l such that ₂ is dense in (l,∞). Finally, using the method of auxiliary functions, we find the six smallest points of ₂ in (√2,l). The polynomials involved in the auxiliary function are found by a recursive algorithm.

On the lattice of polynomials with integer coefficients: the covering radius in $L_{p} (0, 1)$

Wojciech Banaszczyk, Artur Lipnicki (2015)

Annales Polonici Mathematici

Similarity:

The paper deals with the approximation by polynomials with integer coefficients in $L_{p} (0, 1)$ , 1 ≤ p ≤ ∞. Let $P_{n, r}$ be the space of polynomials of degree ≤ n which are divisible by the polynomial $x^{r} {(1 - x)}^{r}$ , r ≥ 0, and let $P_{n, r}^{ℤ} \subset P_{n, r}$ be the set of polynomials with integer coefficients. Let $μ (P_{n, r}^{ℤ}; L_{p})$ be the maximal distance of elements of $P_{n, r}$ from $P_{n, r}^{ℤ}$ in $L_{p} (0, 1)$ . We give rather precise quantitative estimates of $μ (P_{n, r}^{ℤ}; L ₂)$ for n ≳ 6r. Then we obtain similar, somewhat less precise, estimates of $μ (P_{n, r}^{ℤ}; L_{p})$ for p ≠ 2. It follows that $μ (P_{n, r}^{ℤ}; L_{p}) ≍ n^{- 2 r - 2 / p}$ as n → ∞. The results...

On the value set of small families of polynomials over a finite field, II

Guillermo Matera, Mariana Pérez, Melina Privitelli (2014)

Acta Arithmetica

Similarity:

We obtain an estimate on the average cardinality (d,s,a) of the value set of any family of monic polynomials in $_{q} [T]$ of degree d for which s consecutive coefficients $a = (a_{d - 1}, . . ., a_{d - s})$ are fixed. Our estimate asserts that $(d, s, a) = μ_{d} q + (q^{1 / 2})$ , where $μ_{d} : = \sum_{r = 1}^{d} ({(- 1)}^{r - 1}) / (r!)$ . We also prove that $₂ (d, s, a) = μ ²_{d} q ² + (q^{3 / 2})$ , where ₂(d,s,a) is the average second moment of the value set cardinalities for any family of monic polynomials of $_{q} [T]$ of degree d with s consecutive coefficients fixed as above. Finally, we show that $₂ (d, 0) = μ ²_{d} q ² + (q)$ , where ₂(d,0) denotes the average second moment for...

Fejér–Riesz factorizations and the structure of bivariate polynomials orthogonal on the bi-circle

Jeffrey S. Geronimo, Plamen Iliev (2014)

Journal of the European Mathematical Society

Similarity:

We give a complete characterization of the positive trigonometric polynomials $Q (θ, ϕ)$ on the bi-circle, which can be factored as $Q (θ, ϕ) = | p (e^{i θ}, e^{i ϕ}) |^{2}$ where $p (z, w)$ is a polynomial nonzero for $| z | = 1$ and $| w | \leq 1$ . The conditions are in terms of recurrence coefficients associated with the polynomials in lexicographical and reverse lexicographical ordering orthogonal with respect to the weight $\frac{1}{4 π^{2} Q (θ, ϕ)}$ on the bi-circle. We use this result to describe how specific factorizations of weights on the bi-circle can be translated into identities...

Explicit bounds for the Łojasiewicz exponent in the gradient inequality for polynomials

Didier D&#039;Acunto, Krzysztof Kurdyka (2005)

Annales Polonici Mathematici

Similarity:

Let f: ℝⁿ → ℝ be a polynomial function of degree d with f(0) = 0 and ∇f(0) = 0. Łojasiewicz’s gradient inequality states that there exist C > 0 and ϱ ∈ (0,1) such that ${| \nabla f | \geq C | f |}^{ϱ}$ in a neighbourhood of the origin. We prove that the smallest such exponent ϱ is not greater than $1 - R {(n, d)}^{- 1}$ with $R (n, d) = d {(3 d - 3)}^{n - 1}$ .