On L(d,1)-labelings of graphs

Given a graph G and a positive integer d, an L(d,1)-labeling of G is a function f that assigns to each vertex of G a non-negative integer such that if two vertices u and v are adjacent, then |f(u)−f(v)|d; if u and v are not adjacent but there is a two-edge path between them, then |f(u)−f(v)|1. The L(d,1)-number of G, λ_d(G), is defined as the minimum m such that there is an L(d,1)-labeling f of G with f(V){0,1,2,…,m}. Motivated by the channel assignment problem introduced by Hale (Proc. IEEE 68 (1980) 1497–1514), the L(2,1)-labeling and the L(1,1)-labeling (as d=2 and 1, respectively) have been studied extensively in the past decade. This article extends the study to all positive integers d. We prove that λ_d(G)Δ²+(d−1)Δ for any graph G with maximum degree Δ. Different lower and upper bounds of λ_d(G) for some families of graphs including trees and chordal graphs are presented. In particular, we show that the lower and the upper bounds for trees are both attainable, and the upper bound for chordal graphs can be improved for several subclasses of chordal graphs.     

L2-approximation of real-valued functions with interpolatory constraints

We construct the polynomial p_m,n^* of degree m which interpolates a given real-valued function f L²[a, b] at pre-assigned n distinct nodes and is the best approximant to f in the L₂-sense over all polynomials of degree m with the same interpolatory character. It is shown that the L₂-error p_m,n^* − f → 0 as m → ∞ if f C[a, b].     

Separation properties of induced I(L)-topological spaces

The concept of induced I(L)-topological spaces has been introduced by Kubiak (Ph.D. Thesis, UAM, Poznan, 1985) and independently by Wang (Kexue Tongbao 34 (5) (1989) 333). In this paper, the separation properties in the sense of Hutton–Reilly of induced I(L)-topological spaces are investigated. The main result of the paper is a characterization of L-topological spaces by means of the appropriate Hutton–Reilly separation properties of its induced I(L)-topological space.     

The L~(p,q)-stability of the Shifts of Finitely Many Functions in Mixed Lebesgue Spaces L~(p,q)(R~(d+1))

The stability is an expected property for functions,which is widely considered in the study of approximation theory and wavelet analysis.In this paper,we consider the Lp,q-stability of the shifts of finitely many functions in mixed Lebesgue spaces L~(p,q)(R~(d+1)).We first show that the shiftsφ(·-k)(k∈Z~(d+1))are Lp,q-stable if and only if for anyξ∈R~(d+1),∑_(k∈Z~(d+1))|φ(ξ+2πk)|~20.Then we give a necessary and sufficient condition for the shifts of finitely many functions in mixed Lebesgue spaces L~(p,q)(R~(d+1))to be Lp,q-stable which improves some known results.     

No-hole L(2,1)-colorings

An L(2,1)-coloring of a graph G is a coloring of G's vertices with integers in {0,1,…,k} so that adjacent vertices’ colors differ by at least two and colors of distance-two vertices differ. We refer to an L(2,1)-coloring as a coloring. The span λ(G) of G is the smallest k for which G has a coloring, a span coloring is a coloring whose greatest color is λ(G), and the hole index ρ(G) of G is the minimum number of colors in {0,1,…,λ(G)} not used in a span coloring. We say that G is full-colorable if ρ(G)=0. More generally, a coloring of G is a no-hole coloring if it uses all colors between 0 and its maximum color. Both colorings and no-hole colorings were motivated by channel assignment problems. We define the no-hole span μ(G) of G as ∞ if G has no no-hole coloring; otherwise μ(G) is the minimum k for which G has a no-hole coloring using colors in {0,1,…,k}.

Let n denote the number of vertices of G, and let Δ be the maximum degree of vertices of G. Prior work shows that all non-star trees with Δ3 are full-colorable, all graphs G with n=λ(G)+1 are full-colorable, μ(G)λ(G)+ρ(G) if G is not full-colorable and nλ(G)+2, and G has a no-hole coloring if and only if nλ(G)+1. We prove two extremal results for colorings. First, for every m1 there is a G with ρ(G)=m and μ(G)=λ(G)+m. Second, for every m2 there is a connected G with λ(G)=2m, n=λ(G)+2 and ρ(G)=m.     

Geometric Counting on Wavefront Real Spherical Spaces

We provide L~p-versus L~∞-bounds for eigenfunctions on a real spherical space Z of wavefront type. It is shown that these bounds imply a non-trivial error term estimate for lattice counting on Z. The paper also serves as an introduction to geometric counting on spaces of the mentioned type.     

Constructions of Sidon spaces and cyclic subspace codes

In this paper, we firstly construct several new kinds of Sidon spaces and Sidon sets by investigating some known results. Secondly, using these Sidon spaces, we will present a construction of cyclic subspace codes with cardinality τ · $\frac{{{q^n} - 1}}{{q - 1}}$ and minimum distance 2k−2, where τ is a positive integer. We furthermore give some cyclic subspace codes with size 2τ · $\frac{{{q^n} - 1}}{{q - 1}}$ and without changing the minimum distance 2k−2.     

Generalized P(N)-graded Lie superalgebras

We generalize the P(N)-graded Lie superalgebras of Martinez-Zelmanov. This generalization is not so restrictive but suffcient enough so that we are able to have a classification for this generalized P(N)-graded Lie superalgebras. Our result is that the generalized P(N)-graded Lie super-algebra L is centrally isogenous to a matrix Lie superalgebra coordinated by an associative superalgebra with a super-involution. Moreover, L is P(N)-graded if and only if the coordinate algebra R is commutative and the super-involution is trivial. This recovers Martinez-Zelmanov's theorem for type P(N). We also obtain a generalization of Kac's coordinatization via Tits-Kantor-Koecher construction. Actually, the motivation of this generalization comes from the Fermionic-Bosonic module construction.     

Inequalities for the Extended Best Polynomial Approximation Operator in Orlicz Spaces

In this paper we pursue the study of the best approximation operator extended from L~Φ to L~φ, where φ denotes the derivative of the function Φ. We get pointwise convergence for the coefficients of the extended best approximation polynomials for a wide class of function f, closely related to the Calder′on–Zygmund class t_m~p(x) which had been introduced in 1961. We also obtain weak and strong type inequalities for a maximal operator related to the extended best polynomial approximation and a norm convergence result for the coefficients is derived. In most of these results, we have to consider Matuszewska–Orlicz indices for the function φ.     

H(λ)-completely Hausdorff axiom on L-topological spaces

This paper defines the new concept of completely Hausdorff axiom of an L-topological space by means of L-continuous mappings from an L-topological space to the refined Hutton's unit L-interval by Wang. Some characterizations of the completely Hausdorff axiom, defined in this paper, are given, and many nice properties of this kind of completely Hausdorff axiom are proved. For example, it is hereditary and product invariant; the refined Hutton's unit L-interval satisfy this kind of completely Hausdorff axiom, and when an L-topological space satisfy this kind of completely Hausdorff axiom, every f-convergent ideal does not have f-limit points with different supports etc. The relation between the completely Hausdorff axiom defined in the paper and other separation axioms is discussed also.     

Schur complements and LDU decomposition in an additive category

This note establishes the LDU decomposition of a morphism, satisfying the usual sort of hypotheses, in an additive category The Schur complement, defined in terms of this decomposition satisfies a quotient formula. For an appropriate choice of category we get an application to matrices, namely that a set of commutators relative to the blocks of a matrix. A, satisfies the same relations relative to its LD. and U. The Schur complement is shown to describe a quotient or kernel action in the case of an m by n or n by m commutator of rank m linking two matrices, extending some spectral results of Haynsworth. Again a suitable category yields further results on the usual Schur complement. Some non-matrix (topological group) examples are mentioned.     

Lp - Logistic discrimination

The paper presents L_p-solution for logistic discriminant function in dichotomous as well as in the polychotomous problem.     

Large eigenvalues of the laplacian

Let G be a simple graph on n vertices and let L=L(G) be the Laplacian matrix of G corresponding to some ordering of the vertices. It is known that λ≤n for any eigenvalue λ of L. In this note we characterize when n is an eigenvalue of L with multiplicity m.     

The 2D dissipative quasi-geostrophic equation

In this paper, we consider the initial value problem for the 2D critical dissipative quasigeostrophic equation and present results concerning global existence and uniqueness of its solutions in L^q([0, T]; L^p) and Sobolev spaces.     

Optimal L-error estimate for variational inequalities with nonlinear source terms

We establish optimal L^∞-error estimate for a class of variational inequalities (VIs) with nonlinear source term, using a very simple argument mainly based on the discrete L^∞-stability property with respect to the right-hand side in elliptic VIs. We also show that the same approach extends to the corresponding noncoercive problems and optimal uniform convergence order is obtained as well.     

Lp Estimates of certain rough parametric Marcinkiewicz functions

We prove L^p estimates of a class of parametric Marcinkiewicz integral operators when their kernels satisfy only the L^{\mathrm{1}}(S^{n-\mathrm{1}}) integrability condition. The obtained L^p estimates resolve a problem left open in previous work. Our argument is based on duality technique and direct estimation of operators. As a consequence of our result, we deduce the L^p boundedness of a class of fractional Marcinkiewicz integral operators.     

A note on the perron root of a weighted t-th Order mean of nonnegative matrices

In this paper we compare the spectral radius of a weighted additive mean L of order t involving Hadamard powers of nonnegative matrices with the corresponding mean R of the respective spectral radii especially, when all matrices are row stochastic, we obtain L≥R for t≥1 and L≤R for 0 ≤ t ≤ 1.     

Choosability of planar graphs

A graph G = G(V, E) with lists L(v), associated with its vertices v V, is called L-list colourable if there is a proper vertex colouring of G in which the colour assigned to a vertex v is chosen from L(v). We say G is k-choosable if there is at least one L-list colouring for every possible list assignment L with L(v) = k v V(G).

Now, let an arbitrary vertex v of G be coloured with an arbitrary colour f of L(v). We investigate whether the colouring of v can be continued to an L-list colouring of the whole graph. G is called free k-choosable if such an L-list colouring exists for every list assignment L (L(v) = k v V(G)), every vertex v and every colour f L(v). We prove the equivalence of the well-known conjecture of Erd s et al. (1979): “Every planar graph is 5-choosable” with the following conjecture: “Every planar graph is free 5-choosable”.     

On analytic and coanalytic function spaces Cp(X)

Under the assumption (V = L) we construct countable completely regular spaces X and Y such that the spaces C_p(X) and C_p(Y) of real-valued continuous functions on X and Y, equipped with the pointwise convergence topology, are analytic noncoanalytic and they are not homeomorphic. We also give analogous examples of coanalytic nonanalytic function spaces.