Algebraic polynomials least deviating from zero in measure on a segment

We investigate the problem of algebraic polynomials with given leading coefficients that deviate least from zero on the segment [–1, 1] with respect to a measure, or, more precisely, with respect to the functional μ(f) = mes{x ∈ [–1, 1]: ∣f (x)∣ ≥ 1}. We also discuss an analogous problem with respect to the integral functionals ∫_–1¹ φ (∣f (x)∣) dx for functions φ that are defined, nonnegative, and nondecreasing on the semiaxis [0, +∞).     

Coconvex approximation of periodic functions

The Jackson inequality relates the value of the best uniform approximation E _n (f) of a continuous 2π-periodic function f: ℝ → ℝ by trigonometric polynomials of degree ≤ n − 1 to its third modulus of continuity ω ₃(f, t). In the present paper, we show that this inequality is true if continuous 2π-periodic functions that change their convexity on [−π, π) only at every point of a fixed finite set consisting of an even number of points are approximated by polynomials coconvex to them. __________ Translated from Ukrains’kyi Matematychnyi Zhurnal, Vol. 59, No. 1, pp. 29–43, January, 2007.     

Nonnegative Trigonometric Polynomials

An extremal problem for the coefficients of sine polynomials, which are nonnegative in [0,π] , posed and discussed by Rogosinski and Szegő is under consideration. An analog of the Fejér—Riesz representation of nonnegative general trigonometric and cosine polynomials is proved for nonnegative sine polynomials. Various extremal sine polynomials for the problem of Rogosinski and Szegő are obtained explicitly. Associated cosine polynomials k _n (θ) are constructed in such a way that { k _n (θ) } are summability kernels. Thus, the L _p , pointwise and almost everywhere convergence of the corresponding convolutions, is established. April 26, 2000. Date revised: December 28, 2000. Date accepted: February 8, 2001.     

A generalization of bounded variation

Generalized Wiener classes are considered. For these classes the exact order of Fourier coefficients with respect to the trigonometric system is established and the estimation of ‖S _n(·, f)-f(·)‖_{C [0,2π]} where S _n(·, f) are the Fourier partial sums, is given. In particular, a uniform convergence criterion for the Fourier trigonometric series is obtained. This revised version was published online in August 2006 with corrections to the Cover Date.     

Another Note on Polynomial vs Rational Approximation

LetEbe a subspace ofC(X) and letR(E)=g/h : g, hE; h>0}. We make a simple, yet intriguing observation: if zero is a best approximation toffromE, then zero is a best approximation toffromR(E). We also prove that if {E_n} is dense inC(X) then for almost allf(in the sense of category)[formula]That extends the results of P. Borwein and S. Zhou who proved it for the case whenE_nis the space of algebraic or trigonometric polynomials of degreen.     

On K s -free subgraphs in K s+k -free graphs and vertex Folkman numbers

Extending the problem of determining Ramsey numbers Erdős and Rogers introduced the following function. For given integers 2 ≤ s < t let f _s,t (n) = min{max{|S|: S ⊆ V (H) and H[S] contains no K _s }}, where the minimum is taken over all K _t -free graphs H of order n. This function attracted a considerable amount of attention but despite that, the gap between the lower and upper bounds is still fairly wide. For example, when t=s+1, the best bounds have been of the form Ω(n ^1/2+o(1)) ≤ f _s,s+1(n) ≤ O(n ^1−ɛ(s)), where ɛ(s) tends to zero as s tends to infinity. In this paper we improve the upper bound by showing that f _s,s+1(n) ≤ O(n ^2/3). Moreover, we show that for every ɛ > 0 and sufficiently large integers 1 ≪ k ≪ s, Ω(n ^1/2−ɛ ) ≤ f _s,s+k (n) ≤ O(n ^1/2+ɛ . In addition, we also discuss some connections between the function f _s,t and vertex Folkman numbers.     

On Polynomials Sharing Preimages of Compact Sets, and Related Questions

In this paper we give a solution of the following problem: under what conditions on infinite compact sets and polynomials f ₁, f ₂ do the preimages f ₁⁻¹{K ₁} and f ₂⁻¹{K ₂} coincide. Besides, we investigate some related questions. In particular, we show that polynomials sharing an invariant compact set distinct from a point have equal Julia sets. Received: May 2006, Accepted: June 2006     

Extreme Jensen measures

Let Ω be an open subset of R ^d , d≥2, and let x∈Ω. A Jensen measure for x on Ω is a Borel probability measure μ, supported on a compact subset of Ω, such that ∫u  dμ≤u(x) for every superharmonic function u on Ω. Denote by J _x (Ω) the family of Jensen measures for x on Ω. We present two characterizations of ext(J _x (Ω)), the set of extreme elements of J _x (Ω). The first is in terms of finely harmonic measures, and the second as limits of harmonic measures on decreasing sequences of domains. This allows us to relax the local boundedness condition in a previous result of B. Cole and T. Ransford, Jensen measures and harmonic measures, J. Reine Angew. Math. 541 (2001), 29–53. As an application, we give an improvement of a result by Khabibullin on the question of whether, given a complex sequence {α _n } _n=1 ^∞ and a continuous function , there exists an entire function f≢0 satisfying f(α _n )=0 for all n, and |f(z)|≤M(z) for all z∈C.     

Jackson's theorem for compact connected Lie groups

We prove that for f ε E = C(G) or L^p(G), 1 p < ∞, where G is any compact connected Lie group, and for n 1, there is a trigonometric polynomial t_n on G of degree n so that f − t_nE C_rω_r(n⁻¹,f). Here ω_r(t, f) denotes the rth modulus of continuity of f. Using this and sharp estimates of the Lebesgue constants recently obtained by Giulini and Travaglini, we obtain “best possible” criteria for the norm convergence of the Fourier series of f.     

Uniformity over primes of tamely ramified splittings

We fix a prime p and let f(X) vary over all monic integer polynomials of fixed degree n. Given any possible shape of a tamely ramified splitting of p in an extension of degree n, we prove that there exists a rational function φ(X)∈ℚ(X) such that the density of the monic integer polynomials f(X) for which the splitting of p has the given shape in ℚ[X]/f(X) is φ(p) (here reducible polynomials can be neglected). As a corollary, we prove that, for p≥n, the density of irreducible monic polynomials of degree n in ℤ _p [X] is the value at p of a rational function φ _n (X)∈ℚ(X). All rational functions involved are effectively computable. Received: 15 September 1998 / Revised version: 21 October 1999     

Approximation of multidimensional functions with a given majorant of mixed moduli of continuity

In the paper order-exact upper bounds for the best approximations of classesH _q ^Emphasis>/ω by trigonometric polynomials are obtained. The spectrum of the approximating polynomials lies in sets generated by the level surfaces of the function ω(t). These sets are a generalization of hyperbolic crosses to the case of an arbitrary function ω(t). Translated fromMatematicheskie Zametki, Vol. 65, No. 1, pp. 107–117, January, 1999.     

Growth Behavior and Zero Distribution of Rational Approximants

We investigate the growth and the distribution of zeros of rational uniform approximations with numerator degree ≤n and denominator degree ≤m _n for meromorphic functions f on a compact set E of ℂ where m _n =o(n/log n) as n→∞. We obtain a Jentzsch–Szegő type result, i.e., the zero distribution converges weakly to the equilibrium distribution of the maximal Green domain E _ρ(f) of meromorphy of f if f has a singularity of multivalued character on the boundary of E _ρ(f). The paper extends results for polynomial approximation and rational approximation with fixed degree of the denominator. As applications, Padé approximation and real rational best approximants are considered.     

A Problem of Totik on Fast Decreasing Polynomials

We solve a problem posed by V. Totik on the existence of fast-decreasing polynomials p _n of degree with p _n (0)=1 and for . For the largest c for which such polynomials exist was known. We give the solution for β > 2 . April 18, 1996.     

Multiplicity Results for Asymptotically Linear Equations, Using the Rotation Number Approach

By using a topological approach and the relation between rotation numbers and weighted eigenvalues, we give some multiplicity results for the boundary value problem u′′ + f(t, u) = 0, u(0) = u(T) = 0, under suitable assumptions on f(t, x)/x at zero and infinity. Solutions are characterized by their nodal properties. Supported by MIUR, GNAMPA and FCT.     

An operator approach to zero-sum repeated games

We consider two person zero-sum stochastic games. The recursive formula for the valuesvλ (resp.v _n) of the discounted (resp. finitely repeated) version can be written in terms of a single basic operator Φ(α,f) where α is the weight on the present payoff andf the future payoff. We give sufficient conditions in terms of Φ(α,f) and its derivative at 0 for limv _n and limvλ to exist and to be equal. We apply these results to obtain such convergence properties for absorbing games with compact action spaces and incomplete information games.     

A counterexample in copositive approximation

The present paper gives a converse result by showing that there exists a functionf ∈C _[−1,1], which satisfies that sgn(x)f(x) ≥ 0 forx ∈ [−1, 1], such that {fx75-1} whereE _n ⁽⁰⁾ (f, 1) is the best approximation of degreen tof by polynomials which are copositive with it, that is, polynomialsP withP(x(f(x) ≥ 0 for allx ∈ [−1, 1],E _n(f) is the ordinary best polynomial approximation off of degreen.     

Explicit generalized zolotarev polynomials with complex coefficients

We give explicitly a class of polynomials with complex coefficients of degreen which deviate least from zero on [−1, 1] with respect to the max-norm among all polynomials which have the same,m + 1, 2m ≤n, first leading coefficients. Form=1, we obtain the polynomials discovered by Freund and Ruschewyh. Furthermore, corresponding results are obtained with respect to weight functions of the type 1/√ρl, whereρl is a polynomial positive on [−1, 1].     

Invariance of Milnor numbers and topology of complex polynomials

We give a global version of Lê-Ramanujam μ-constant theorem for polynomials. Let , , be a family of polynomials of n complex variables with isolated singularities, whose coefficients are polynomials in t. We consider the case where some numerical invariants are constant (the affine Milnor number μ(t), the Milnor number at infinity λ(t), the number of critical values, the number of affine critical values, the number of critical values at infinity). Let n=2, we also suppose the degree of the is a constant, then the polynomials and are topologically equivalent. For we suppose that critical values at infinity depend continuously on t, then we prove that the geometric monodromy representations of the are all equivalent. Received: January 14, 2002     

Adjoints of semigroups acting on vector-valued function spaces

LetT(t) be the translation group onY=C ₀(ℝ×K)=C ₀(ℝ)⊗C(K),K compact Hausdorff, defined byT(t)f(x, y)=f(x+t, y). In this paper we give several representations of the sun-dialY ^⊙ corresponding to this group. Motivated by the solution of this problem, viz.Y ^⊙=L ¹(ℝ)⊗M(K), we develop a duality theorem for semigroups of the formT ₀(t)⊗id on tensor productsZ⊗X of Banach spaces, whereT ₀(t) is a semigroup onZ. Under appropriate compactness assumptions, depending on the kind of tensor product taken, we show that the sun-dial ofZ⊗X is given byZ ^⊙⊗X*. These results are applied to determine the sun-dials for semigroups induced on spaces of vector-valued functions, e.g.C ₀(Ω;X) andL ^p (μ;X). This paper was written during a half-year stay at the Centre for Mathematics and Computer Science CWI in Amsterdam. I am grateful to the CWI and the Dutch National Science Foundation NWO for financial support.     

On the distribution of reducible polynomials

Let ℛ _n (t) denote the set of all reducible polynomials p(X) over ℤ with degree n ≥ 2 and height ≤ t. We determine the true order of magnitude of the cardinality |ℛ _n (t)| of the set ℛ _n (t) by showing that, as t → ∞, t ² log t ≪ |ℛ₂(t)| ≪ t ² log t and t ⁿ ≪ |ℛ _n (t)| ≪ t _n for every fixed n ≥ 3. Further, for 1 < n/2 < k < n fixed let ℛ _k,n (t) ⊂ ℛ _n (t) such that p(X) ∈ ℛ _k,n (t) if and only if p(X) has an irreducible factor in ℤ[X] of degree k. Then, as t → ∞, we always have t ^k+1 ≪ |ℛ _k,n (t)| ≪ t ^k+1 and hence |ℛ _n−1,n (t)| ≫ |ℛ _n (t)| so that ℛ _n−1,n (t) is the dominating subclass of ℛ _n (t) since we can show that |ℛ _n (t)∖ℛ _n−1,n (t)| ≪ t ⁿ⁻¹(log t)².On the contrary, if R _n ^s (t) is the total number of all polynomials in ℛ _n (t) which split completely into linear factors over ℤ, then t ²(log t) ⁿ⁻¹ ≪ R _n ^s (t) ≪ t ² (log t) ⁿ⁻¹ (t → ∞) for every fixed n ≥ 2.