On Mean Convergence of Lagrange Interpolation for General Arrays

For n1, let {x_jn}ⁿ_j=1 be n distinct points in a compact set K and letL_n[·] denote the corresponding Lagrange interpolation operator. Let v be a suitably restricted function on K. What conditions on the array {x_jn}_1jn, n1 ensure the existence of p>0 such that lim_n→∞ (f−L_n[f]) v_Lp(K)=0 for very continuous f: K→ ? We show that it is necessary and sufficient that there exists r>0 with sup_n1 π_nv_Lr(K) ∑ⁿ_j=1 (1/|π′_n| (x_jn))<∞. Here for n1, π_n is a polynomial of degree n having {x_jn}ⁿ_j=1 as zeros. The necessity of this condition is due to Ying Guang Shi.     

On the structure of semi-invariant polynomials in Ore extensions

Let D be an X-outer S-derivation of a prime ring R, where S is an automorphism of R. The following is proved among other things: The degree of the minimal semi-invariant polynomial of the Ore extension R[X;S,D] is ν if charR=0, and is p^kν for some k0 if charR=p2, where ν is the least integer ν1 such that S^νDS^−ν−D is X-inner. A similar result holds for cv-polynomials. These are done by introducing the new notion of k-basic polynomials for each integer k0, which enable us to analyze semi-invariant polynomials inductively.     

Global existence, uniqueness, and continuous dependence for a semilinear initial value problem

In this paper, we consider the semilinear initial value problem associated with an operator A whose spectrum lies in a sector of the complex plane and whose resolvent satisfies (z−A)⁻¹M|z|^γ for some −1<γ<0 and all z outside the sector. The properties of existence and uniqueness of global mild solutions and continuous dependence on the initial data are investigated.     

Existence of HSOLSSOMs of type

In this paper we investigate the existence of holey self-orthogonal Latin squares with a symmetric orthogonal mate of type 2ⁿu¹ (HSOLSSOM(2ⁿu¹)). For u2, necessary conditions for existence of such an HSOLSSOM are that u must be even and n3u/2+1. Xu Yunqing and Hu Yuwang have shown that these HSOLSSOMs exist whenever either (1) n9 and n3u/2+1 or (2) n263 and n2(u-2). In this paper we show that in (1) the condition n9 can be extended to n30 and that in (2), the condition n263 can be improved to n4, except possibly for 19 pairs (n,u), the largest of which is (53,28).     

The maximum spectral radius of -free graphs of given order and size

Suppose that G is a graph with n vertices and m edges, and let μ be the spectral radius of its adjacency matrix.Recently we showed that if G has no 4-cycle, then μ²-μn-1, with equality if and only if G is the friendship graph.Here we prove that if m9 and G has no 4-cycle, then μ²m, with equality if G is a star. For 4m8 this assertion fails.     

The Approximation Functional and Interpolation with Perturbed Continuity

The continuity conditions at the endpoints of interpolation theorems, Ta_BjM_j a_Aj for j=0, 1, can be written with the help of the approximation functional: E(t, Ta; B₁, B₀)_L^∞M₀ a_A0 and E(t, Ta; B₀, B₁)_L^∞M₁ a_A1. As a special case of the results we present here we show that in the hypotheses of the interpolation theorem the L^∞ norms can be replaced by BMO( ₊) norms. This leads to a strong version of the Stein-Weiss theorem on interpolation with change of measure. Another application of our results is that the condition fL⁰, i.e., f*L^∞, where f*(γ)=μ{|f|>γ} is the distribution function of f, can be replaced in interpolation with L(p, q) spaces by the weaker f*BMO( ₊).     

On accuracy of approximation of the spectral radius by the Gelfand formula

The famous Gelfand formula ρ(A)=limsup_n→∞A^n1/n for the spectral radius of a matrix is of great importance in various mathematical constructions. Unfortunately, the range of applicability of this formula is substantially restricted by a lack of estimates for the rate of convergence of the quantities A^n1/n to ρ(A). In the paper this deficiency is made up to some extent. By using the Bochi inequalities we establish explicit computable estimates for the rate of convergence of the quantities A^n1/n to ρ(A). The obtained estimates are then extended for evaluation of the joint spectral radius of matrix sets.     

A Nonsymmetric Correlation Inequality for Gaussian Measure

Letμbe a Gaussian measure (say, onRⁿ) and letK,LRⁿbe such thatKis convex,Lis a “layer” (i.e.,L={x: ax, ub} for somea, bRanduRⁿ), and the centers of mass (with respect toμ) ofKandLcoincide. Thenμ(K∩L)μ(K)·μ(L). This is motivated by the well-known “positive correlation conjecture” for symmetric sets and a related inequality of Sidak concerning confidence regions for means of multivariate normal distributions. The proof uses the estimateΦ(x)> 1−((8/π)^1/2/(3x+(x²+8)^1/2))e^−x2/2,x>−1, for the (standard) Gaussian cumulative distribution function, which is sharper than the classical inequality of Komatsu.     

Arithmetic progressions consisting of unlike powers

In this paper we present some new results about unlike powers in arithmetic progression. We prove among other things that for given k 4 and L 3 there are only finitely many arithmetic progressions of the form with x_i , gcd(x₀, x_l) = 1 and 2 l_i L for i = 0, 1, …, k − 1. Furthermore, we show that, for L = 3, the progression (1, 1,…, 1) is the only such progression up to sign. Our proofs involve some well-known theorems of Faltings [9], Darmon and Granville [6] as well as Chabauty's method applied to superelliptic curves.     

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.     

Generalized Bayes minimax estimators of the mean of multivariate normal distribution with unknown variance

We construct a broad class of generalized Bayes minimax estimators of the mean of a multivariate normal distribution with covariance equal to σ²I_p, with σ² unknown, and under the invariant loss δ(X)−θ²/σ². Examples that illustrate the theory are given. Most notably it is shown that a hierarchical version of the multivariate Student-t prior yields a Bayes minimax estimate.     

Viscosity approximation to common fixed points of a nonexpansive semigroup with a generalized contraction mapping

The purpose of this paper is to introduce and construct the implicit and explicit viscosity iterative processes by a generalized contraction mapping f and a nonexpansive semigroup {T(t):t0}, and to prove that under suitable conditions these iterative processes converge strongly to a unique common fixed point of {T(t):t0} in reflexive Banach spaces which admits a weakly sequentially continuous duality mapping.     

On the Norm of the Metric Projections

LetXbe a Banach space. GivenMa subspace ofXwe denote withP_Mthe metric projection ontoM. We defineπ(X) sup{P_M: Ma proximinal subspace ofX}. In this paper we give a bound forπ(X). In particular, whenX=L_p, we obtain the inequality P_M2^|2/p−1|, for every subspaceMofL_p. We also show thatπ(X)=π(X*).     

On shredders and vertex connectivity augmentation

We consider the following problem: given a k-(node) connected graph G find a smallest set F of new edges so that the graph G+F is (k+1)-connected. The complexity status of this problem is an open question. The problem admits a 2-approximation algorithm. Another algorithm due to Jordán computes an augmenting edge set with at most (k−1)/2 edges over the optimum. CV(G) is a k-separator (k-shredder) of G if |C|=k and the number b(C) of connected components of G−C is at least two (at least three). We will show that the problem is polynomially solvable for graphs that have a k-separator C with b(C)k+1. This leads to a new splitting-off theorem for node connectivity. We also prove that in a k-connected graph G on n nodes the number of k-shredders with at least p components (p3) is less than 2n/(2p−3), and that this bound is asymptotically tight.     

Primitive normal polynomials with a prescribed coefficient

In this paper, we established the existence of a primitive normal polynomial over any finite field with any specified coefficient arbitrarily prescribed. Let n15 be a positive integer and q a prime power. We prove that for any aF_q and any 1m<n, there exists a primitive normal polynomial f(x)=xⁿ−σ₁xⁿ⁻¹++(−1)ⁿ⁻¹σ_n−1x+(−1)ⁿσ_n such that σ_m=a, with the only exceptions σ₁≠0. The theory can be extended to polynomials of smaller degree too.     

Existence of nonstationary bubbles in higher dimensions

We are interested in the existence of travelling-waves for the nonlinear Schrödinger equation in R^N with “ψ³−ψ⁵”-type nonlinearity. First, we prove an abstract result in critical point theory (a local variant of the classical saddle-point theorem). Using this result, we get the existence of travelling-waves moving with sufficiently small velocity in space dimension N4.     

Perfect codes in direct products of cycles—a complete characterization

Let be a direct product of cycles. It is known that for any r1, and any n2, each connected component of G contains a so-called canonical r-perfect code provided that each ℓ_i is a multiple of rⁿ+(r+1)ⁿ. Here we prove that up to a reasonably defined equivalence, these are the only perfect codes that exist.     

Representable orientations of the free spikes

All orientations of binary and ternary matroids are representable [R.G. Bland, M. Las Vergnas, Orientability of matroids, J. Combinatorial Theory Ser. B 24 (1) (1978) 94–123; J. Lee, M. Scobee, A characterization of the orientations of ternary matroids, J. Combin. Theory Ser. B 77 (2) (1999) 263–291]. In this paper we show that this is not the case for matroids that are representable over GF(p^k) where k2. Specifically, we show that there are orientations of the rank-k free spike that are not representable for all k4. The proof uses threshold functions to obtain an upper bound on the number of representable orientations of the free spikes.