Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

On the constant factor in Vinogradov's Mean Value Theorem

100%

Kós G.

Acta Arithmetica

2001

tom 97

nr 2

99-101

The multiplicity of the zero at 1 of polynomials with constrained coefficients

51%

Borwein P., Erdélyi T., Kós G.

Acta Arithmetica

2013

tom 159

nr 4

387-395

For n ∈ ℕ, L > 0, and p ≥ 1 let $κ_p(n,L)$ be the largest possible value of k for which there is a polynomial P ≠ 0 of the form $P(x) = ∑_{j=0}^n{a_jx^j}$, $|a_0| ≥ L(∑_{j=1}^n{|a_j|^p} }^{1/p}$, $a_j ∈ ℂ$, such that $(x-1)^k$ divides P(x). For n ∈ ℕ and L > 0 let $κ_∞(n,L)$ be the largest possible value of k for which there is a polynomial P ≠ 0 of the form $P(x) = ∑_{j=0}^n{a_jx^j}$, $|a_0| ≥ Lmax_{1 ≤ j ≤ n}{|a_j|}$, $a_j ∈ ℂ$, such that $(x-1)^k$ divides P(x). We prove that there are absolute constants c₁ > 0 and c₂ > 0 such that $c_1 √(n/L) -1 ≤ κ_{∞}(n,L) ≤ c_2 √(n/L)$ for every L ≥ 1. This complements an earlier result of the authors valid for every n ∈ ℕ and L ∈ (0,1]. Essentially sharp results on the size of κ₂(n,L) are also proved.

Ograniczanie wyników

2 Acta Arithmetica

2 Kós G.

1 Borwein P.

1 Erdélyi T.

1 2013

1 2001

Wyniki wyszukiwania

On the constant factor in Vinogradov's Mean Value Theorem

The multiplicity of the zero at 1 of polynomials with constrained coefficients