On the Lebesgue constant for the Xu interpolation formula

In the paper [Y. Xu, Lagrange interpolation on Chebyshev points of two variables, J. Approx. Theory 87 (1996) 220–238], the author introduced a set of Chebyshev-like points for polynomial interpolation (by a certain subspace of polynomials) in the square [-1,1]², and derived a compact form of the corresponding Lagrange interpolation formula. In [L. Bos, M. Caliari, S. De Marchi, M. Vianello, A numerical study of the Xu polynomial interpolation formula in two variables, Computing 76(3–4) (2005) 311–324], we gave an efficient implementation of the Xu interpolation formula and we studied numerically its Lebesgue constant, giving evidence that it grows like , n being the degree. The aim of the present paper is to provide an analytic proof to show that the Lebesgue constant does have this order of growth.     

Algebraic properties of some new vector-valued rational interpolants

In a recent paper of the author [A. Sidi, A new approach to vector-valued rational interpolation, J. Approx. Theory, 130 (2004) 177–187], three new interpolation procedures for vector-valued functions F(z), where , were proposed, and some of their properties were studied. In this work, after modifying their definition slightly, we continue the study of these interpolation procedures. We show that the interpolants produced via these procedures are unique in some sense and that they are symmetric functions of the points of interpolation. We also show that, under the conditions that guarantee uniqueness, they also reproduce F(z) in case F(z) is a rational function.     

A new proof of the Gasca–Maeztu conjecture for

In the Chung–Yao construction of poised nodes for bivariate polynomial interpolation [K.C. Chung, T.H. Yao, On lattices admitting unique Lagrange interpolations, SIAM J. Numer. Anal. 14 (1977) 735–743], the interpolation nodes are intersection points of some lines. The Berzolari–Radon construction [L. Berzolari, Sulla determinazione di una curva o di una superficie algebrica e su alcune questioni di postulazione, Lomb. Ist. Rend. 47 (2) (1914) 556–564; J. Radon, Zur mechanischen Kubatur, Monatsh. Math. 52 (1948) 286–300] seems to be more general, since in this case the nodes of interpolation lie (almost) arbitrarily on some lines. In 1982 Gasca and Maeztu conjectured that every poised set allowing the Chung–Yao construction is of Berzolari–Radon type. So far, this conjecture has been confirmed only for polynomial spaces of small total degree n≤4, the result being evident for n≤2 and not hard to see for n=3. For the case n=4 two proofs are known: one of J.R. Busch [J.R. Busch, A note on Lagrange interpolation in , Rev. Un. Mat. Argentina 36 (1990) 33–38], and another of J.M. Carnicer and M. Gasca [J.M. Carnicer, M. Gasca, A conjecture on multivariate polynomial interpolation, Rev. R. Acad. Cienc. Exactas Fís. Nat. (Esp.) Ser. A Mat. 95 (2001) 145–153]. Here we present a third proof which seems to be more geometric in nature and perhaps easier. We also present some results for the case of n=5 and for general n which might be useful for later consideration of the problem.     

Approximation theorems for localized szsz–Mirakjan operators

In the present paper, we investigate the convergence and the approximation order of the localized Szsz–Mirakjan operators, and obtain some new results to improve the results due to Omey [Note on operators of Szsz–Mirakjan type, J. Approx. Theory 47 (1986) 246–254].     

A Bahri–Lions theorem revisited

In 1988, A. Bahri and P.L. Lions [A. Bahri, P.L. Lions, Morse-index of some min–max critical points. I. Application to multiplicity results, Comm. Pure Appl. Math. 41 (1988) 1027–1037] studied the following elliptic problem:

where Ω is a bounded smooth domain of , 2<p<(2N−2)/(N−2) and f(x,u) is not assumed to be odd in u. They proved the existence of infinitely many solutions under an appropriate growth restriction on f. In the present paper, we improve this result by showing that under the same growth assumption on f the problem admits in fact infinitely many sign-changing solutions. In addition we derive an estimate on the number of their nodal domains. We also deal with the corresponding fourth order equation Δ²u=|u|^p−2u+f(x,u) with both Dirichlet and Navier boundary conditions, as well as with strongly coupled elliptic systems.     

Instance-optimality in probability with an -minimization decoder

Let Φ(ω), ωΩ, be a family of n×N random matrices whose entries _i,j are independent realizations of a symmetric, real random variable η with expectation and variance . Such matrices are used in compressed sensing to encode a vector by y=Φx. The information y holds about x is extracted by using a decoder . The most prominent decoder is the ℓ₁-minimization decoder Δ which gives for a given the element which has minimal ℓ₁-norm among all with Φz=y. This paper is interested in properties of the random family Φ(ω) which guarantee that the vector will with high probability approximate x in to an accuracy comparable with the best k-term error of approximation in for the range kan/log₂(N/n). This means that for the above range of k, for each signal , the vector satisfies

with high probability on the draw of Φ. Here, Σ_k consists of all vectors with at most k nonzero coordinates. The first result of this type was proved by Wojtaszczyk [P. Wojtaszczyk, Stability and instance optimality for Gaussian measurements in compressed sensing, Found. Comput. Math., in press] who showed this property when η is a normalized Gaussian random variable. We extend this property to more general random variables, including the particular case where η is the Bernoulli random variable which takes the values with equal probability. The proofs of our results use geometric mapping properties of such random matrices some of which were recently obtained in [A. Litvak, A. Pajor, M. Rudelson, N. Tomczak-Jaegermann, Smallest singular value of random matrices and geometry of random polytopes, Adv. Math. 195 (2005) 491–523].     

Well-posedness of the Cauchy problem for the fractional power dissipative equation in critical Besov spaces

In this paper we study the Cauchy problem for the semilinear fractional power dissipative equation u_t+(−Δ)^αu=F(u) for the initial data u₀ in critical Besov spaces with , where α>0, F(u)=P(D)u^b+1 with P(D) being a homogeneous pseudo-differential operator of order d[0,2α) and b>0 being an integer. Making use of some estimates of the corresponding linear equation in the frame of mixed time–space spaces, the so-called “mono-norm method” which is different from the Kato's “double-norm method,” Fourier localization technique and Littlewood–Paley theory, we get the well-posedness result in the case .     

On an extremal problem of Selberg II

Let m_p be the minimum of the product under the conditions that and . In our previous paper [J. Kaneko, On an extremal problem of Selberg, J. Approx. Theory 142 (2006) 129–137], we showed that the following estimates hold. provided p255. In this note, we prove that the limit of as p→∞ exists and is expressed by the (unique) solution of some simultaneous transcendental equations. By using this expression we obtain numerically.     

Pure inductive limit state and Kolmogorov's property

Let be a C^*-dynamical system where be a semigroup of injective endomorphism and ψ be an (λ_t) invariant state on the C^* subalgebra and is either non-negative integers or real numbers. The central aim of this exposition is to find a useful criteria for the inductive limit state canonically associated with ψ to be pure. We achieve this by exploring the minimal weak forward and backward Markov processes associated with the Markov semigroup on the corner von-Neumann algebra of the support projection of the state ψ to prove that Kolmogorov's property [A. Mohari, Markov shift in non-commutative probability, J. Funct. Anal. 199 (2003) 189–209] of the Markov semigroup is a sufficient condition for the inductive state to be pure. As an application of this criteria we find a sufficient condition for a translation invariant factor state on a one-dimensional quantum spin chain to be pure. This criteria in a sense complements criteria obtained in [O. Bratteli, P.E.T. Jorgensen, A. Kishimoto, R.F. Werner, Pure states on , J. Operator Theory 43 (1) (2000) 97–143; A. Mohari, Markov shift in non-commutative probability, J. Funct. Anal. 199 (2003) 189–209] as we could go beyond lattice symmetric states.     

Dual generalized Bernstein basis

The generalized Bernstein basis in the space Π_n of polynomials of degree at most n, being an extension of the q-Bernstein basis introduced by Philips [Bernstein polynomials based on the q-integers, Ann. Numer. Math. 4 (1997) 511–518], is given by the formula [S. Lewanowicz, P. Woźny, Generalized Bernstein polynomials, BIT Numer. Math. 44 (2004) 63–78],

We give explicitly the dual basis functions for the polynomials , in terms of big q-Jacobi polynomials P_k(x;a,b,ω/q;q), a and b being parameters; the connection coefficients are evaluations of the q-Hahn polynomials. An inverse formula—relating big q-Jacobi, dual generalized Bernstein, and dual q-Hahn polynomials—is also given. Further, an alternative formula is given, representing the dual polynomial (0jn) as a linear combination of min(j,n-j)+1 big q-Jacobi polynomials with shifted parameters and argument. Finally, we give a recurrence relation satisfied by , as well as an identity which may be seen as an analogue of the extended Marsden's identity [R.N. Goldman, Dual polynomial bases, J. Approx. Theory 79 (1994) 311–346].     

Stepanov-like pseudo-almost periodic mild solutions to perturbed nonautonomous evolution equations with infinite delay

In this paper, we prove the invariance of Stepanov-like pseudo-almost periodic functions under bounded linear operators. Furthermore, we obtain existence and uniqueness theorems of pseudo-almost periodic mild solutions to evolution equations u^′(t)=A(t)u(t)+h(t) and on , assuming that A(t) satisfy “Acquistapace–Terreni” conditions, that the evolution family generated by A(t) has exponential dichotomy, that R(λ₀,A()) is almost periodic, that B,C(t,s)_t≥s are bounded linear operators, that f is Lipschitz with respect to the second argument uniformly in the first argument and that h, f, F are Stepanov-like pseudo-almost periodic for p>1 and continuous. To illustrate our abstract result, a concrete example is given.     

On the nonlinear wave equation with the mixed nonhomogeneous conditions: Linear approximation and asymptotic expansion of solutions

In this paper, we consider the following nonlinear wave equation

(1)

where , , μ, f, g are given functions. To problem (1), we associate a linear recursive scheme for which the existence of a local and unique weak solution is proved by applying the Faedo–Galerkin method and the weak compact method. In the case of , , μ(z)≥μ₀>0, μ₁(z)≥0, for all , and , , , a weak solution u_ε1,ε2(x,t) having an asymptotic expansion of order N+1 in two small parameters ε₁, ε₂ is established for the following equation associated to (1)_2,3:

(2)

     

Upper bounds on the bisection width of 3- and 4-regular graphs

We derive new upper bounds on the bisection width of graphs which have a regular vertex degree. We show that the bisection width of sufficiently large 3-regular graphs with |V| vertices is at most , ε>0. For the bisection width of sufficiently large 4-regular graphs we show an upper bound of , ε>0.     

On the normalizing groupoids and the commensurability groupoids for inclusions of factors associated to ergodic equivalence relations–subrelations

It is shown that for the inclusion of factors corresponding to an inclusion of ergodic discrete measured equivalence relations , is normal in in the sense of Feldman–Sutherland–Zimmer [J. Feldman, C.E. Sutherland, R.J. Zimmer, Subrelations of ergodic equivalence relations, Ergodic Theory Dynam. Systems 9 (1989) 239–269] if and only if A is generated by the normalizing groupoid of B. Moreover, we show that there exists the largest intermediate equivalence subrelation which contains as a normal subrelation. We further give a definition of “commensurability groupoid” as a generalization of normality. We show that the commensurability groupoid of B in A generates A if and only if the inclusion BA is discrete in the sense of Izumi–Longo–Popa [M. Izumi, R. Longo, S. Popa, A Galois correspondence for compact groups of automorphisms of von Neumann algebras with a generalization to Kac algebras, J. Funct. Anal. 155 (1998) 25–63]. We also show that there exists the largest equivalence subrelation such that the inclusion is discrete. It turns out that the intermediate equivalence subrelations and thus defined can be viewed as groupoid-theoretic counterparts of a normalizer subgroup and a commensurability subgroup in group theory.     

A proof of a conjecture on the Randić index of graphs with given girth

The Randić index R(G) of a graph G is defined by , where is the degree of a vertex u in G and the summation extends over all edges uv of G. Aouchiche, Hansen and Zheng proposed the following conjecture: For any connected graph on n≥3 vertices with Randić index R and girth g,

with equalities if and only if . This paper is devoted to giving a confirmative proof to this conjecture.     

Linear information versus function evaluations for -approximation

We study algorithms for the approximation of functions, the error is measured in an L₂ norm. We consider the worst case setting for a general reproducing kernel Hilbert space of functions. We analyze algorithms that use standard information consisting in n function values and we are interested in the optimal order of convergence. This is the maximal exponent b for which the worst case error of such an algorithm is of order n^-b.Let p be the optimal order of convergence of all algorithms that may use arbitrary linear functionals, in contrast to function values only. So far it was not known whether p>b is possible, i.e., whether the approximation numbers or linear widths can be essentially smaller than the sampling numbers. This is (implicitly) posed as an open problem in the recent paper [F.Y. Kuo, G.W. Wasilowski, H. Woźniakowski, On the power of standard information for multivariate approximation in the worst case setting, J. Approx. Theory, to appear] where the authors prove that implies . Here we prove that the case and b=0 is possible, hence general linear information can be exponentially better than function evaluation. Since the case is quite different, it is still open whether b=p always holds in that case.     

Sharp approximations to the Bernoulli periodic functions by trigonometric polynomials

We obtain optimal trigonometric polynomials of a given degree N that majorize, minorize and approximate in the Bernoulli periodic functions. These are the periodic analogues of two works of Littmann [F. Littmann, Entire majorants via Euler–Maclaurin summation, Trans. Amer. Math. Soc. 358 (7) (2006) 2821–2836; F. Littmann, Entire approximations to the truncated powers, Constr. Approx. 22 (2) (2005) 273–295] that generalize a paper of Vaaler [J.D. Vaaler, Some extremal functions in Fourier analysis, Bull. Amer. Math. Soc. 12 (1985) 183–215]. As applications we provide the corresponding Erdös–Turán-type inequalities, approximations to other periodic functions and bounds for certain Hermitian forms.     

Refined blowup criteria and nonsymmetric blowup of an aggregation equation

We consider an aggregation equation in , d2, with fractional dissipation: u_t+(uK*u)=−νΛ^γu, where ν0, 0<γ<1, and K(x)=e^−|x|. We prove a refined blowup criteria by which the global existence of solutions is controlled by its norm, for any . We prove the finite time blowup of solutions for a general class of nonsymmetric initial data. The argument presented works for both the inviscid case ν=0 and the supercritical case ν>0 and 0<γ<1. Additionally, we present new proofs of blowup which does not use free energy arguments.