The intersection of left (right) spectra of 2 × 2 upper triangular operator matrices

When A∈B(H) and B∈B(K) are given, we denote by M_C the operator matrix acting on the infinite-dimensional separable Hilbert space H⊕K of the form In this paper, for given A and B, the sets and ?_C∈Inv(K,H)σ_l(M_C) are determined, where σ_l(T),B_l(K,H) and Inv(K,H) denote, respectively, the left spectrum of an operator T, the set of all the left invertible operators and the set of all the invertible operators from K into H.     

Operators on the space of vector-valued totally measurable functions

Let L(X,Y) stand for the space of all bounded linear operators between real Banach spaces X and Y, and let Σ be a σ-algebra of sets. A bounded linear operator T from the Banach space B(Σ,X) of X-valued Σ-totally measurable functions to Y is said to be σ-smooth if ‖T(fn)Y_‖→0 whenever a sequence of scalar functions (‖fn(⋅)X_‖) is order convergent to 0 in B(Σ). It is shown that a bounded linear operator is σ-smooth if and only if its representing measure is variationally semi-regular, i.e., as An↓∅ (here stands for the semivariation of m on A∈Σ). As an application, we show that the space Lσs(B(Σ,X),Y) of all σ-smooth operators from B(Σ,X) to Y provided with the strong operator topology is sequentially complete. We derive a Banach-Steinhaus type theorem for σ-smooth operators from B(Σ,X) to Y. Moreover, we characterize countable additivity of measures in terms of continuity of the corresponding operators .     

A generalization of Barbashin-Krasovski theorem

The classical criterion of asymptotic stability of the zero solution of equations x^′=f(t,x) is that there exists a function V(t,x), a(‖x‖)?V(t,x)?b(‖x‖) for some a,b∈K, such that for some c∈K. In this paper we prove that if f(t,x) is bounded, is uniformly continuous and bounded, then the condition that can be weakened and replaced by and contains no complete trajectory of , t∈[−T,T], where , uniformly for (t,x)∈[−T,T]×BH.     

On the Roman domination number of a graph

A Roman dominating function of a graph G is a labeling f:V(G)?{0,1,2} such that every vertex with label 0 has a neighbor with label 2. The Roman domination number γ_R(G) of G is the minimum of ∑_v∈V(G)f(v) over such functions. A Roman dominating function of G of weight γ_R(G) is called a γ_R(G)-function. A Roman dominating function f:V?{0,1,2} can be represented by the ordered partition (V₀,V₁,V₂) of V, where V_i={v∈V∣f(v)=i}. Cockayne et al. [E.J. Cockayne, P.A. Dreyer, S.M. Hedetniemi, S.T. Hedetniemi, On Roman domination in graphs, Discrete Math. 278 (2004) 11-22] posed the following question: What can we say about the minimum and maximum values of |V₀|,|V₁|,|V₂| for a γ_R-function f=(V₀,V₁,V₂) of a graph G? In this paper we first show that for any connected graph G of order n≥3, , where γ(G) is the domination number of G. Also we prove that for any γ_R-function f=(V₀,V₁,V₂) of a connected graph G of order n≥3, , and .     

Phase transition on Exel crossed products associated to dilation matrices

An integer matrix A∈Md(Z) induces a covering σA of Td and an endomorphism αA:f?f°σA of C(Td) for which there is a natural transfer operator L. In this paper, we compute the KMS states on the Exel crossed product C(Td)_?αA,LN and its Toeplitz extension. We find that C(Td)_?αA,LN has a unique KMS state, which has inverse temperature . Its Toeplitz extension, on the other hand, exhibits a phase transition at , and for larger β the simplex of KMSβ states is isomorphic to the simplex of probability measures on Td.     

Continuous spectrum, point spectrum and residual spectrum of operator matrices

Let M_C denote a 2 × 2 upper triangular operator matrix of the form , which is acting on the sum of Banach spaces X⊕Y or Hilbert spaces H⊕K. In this paper, the sets and ?_C∈B(K,H)σ_r(M_C) are, respectively, characterized completely, where σ_c(·) denotes the continuous spectrum, σ_p(·) denotes the point spectrum and σ_r(·) denotes the residual spectrum. Moreover, some corresponding counterexamples are given.     

Explicit formulas for Laplace transforms of certain functionals of some time inhomogeneous diffusions

We consider a process given by the SDE , t∈[0,T), with initial condition , where T∈(0,∞], α∈R, (Bt)_t∈[0,T) is a standard Wiener process, b:[0,T)→R?{0} and σ:[0,T)→(0,∞) are continuously differentiable functions. Assuming , t∈[0,T), with some K∈R, we derive an explicit formula for the joint Laplace transform of and for all t∈[0,T) and for all α∈R. Our motivation is that the maximum likelihood estimator (MLE) of α can be expressed in terms of these random variables. As an application, we show that in case of α=K, K≠0,

     

A Chebysheff recursion formula for Coxeter polynomials

A polynomial f(T)∈Z[T] is represented by q(T)∈Z[T] if ; f(T) is graphically represented if for χ_M(T) the characteristic polynomial of a symmetric matrix M. Many instances of Coxeter polynomialsf_A(T), for A a finite dimensional algebra, are (graphically) representable. We study the case of extended canonical algebras A, see [H. Lenzing, J.A. de la Peña, Extended canonical algebras and Fuchsian singularities, in press], show that the corresponding polynomials f_A(T) are representable and satisfy a Chebysheff type recursion formula. We get consequences for the eigenvalues of the Coxeter transformation of A showing, for instance, that at most four eigenvalues may lie outside the unit circle.     

Galois closure of essentially finite morphisms

Let X be a reduced connected k-scheme pointed at a rational point x∈X(k). By using tannakian techniques we construct the Galois closure of an essentially finite k-morphism f:Y→X satisfying the condition H⁰(Y,O_Y)=k; this Galois closure is a torsor dominating f by an X-morphism and universal for this property. Moreover, we show that is a torsor under some finite group scheme we describe. Furthermore we prove that the direct image of an essentially finite vector bundle over Y is still an essentially finite vector bundle over X. We develop for torsors and essentially finite morphisms a Galois correspondence similar to the usual one. As an application we show that for any pointed torsor f:Y→X under a finite group scheme satisfying the condition H⁰(Y,O_Y)=k, Y has a fundamental group scheme π₁(Y,y) fitting in a short exact sequence with π₁(X,x).     

Rainbow domination on trees

This paper studies a variation of domination in graphs called rainbow domination. For a positive integer k, a k-rainbow dominating function of a graph G is a function f from V(G) to the set of all subsets of {1,2,…,k} such that for any vertex v with f(v)=0? we have ∪_u∈NG(v)f(u)={1,2,…,k}. The 1-rainbow domination is the same as the ordinary domination. The k-rainbow domination problem is to determine the k-rainbow domination number of a graph G, that is the minimum value of ∑_v∈V(G)|f(v)| where f runs over all k-rainbow dominating functions of G. In this paper, we prove that the k-rainbow domination problem is NP-complete even when restricted to chordal graphs or bipartite graphs. We then give a linear-time algorithm for the k-rainbow domination problem on trees. For a given tree T, we also determine the smallest k such that .     

The non-analytic growth bound of a C0-semigroup and inhomogeneous Cauchy problems

The non-analytic growth bound ζ(T) of a C₀-semigroup T measures the extent to which T can be approximated by a holomorphic function, and it is related to spectral properties of the generator A in regions of far from the real axis. We show that ζ(T) can be characterised by means of Fourier multiplier properties of the resolvent of A far from the real axis, and also by existence and uniqueness of mild solutions of inhomogeneous Cauchy problems of the form u′(t)=Au(t)+f(t) on where the Carleman spectra of f and u are far from the origin. The corresponding results for the exponential growth bound ω₀(T) have been established earlier by other authors.     

Strong and A-statistical comparisons for sequences

Let T and A be two nonnegative regular summability matrices and W(T,p)∩l^∞ and c_A(b) denote the spaces of all bounded strongly T-summable sequences with index p>0, and bounded summability domain of A, respectively. In this paper we show, among other things, that is a multiplier from W(T,p)∩l^∞ into c_A(b) if and only if any subset K of positive integers that has T-density zero implies that K has A-density zero. These results are used to characterize the A-statistical comparisons for both bounded as well as arbitrary sequences. Using the concept of A-statistical Tauberian rate, we also show that is not a multiplier from W(T,p)∩l^∞ into c_A(b) that leads to a Steinhaus type result.     

On the Laplacian spectral radii of trees

Let Δ(T) and μ(T) denote the maximum degree and the Laplacian spectral radius of a tree T, respectively. Let T_n be the set of trees on n vertices, and . In this paper, we determine the two trees which take the first two largest values of μ(T) of the trees T in when . And among the trees in , the tree which alone minimizes the Laplacian spectral radius is characterized. We also prove that for two trees T₁ and T₂ in , if Δ(T₁)>Δ(T₂) and , then μ(T₁)>μ(T₂). As an application of these results, we give a general approach about extending the known ordering of trees in T_n by their Laplacian spectral radii.     

Colouring games on outerplanar graphs and trees

Let f be a graph function which assigns to each graph H a non-negative integer f(H)≤|V(H)|. The f-game chromatic number of a graph G is defined through a two-person game. Let X be a set of colours. Two players, Alice and Bob, take turns colouring the vertices of G with colours from X. A partial colouring c of G is legal (with respect to graph function f) if for any subgraph H of G, the sum of the number of colours used in H and the number of uncoloured vertices of H is at least f(H). Both Alice and Bob must colour legally (i.e., the partial colouring produced needs to be legal). The game ends if either all the vertices are coloured or there are uncoloured vertices with no legal colour. In the former case, Alice wins the game. In the latter case, Bob wins the game. The f-game chromatic number of G, χ_g(f,G), is the least number of colours that the colour set X needs to contain so that Alice has a winning strategy. Let be the graph function defined as , for any n≥3 and otherwise. Then is called the acyclic game chromatic number of G. In this paper, we prove that any outerplanar graph G has acyclic game chromatic number at most 7. For any integer k, let ?_k be the graph function defined as ?_k(K₂)=2 and ?_k(P_k)=3 (P_k is the path on k vertices) and ?_k(H)=0 otherwise. This paper proves that if k≥8 then for any tree T, χ_g(?_k,T)≤9. On the other hand, if k≤6, then for any integer n, there is a tree T such that χ_g(?_k,T)≥n.