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.     

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 .     

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.     

A one-to-one correspondence between colorings and stable sets

Given a graph G, we construct an auxiliary graph with vertices such that the set of all stable sets of is in one-to-one correspondence with the set of all colorings of G. Then, we show that the Max-Coloring problem in G reduces to the Maximum Weighted Stable set problem in .     

A priori estimate for a family of semi-linear elliptic equations with critical nonlinearity

We consider positive solutions of on B₁ (n?5) where μ and K>0 are smooth functions on B₁. If K is very sub-harmonic at each critical point of K in B2/3 and the maximum of u in is comparable to its maximum over , then all positive solutions are uniformly bounded on . As an application, a priori estimate for solutions of equations defined on Sn is derived.     

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.     

Extension of Fourier algebra homomorphisms to duals of algebras of uniformly continuous functionals

For a locally compact group G, let XG be one of the following introverted subspaces of VN(G): , the C^∗-algebra of uniformly continuous functionals on A(G); , the space of weakly almost periodic functionals on A(G); or , the C^∗-algebra generated by the left regular representation on the measure algebra of G. We discuss the extension of homomorphisms of (reduced) Fourier-Stieltjes algebras on G and H to cb-norm preserving, weak^∗-weak^∗-continuous homomorphisms of into , where (XG,XH) is one of the pairs , , or . When G is amenable, these extensions are characterized in terms of piecewise affine maps.     

Large energy entire solutions for the Yamabe equation

We consider the Yamabe equation in Rn, n?3. Let k?1 and . For all large k we find a solution of the form , where , for n?4, for n=3 and o(1)→0 uniformly as k→+∞.     

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 .     

Linear choosability of sparse graphs

A linear coloring is a proper coloring such that each pair of color classes induces a union of disjoint paths. We study the linear list chromatic number, denoted , of sparse graphs. The maximum average degree of a graph G, denoted mad(G), is the maximum of the average degrees of all subgraphs of G. It is clear that any graph G with maximum degree Δ(G) satisfies . In this paper, we prove the following results: (1) if and Δ(G)≥3, then , and we give an infinite family of examples to show that this result is best possible; (2) if and Δ(G)≥9, then , and we give an infinite family of examples to show that the bound on cannot be increased in general; (3) if G is planar and has girth at least 5, then .     

Moduli of metaplectic bundles on curves and Theta-sheaves

We give a geometric interpretation of the Weil representation of the metaplectic group, placing it in the framework of the geometric Langlands program.For a smooth projective curve X we introduce an algebraic stack of metaplectic bundles on X. It also has a local version , which is a gerbe over the affine Grassmanian of G. We define a categorical version of the (nonramified) Hecke algebra of the metaplectic group. This is a category of certain perverse sheaves on , which act on by Hecke operators. A version of the Satake equivalence is proved describing as a tensor category. Further, we construct a perverse sheaf on corresponding to the Weil representation and show that it is a Hecke eigen-sheaf with respect to .     

Excessive factorizations of bipartite multigraphs

An excessive factorization of a multigraph G is a set F={F₁,F₂,…,F_r} of 1-factors of G whose union is E(G) and, subject to this condition, r is minimum. The integer r is called the excessive index of G and denoted by . We set if an excessive factorization does not exist. Analogously, let m be a fixed positive integer. An excessive[m]-factorization is a set M={M₁,M₂,…,M_k} of matchings of G, all of size m, whose union is E(G) and, subject to this condition, k is minimum. The integer k is denoted by and called the excessive [m]-index of G. Again, we set if an excessive [m]-factorization does not exist. In this paper we shall prove that, for bipartite multigraphs, both the parameters and are computable in polynomial time, and we shall obtain an efficient algorithm for finding an excessive factorization and excessive [m]-factorization, respectively, of any bipartite multigraph.     

Lifting fixed points of completely positive mappings

Let 1?n?∞, and let be a row contraction on some Hilbert space H. Let F(T) be the space of all X∈B(H) such that . We show that, if non-zero, this space is completely isometric to the commutant of the Cuntz part of the minimal isometric dilation of .     

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

     

Quasi-convex density and determining subgroups of compact abelian groups

For an abelian topological group G, let denote the dual group of all continuous characters endowed with the compact open topology. Given a closed subset X of an infinite compact abelian group G such that w(X)<w(G), and an open neighborhood U of 0 in T, we show that . (Here, w(G) denotes the weight of G.) A subgroup D of G determines G if the map defined by r(χ)=χ?D for , is an isomorphism between and . We prove that

     

Injections into function spaces over ordinals

We investigate when and how function spaces over subspaces of ordinals admit continuous injections into each other. To formulate our results let τ be an uncountable regular cardinal. We prove, in particular, that: (1) If A and B are disjoint stationary subsets of τ then Cp(A) does not admit a continuous injection into Cp(B); (2) For A⊂ω₁, admits a continuous injection into iff A is countable or ω₁ embeds into A (which, in its turn, is equivalent to the statement “ embeds into ”).     

The Szeg? curve and Laguerre polynomials with large negative parameters

We study the asymptotic zero distribution of the rescaled Laguerre polynomials, , with the parameter αn varying in such a way that . The connection with the so-called Szeg? curve is shown.     

Game colouring of the square of graphs

This paper studies the game chromatic number and game colouring number of the square of graphs. In particular, we prove that if G is a forest of maximum degree Δ≥9, then , and there are forests G with . It is also proved that for an outerplanar graph G of maximum degree Δ, , and for a planar graph G of maximum degree Δ, .     

A note on the automorphism groups of cubic Cayley graphs of finite simple groups

For a finite group G, a Cayley graph on G is said to be normal if . In this note, we prove that connected cubic non-symmetric Cayley graphs of the ten finite non-abelian simple groups G in the list of non-normal candidates given in [X.G. Fang, C.H. Li, J. Wang, M.Y. Xu, On cubic Cayley graphs of finite simple groups, Discrete Math. 244 (2002) 67-75] are normal.