Absolutely convergent Fourier series and function classes

We study the smoothness property of a function f with absolutely convergent Fourier series, and give best possible sufficient conditions in terms of its Fourier coefficients to ensure that f belongs either to one of the Lipschitz classes Lip(α) and lip(α) for some 0<α?1, or to one of the Zygmund classes Λ_∗(1) and λ_∗(1). Our theorems generalize some of those by Boas [R.P. Boas Jr., Fourier series with positive coefficients, J. Math. Anal. Appl. 17 (1967) 463-483] and one by Németh [J. Németh, Fourier series with positive coefficients and generalized Lipschitz classes, Acta Sci. Math. (Szeged) 54 (1990) 291-304]. We also prove a localized version of a theorem by Paley [R.E.A.C. Paley, On Fourier series with positive coefficients, J. London Math. Soc. 7 (1932) 205-208] on the existence and continuity of the derivative of f.     

Strongly quasibounded maximal monotone perturbations for the Berkovits-Mustonen topological degree theory

Let X be a real reflexive Banach space with dual X^∗. Let L:X⊃D(L)→X^∗ be densely defined, linear and maximal monotone. Let T:X⊃D(T)→X^∗2, with 0∈D(T) and 0∈T(0), be strongly quasibounded and maximal monotone, and C:X⊃D(C)→X^∗ bounded, demicontinuous and of type (S₊) w.r.t. D(L). A new topological degree theory has been developed for the sum L+T+C. This degree theory is an extension of the Berkovits-Mustonen theory (for T=0) and an improvement of the work of Addou and Mermri (for T:X→X^∗2 bounded). Unbounded maximal monotone operators with are strongly quasibounded and may be used with the new degree theory.     

Functional calculus and ∗-regularity of a class of Banach algebras II

In this article, we define a natural Banach ∗-algebra for a C^∗-dynamical system (A,G,α) which is slightly bigger than L¹(G;A) (they are the same if A is finite-dimensional). We will show that this algebra is ∗-regular if G has polynomial growth. The main result in this article extends the two main results in [C.W. Leung, C.K. Ng, Functional calculus and ∗-regularity of a class of Banach algebras, Proc. Amer. Math. Soc., in press].     

Semigroup crossed products and the induced algebras of lattice-ordered groups

Let (G,G₊) be a quasi-lattice-ordered group with positive cone G₊. Laca and Raeburn have shown that the universal C^∗-algebra C^∗(G,G₊) introduced by Nica is a crossed product BG₊α_×G₊ by a semigroup of endomorphisms. The goal of this paper is to extend some results for totally ordered abelian groups to the case of discrete lattice-ordered abelian groups. In particular given a hereditary subsemigroup H₊ of G₊ we introduce a closed ideal IH₊ of the C^∗-algebra BG₊. We construct an approximate identity for this ideal and show that IH₊ is extendibly α-invariant. It follows that there is an isomorphism between C^∗-crossed products and B₊(G/H)β_×G₊. This leads to our main result that B₊(G/H)β_×G₊ is realized as an induced C^∗-algebra .     

A note on ball-covering property of Banach spaces

By a ball-covering B of a Banach space X, we mean that B is a collection of open (or closed) balls off the origin whose union contains the unit sphere SX of X; and X is said to have the ball-covering property (BCP) provided it admits a ball-covering by countably many balls. In this note we give a natural example showing that the ball-covering property of a Banach space is not inherited by its subspaces; and we present a sharp quantitative version of the recent Fonf and Zanco renorming result saying that if the dual X^∗ of X is w^∗ separable, then for every ε>0 there exist a (1+ε)-equivalent norm on X, and an R>0 such that in this new norm SX admits a ball-covering by countably many balls of radius R. Namely, we show that R=R(ε) can be taken arbitrarily close to (1+ε)/ε, and that for X=?₁[0,1] the corresponding R cannot be equal to 1/ε. This gives the sharp order of magnitude for R(ε) as ε→0.     

Independence polynomials of k-tree related graphs

An independent set of a graph G is a set of pairwise non-adjacent vertices. Let α(G) denote the cardinality of a maximum independent set and f_s(G) for 0≤s≤α(G) denote the number of independent sets of s vertices. The independence polynomial defined first by Gutman and Harary has been the focus of considerable research recently. Wingard bounded the coefficients f_s(T) for trees T with n vertices: for s≥2. We generalize this result to bounds for a very large class of graphs, maximal k-degenerate graphs, a class which includes all k-trees. Additionally, we characterize all instances where our bounds are achieved, and determine exactly the independence polynomials of several classes of k-tree related graphs. Our main theorems generalize several related results known before.     

Labeling graphs with two distance constraints

Given a graph G and integers p,q,d₁ and d₂, with p>q, d₂>d₁?1, an L(d₁,d₂;p,q)-labeling of G is a function f:V(G)→{0,1,2,…,n} such that |f(u)−f(v)|?p if d_G(u,v)?d₁ and |f(u)−f(v)|?q if d_G(u,v)?d₂. A k-L(d₁,d₂;p,q)-labeling is an L(d₁,d₂;p,q)-labeling f such that max_v∈V(G)f(v)?k. The L(d₁,d₂;p,q)-labeling number ofG, denoted by , is the smallest number k such that G has a k-L(d₁,d₂;p,q)-labeling. In this paper, we give upper bounds and lower bounds of the L(d₁,d₂;p,q)-labeling number for general graphs and some special graphs. We also discuss the L(d₁,d₂;p,q)-labeling number of G, when G is a path, a power of a path, or Cartesian product of two paths.     

The profile of the Cartesian product of graphs

Given a graph G, a proper labelingf of G is a one-to-one function from V(G) onto {1,2,…,|V(G)|}. For a proper labeling f of G, the profile widthw_f(v) of a vertex v is the minimum value of f(v)−f(x), where x belongs to the closed neighborhood of v. The profile of a proper labelingfofG, denoted by P_f(G), is the sum of all the w_f(v), where v∈V(G). The profile ofG is the minimum value of P_f(G), where f runs over all proper labeling of G. In this paper, we show that if the vertices of a graph G can be ordered to satisfy a special neighborhood property, then so can the graph G×Q_n. This can be used to determine the profile of Q_n and K_m×Q_n.     

Solutions of nonlinear evolution inclusions

In this paper, the solution of the nonlinear evolution inclusion problem of the form u^′(t)+B(t,u(t))∋f(t) is studied. In this problem, the operators are of type (M) or type (S₊), which are different from those of pseudo-monotone operators that had been studied by many authors. At the same time, we study the perturbation problem. In fact, many kinds of evolution equations can be generalized by this problem. The former results are improved and generalized by our conclusions, and we will give more applications.     

Growth order and stability of semigroups and cosine operator functions

Equivalent conditions for a trajectory of a C₀-semigroup T(⋅) (resp. cosine function C(⋅)) of operators to have the growth order O(tα) or o(tα) are expressed in terms of Cesàro and Abel means of the norm of the trajectory. We then deduce characterizations of growth order and stability for T(⋅) and C(⋅). It is also shown that under some Tauberian condition the uniform boundedness (resp. strong convergence) of T(⋅) is equivalent to the uniform boundedness (resp. strong convergence) of its Abel means.     

An extremal problem on non-full colorable graphs

For a given graph G of order n, a k-L(2,1)-labelling is defined as a function f:V(G)→{0,1,2,…k} such that |f(u)-f(v)|?2 when d_G(u,v)=1 and |f(u)-f(v)|?1 when d_G(u,v)=2. The L(2,1)-labelling number of G, denoted by λ(G), is the smallest number k such that G has a k-L(2,1)-labelling. The hole index ρ(G) of G is the minimum number of integers not used in a λ(G)-L(2,1)-labelling of G. We say G is full-colorable if ρ(G)=0; otherwise, it will be called non-full colorable. In this paper, we consider the graphs with λ(G)=2m and ρ(G)=m, where m is a positive integer. Our main work generalized a result by Fishburn and Roberts [No-hole L(2,1)-colorings, Discrete Appl. Math. 130 (2003) 513-519].     

Linear-time certifying algorithms for near-graphical sequences

A sequence 〈d₁,d₂,…,d_n〉 of non-negative integers is graphical if it is the degree sequence of some graph, that is, there exists a graph G on n vertices whose ith vertex has degree d_i, for 1≤i≤n. The notion of a graphical sequence has a natural reformulation and generalization in terms of factors of complete graphs.If H=(V,E) is a graph and g and f are integer-valued functions on the vertex set V, then a (g,f)-factor of H is a subgraph G=(V,F) of H whose degree at each vertex v∈V lies in the interval [g(v),f(v)]. Thus, a (0,1)-factor is just a matching of H and a (1, 1)-factor is a perfect matching of H. If H is complete then a (g,f)-factor realizes a degree sequence that is consistent with the sequence of intervals 〈[g(v₁),f(v₁)],[g(v₂),f(v₂)],…,[g(v_n),f(v_n)]〉.Graphical sequences have been extensively studied and admit several elegant characterizations. We are interested in extending these characterizations to non-graphical sequences by introducing a natural measure of “near-graphical”. We do this in the context of minimally deficient (g,f)-factors of complete graphs. Our main result is a simple linear-time greedy algorithm for constructing minimally deficient (g,f)-factors in complete graphs that generalizes the method of Hakimi and Havel (for constructing (f,f)-factors in complete graphs, when possible). It has the added advantage of producing a certificate of minimum deficiency (through a generalization of the Erdös-Gallai characterization of (f,f)-factors in complete graphs) at no additional cost.     

Some complexity problems on single input double output controllers

We investigate the time complexity of constructing single input double output state feedback controller structures, given the directed structure graph G of a system. Such a controller structure defines a restricted type of P₃-partition of the graph G. A necessary condition (∗) is described and some classes of graphs are identified where the search problem of finding a feasible P₃-partition is polynomially solvable and, in addition, (∗) is not only necessary but also sufficient for the existence of a P₃-partition. It is also proved that the decision problem on two particular graph classes — defined in terms of forbidden subgraphs — remains NP-complete, but is polynomially solvable on the intersection of those two classes. The polynomial-time solvability of some further related problems is shown, too.     

The Independence Number for De Bruijn networks and Kautz networks

Let D be a directed graph; the (l,ω)-Independence Number of graph D, denoted by α_l,ω(D), is an important performance parameter for interconnection networks. De Bruijn networks and Kautz networks, denoted by B(d,n) and K(d,n) respectively, are versatile and efficient topological structures of interconnection networks. For l=1,2,…,n, this paper shows that α_l,d−1(B(d,n))=dⁿ,α_l,d−1(K(d,n))=α_l,d(K(d,n))=dⁿ+dⁿ⁻¹ if d≥3 and n≤d−2. In particular, the paper shows the exact value of the Independence Number for B(d,1) and B(d,2) for any d. For the generalized situation, the paper obtains a lower bound α_l,d−1(B(d,n))≥d² if n≥3 and d≥5.     

Completing an extension of Tunnell's theorem

We look at a special case of a familiar problem: Given a locally compact group G, a subgroup H and a complex representation π₊ of G how does π₊ decompose on restriction to H. Here G is GL⁺(2,F), where F is a nonarchimedian local field of characteristic not two, K a separable quadratic extension of F, GL⁺(2,F) the subgroup of index 2 in GL(2,F) consisting of those matrices whose determinant is in NK/F(K^∗), π₊ is an irreducible, admissible supercuspidal representation of GL⁺(2,F) and H=K^∗ under an embedding of K^∗ into GL(2,F).     

More on “Connected (n, m)-graphs with minimum and maximum zeroth-order general Randi? index”

Let G be a graph and d(u) denote the degree of a vertex u in G. The zeroth-order general Randi? index ⁰R_α(G) of the graph G is defined as ∑_u∈V(G)d(u)^α, where the summation goes over all vertices of G and α is an arbitrary real number. In this paper we correct the proof of the main Theorem 3.5 of the paper by Hu et al. [Y. Hu, X. Li, Y. Shi, T. Xu, Connected (n,m)-graphs with minimum and maximum zeroth-order general Randi? index, Discrete Appl. Math. 155 (8) (2007) 1044-1054] and give a more general Theorem. We finally characterize ¹ for α<0 the connected G(n,m)-graphs with maximum value ⁰R_α(G(n,m)), where G(n,m) is a simple connected graph with n vertices and m edges.     

Minimal rankings and the arank number of a path

Given a graph G, a function f:V(G)→{1,2,…,k} is a k-ranking of G if f(u)=f(v) implies every u-v path contains a vertex w such that f(w)>f(u). A k-ranking is minimal if the reduction of any label greater than 1 violates the described ranking property. The arank number of a graph, denoted ψ_r(G), is the largest k such that G has a minimal k-ranking. We present new results involving minimal k-rankings of paths. In particular, we determine ψ_r(P_n), a problem posed by Laskar and Pillone in 2000.     

Decay estimates of functions through singular extensions of vector-valued Laplace transforms

Let X be a Banach space and let f∈L^∞(R⁺;X) whose Laplace transform extends analytically to some region containing iR?{0}, possibly having a pole at the origin. In this paper, we give estimates of the decay of certain slight suitable modification of f in terms of the growth of its Laplace transform along the imaginary axis. This technique is applied to obtain decay estimates of smooth orbits of bounded C₀-semigroups whose infinitesimal generators have an arbitrary finite boundary spectrum. These results are close to those given recently by C.J.K. Batty and T. Duyckaerts.     

On certain spaces of vector measures of bounded variation

If (Σ,X) is a measurable space and X a Banach space we investigate the X-inheritance of copies of ?_∞ in certain subspaces Δ(Σ,X) of bvca(Σ,X), the Banach space of all X-valued countable additive measures of bounded variation equipped with the variation norm. Among the consequences of our main theorem we get a theorem of J. Mendoza on the X-inheritance of copies of ?_∞ in the Bochner space L₁(μ,X) and other of the author on the X-inheritance of copies of ?_∞ in bvca(Σ,X).     

Matrix refinement type equations

Taking advantage of perpetuities and the asymptotic behavior of products of random matrices we obtain the direct form of the Fourier transform of an L¹-solution of the following random matrix refinement type equation

f(x)=_∫Ω|detL(ω)|C(ω)f(L(ω)x-M(ω))P(dω),