Remarks on Hardy spaces defined by non-smooth approximate identity

We study in this paper some relations between Hardy spaces which are defined by non-smooth approximate identity ?(x), and the end-point Triebel-Lizorkin spaces (1?q?∞). First, we prove that for compact ? which satisfies a slightly weaker condition than Fefferman and Stein's condition. Then we prove that non-trivial Hardy space defined by approximate identity ? must contain Besov space . Thirdly, we construct certain functions and a function such that Daubechies wavelet function but .     

Strong convergence of the empirical distribution of eigenvalues of sample covariance matrices with a perturbation matrix

Let , where is a random symmetric matrix, a random symmetric matrix, and with being independent real random variables. Suppose that , and are independent. It is proved that the empirical spectral distribution of the eigenvalues of random symmetric matrices converges almost surely to a non-random distribution.     

Efficient algorithms for robust generalized cross-validation spline smoothing

Generalized cross-validation (GCV) is a widely used parameter selection criterion for spline smoothing, but it can give poor results if the sample size n is not sufficiently large. An effective way to overcome this is to use the more stable criterion called robust GCV (RGCV). The main computational effort for the evaluation of the GCV score is the trace of the smoothing matrix, , while the RGCV score requires both and . Since 1985, there has been an efficient O(n) algorithm to compute . This paper develops two pairs of new O(n) algorithms to compute and , which allow the RGCV score to be calculated efficiently. The algorithms involve the differentiation of certain matrix functionals using banded Cholesky decomposition.     

Normal cones to infinite intersections

For sets given as finite intersections the basic normal cone is given as , but such a result is not, in general, available for infinite intersections. A comparable characterization of is obtained here for a class of such infinite intersections.     

On the numerical radius of operators in Lebesgue spaces

We show that the absolute numerical index of the space Lp(μ) is (where ). In other words, we prove that

     

Markov interlacing property for exponential polynomials

Let Un be an extended Tchebycheff system on the real line. Given a point , where x₁<?<xn, we denote by the polynomial from Un, which has zeros x₁,…,xn. (It is uniquely determined up to multiplication by a constant.) The system Un has the Markov interlacing property (M) if the assumption that and interlace implies that the zeros of and interlace strictly, unless . We formulate a general condition which ensures the validity of the property (M) for polynomials from Un. We also prove that the condition is satisfied for some known systems, including exponential polynomials and . As a corollary we obtain that property (M) holds true for Müntz polynomials , too.     

Proper analytic free maps

This paper concerns analytic free maps. These maps are free analogs of classical analytic functions in several complex variables, and are defined in terms of non-commuting variables amongst which there are no relations - they are free variables. Analytic free maps include vector-valued polynomials in free (non-commuting) variables and form a canonical class of mappings from one non-commutative domain D in say g variables to another non-commutative domain in variables. As a natural extension of the usual notion, an analytic free map is proper if it maps the boundary of D into the boundary of . Assuming that both domains contain 0, we show that if is a proper analytic free map, and f(0)=0, then f is one-to-one. Moreover, if also , then f is invertible and f−1 is also an analytic free map. These conclusions on the map f are the strongest possible without additional assumptions on the domains D and .     

On the number of graphs with a given endomorphism monoid

For a given finite monoid , let be the number of graphs on n vertices with endomorphism monoid isomorphic to . For any nontrivial monoid we prove that where and are constants depending only on with .For every k there exists a monoid of size k with , on the other hand if a group of unity of has a size k>2 then .     

Kripke semantics for provability logic GLP

A well-known polymodal provability logic due to Japaridze is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in arithmetic. This system plays an important role in some recent applications of provability algebras in proof theory. However, an obstacle in the study of is that it is incomplete w.r.t. any class of Kripke frames. In this paper we provide a complete Kripke semantics for . First, we isolate a certain subsystem of that is sound and complete w.r.t. a nice class of finite frames. Second, appropriate models for are defined as the limits of chains of finite expansions of models for . The techniques involves unions of n-elementary chains and inverse limits of Kripke models. All the results are obtained by purely modal-logical methods formalizable in elementary arithmetic.     

On Γ-convergence of pairs of dual functionals

The paper considers a slightly modified notion of the Γ-convergence of convex functionals in uniformly convex Banach spaces and establishes that under standard coercitivity and growth conditions the Γ-convergence of a sequence of functionals {Fj} to implies that the corresponding sequence of dual functionals converges in an analogous sense to the dual to functional .     

On continuous choice of retractions onto nonconvex subsets

For a Banach space B and for a class A of its bounded closed retracts, endowed with the Hausdorff metric, we prove that retractions on elements A∈A can be chosen to depend continuously on A, whenever nonconvexity of each A∈A is less than . The key geometric argument is that the set of all uniform retractions onto an α-paraconvex set (in the spirit of E. Michael) is -paraconvex subset in the space of continuous mappings of B into itself. For a Hilbert space H the estimate can be improved to and the constant can be replaced by the root of the equation α+α²+α³=1.     

On the computation of the jdeg of blowup algebras

For a graded algebra , its is a global degree that can be used to study issues of complexity of the normalization . Here some techniques grounded on Rees algebra theory are used to estimate . A closely related notion, of divisorial generation, is introduced to count numbers of generators of .     

Kirillov-Reshetikhin crystals for nonexceptional types

We provide combinatorial models for all Kirillov-Reshetikhin crystals of nonexceptional type, which were recently shown to exist. For types , , we rely on a previous construction using the Dynkin diagram automorphism which interchanges nodes 0 and 1. For type we use a Dynkin diagram folding and for types , a similarity construction. We also show that for types and the analog of the Dynkin diagram automorphism exists on the level of crystals.     

Unconditional constants and polynomial inequalities

If P is a polynomial on R^m of degree at most n, given by , and P_n(R^m) is the space of such polynomials, then we define the polynomial |P| by . Now if is a convex set, we define the norm on P_n(R^m), and then we investigate the inequality providing sharp estimates on for some specific spaces of polynomials. These ’s happen to be the unconditional constants of the canonical bases of the considered spaces.     

Scattering above energy norm of solutions of a loglog energy-supercritical Schrödinger equation with radial data

We prove global well-posedness and scattering of -solutions of the loglog energy-supercritical Schrödinger equation , 0<c<cn, n={3,4}, with radial data , . This is achieved, roughly speaking, by extending Bourgain's argument in Bourgain (1999) [1] (see also Grillakis, 2000 [5]) and Tao's argument in Tao (2005) [10] in high dimensions.     

Almost complex structure and the quotient four-manifold by an anti-symplectic involution

Suppose that X is a closed, symplectic four-manifold with an anti-symplectic involution σ and its two-dimensional fixed point set. We show that the quotient X/σ admits no almost complex structure if .As a partial converse if X is simply-connected and , then the X/σ admits an almost complex structure.Also we show that the quotient X/σ admits an almost complex structure if X is Kähler and .