Roots under convolution of sequences

The convolution a * b of the sequences a = a₀, a₁, a₂, and b is the sequence with elements ∑₀ⁿ a_kb_{n − k}. One sets 1, 1, 1, equal to σ. Given that a * a with a ≥ 0 is close to σ * σ, how close is a to σ? More generally, one asks how close a is to σ if the p-th convolution power, a*P with a ≥ 0, is close to σ*P. Power series and complex analysis form a natural tool to estimate the ‘summed deviation’ ρ = σ * (a — σ) in terms of b = a * a — σ * σ or b = a*P − σ*P. Optimal estimates are found under the condition ∑_k=0ⁿ b_k² = %plane1D;512;(n^{2β + 1}) whenever −½ < β < p − 1. It is not known what the optimal estimates are for the special case b_n = %plane1D;512;(n^β).     

Characterization of algebraic curves by Chebyshev quadrature

Complex potential theory is used to show that Chebyshev-type quadrature works particularly well on algebraic Jordan curves Γ in ℝ ^d , supplied with normalized arc length or a similar probability measure μ. Evaluating the integral ∫_Γ fdμ by the arithmetic mean of the value off on any cycle ofN equally spaced nodes on Γ (relative to μ), the quadrature error will, be bounded byAe ^−bN sup_Γ|f| for allN and all polynomialsf(x) of degree ≤cN. It is plausible that small shifts of the nodes would give quadrature error zero for such polynomials. There are related results for algebraic Jordan arcs and certain algebraic surfaces. The situation is completely different for nonalgebraic curves and surfaces, where corresponding quadrature remainders are at least of order 1/N.