On the topology of the Kasparov groups and its applications

In this paper we establish a direct connection between stable approximate unitary equivalence for *-homomorphisms and the topology of the KK-groups which avoids entirely C^*-algebra extension theory and does not require nuclearity assumptions. To this purpose we show that a topology on the Kasparov groups can be defined in terms of approximate unitary equivalence for Cuntz pairs and that this topology coincides with both Pimsner's topology and the Brown-Salinas topology. We study the generalized Rørdam group , and prove that if a separable exact residually finite dimensional C^*-algebra satisfies the universal coefficient theorem in KK-theory, then it embeds in the UHF algebra of type 2^∞. In particular such an embedding exists for the C^*-algebra of a second countable amenable locally compact maximally almost periodic group.     

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.     

Realizations of AF-algebras as graph algebras, Exel-Laca algebras, and ultragraph algebras

We give various necessary and sufficient conditions for an AF-algebra to be isomorphic to a graph C^∗-algebra, an Exel-Laca algebra, and an ultragraph C^∗-algebra. We also explore consequences of these results. In particular, we show that all stable AF-algebras are both graph C^∗-algebras and Exel-Laca algebras, and that all simple AF-algebras are either graph C^∗-algebras or Exel-Laca algebras. In addition, we obtain a characterization of AF-algebras that are isomorphic to the C^∗-algebra of a row-finite graph with no sinks.     

Further improved recursions for a class of compound Poisson distributions

In the present paper we develop more efficient recursive formulae for the evaluation of the t-order cumulative function Γ^th(x) and the t-order tail probability Λ^th(x) of the class of compound Poisson distributions in the case where the derivative of the probability generating function of the claim amounts can be written as a ratio of two polynomials. These efficient recursions can be applied for the exact evaluation of the probability function (given by De Pril [De Pril, N., 1986a. Improved recursions for some compound Poisson distributions. Insurance Math. Econom. 5, 129-132]), distribution function, tail probability, stop-loss premiums and t-order moments of stop-loss transforms of compound Poisson distributions. Also, efficient recursive algorithms are given for the evaluation of higher-order moments and r-order factorial moments about any point for this class of compound Poisson distributions. Finally, several examples of discrete claim size distributions belonging to this class are also given.     

Hardy spaces for the strip

In this paper we shall study Hardy spaces of analytic functions in a strip S. Our main result is on one hand an intrinsic characterization of the spaces and on the second that polynomials are dense. We also present an orthogonal (in H²(S)) basis of polynomials.     

Decomposition rank and absorbing extensions of type I algebras

We prove the following: Let A and B be separable C^*-algebras. Suppose that B is a type I C^*-algebra such that

(i)

B has only infinite dimensional irreducible *-representations, and

(ii)

B has finite decomposition rank.

If

0→B→C→A→0     

Optimization and sensitivity analysis of controlling arrivals in the queueing system with single working vacation

This paper analyzes the F-policy M/M/1/K queueing system with working vacation and an exponential startup time. The F-policy deals with the issue of controlling arrivals to a queueing system, and the server requires a startup time before allowing customers to enter the system. For the queueing systems with working vacation, the server can still provide service to customers rather than completely stop the service during a vacation period. The matrix-analytic method is applied to develop the steady-state probabilities, and then obtain several system characteristics. We construct the expected cost function and formulate an optimization problem to find the minimum cost. The direct search method and Quasi-Newton method are implemented to determine the optimal system capacity K, the optimal threshold F and the optimal service rates (μ_B,μ_V) at the minimum cost. A sensitivity analysis is conducted to investigate the effect of changes in the system parameters on the expected cost function. Finally, numerical examples are provided for illustration purpose.     

On Tutte polynomial uniqueness of twisted wheels

A graph G is called T-unique if any other graph having the same Tutte polynomial as G is isomorphic to G. Recently, there has been much interest in determining T-unique graphs and matroids. For example, de Mier and Noy [A. de Mier, M. Noy, On graphs determined by their Tutte polynomials, Graphs Combin. 20 (2004) 105-119; A. de Mier, M. Noy, Tutte uniqueness of line graphs, Discrete Math. 301 (2005) 57-65] showed that wheels, ladders, Möbius ladders, square of cycles, hypercubes, and certain class of line graphs are all T-unique. In this paper, we prove that the twisted wheels are also T-unique.     

Separable states and positive maps

Using the natural duality between linear functionals on tensor products of C^∗-algebras with the trace class operators on a Hilbert space H and linear maps of the C^∗-algebra into B(H), we study the relationship between separability, entanglement and the Peres condition of states and positivity properties of the linear maps.     

The H-covariant strong Picard groupoid

The notion of H-covariant strong Morita equivalence is introduced for ^*-algebras over C=R(i) with an ordered ring R which are equipped with a ^*-action of a Hopf ^*-algebra H. This defines a corresponding H-covariant strong Picard groupoid which encodes the entire Morita theory. Dropping the positivity conditions one obtains H-covariant ^*-Morita equivalence with its H-covariant ^*-Picard groupoid. We discuss various groupoid morphisms between the corresponding notions of the Picard groupoids. Moreover, we realize several Morita invariants in this context as arising from actions of the H-covariant strong Picard groupoid. Crossed products and their Morita theory are investigated using a groupoid morphism from the H-covariant strong Picard groupoid into the strong Picard groupoid of the crossed products.     

A functional characterization of measures and the Banach-Ulam problem

For a measurable space (Ω,A), let ?_∞(A) be the closure of span{χA:A∈A} in ?_∞(Ω). In this paper we show that a sufficient and necessary condition for a real-valued finitely additive measure μ on (Ω,A) to be countably additive is that the corresponding functional ?μ defined by (for x∈?_∞(A)) is w^*-sequentially continuous. With help of the Yosida-Hewitt decomposition theorem of finitely additive measures, we show consequently that every continuous functional on ?_∞(A) can be uniquely decomposed into the ?₁-sum of a w^*-continuous functional, a purely w^*-sequentially continuous functional and a purely (strongly) continuous functional. Moreover, several applications of the results to measure extension are given.     

Existence of r-self-orthogonal Latin squares

Two Latin squares of order v are r-orthogonal if their superposition produces exactly r distinct ordered pairs. If the second square is the transpose of the first one, we say that the first square is r-self-orthogonal, denoted by r-SOLS(v). It has been proved that for any integer v?28, there exists an r-SOLS(v) if and only if v?r?v² and r∉{v+1,v²-1}. In this paper, we give an almost complete solution for the existence of r-self-orthogonal Latin squares.     

Multicyclicity of unbounded normal operators and polynomial approximation in C

A remarkable and much cited result of Bram [J. Bram, Subnormal operators, Duke Math. J. 22 (1955) 75-94] shows that a star-cyclic bounded normal operator in a separable Hilbert space has a cyclic vector. If, in addition, the operator is multiplication by the variable in a space L²(m) (not only unitarily equivalent to it), then it has a cyclic vector in L^∞(m). We extend Bram's result to the case of a general unbounded normal operator, implying by this that the (classical) multiplicity and the multicyclicity of the operator (cf. [N.K. Nikolski, Operators, Functions and Systems: An Easy Reading, vol. 2, Math. Surveys Monogr., vol. 93, Amer. Math. Soc., Providence, 2002]) coincide. It follows that if m is a sigma-finite Borel measure on C (possibly with noncompact support), then there is a nonnegative finite Borel measure τ equivalent to m and such that L²(C,τ) is the norm-closure of the polynomials in z.     

Remark on uniqueness of mild solutions to the Navier-Stokes equations

We investigate a limiting uniqueness criterion to the Navier-Stokes equations. We prove that the mild solution is unique under the class , where bmo^-1 is the “critical” space including Lⁿ. As an application of uniqueness theorem, we also consider the local well-posedness of Navier-Stokes equations in bmo^-1.     

The higher fixed point theorem for foliations I. Holonomy invariant currents

In this paper, we prove a higher Lefschetz formula for foliations in the presence of a closed Haefliger current. To this end, we associate with such a current an equivariant cyclic cohomology class of Connes' C^∗-algebra of the foliation, and compute its pairing with the localized equivariant K-theory in terms of local contributions near the fixed points.     

Super-simple, pan-orientable and pan-decomposable GDDs with block size 4

In this paper we study (4,2μ)-GDDs of type gⁿ possessing both the pan-decomposable property introduced by Granville, Moisiadis, Rees, On complementary decompositions of the complete graph, Graphs and Combinatorics 5 (1989) 57-61 and the pan-orientable property introduced by Grüttmüller, Hartmann, Pan-orientable block designs, Australas. J. Combin. 40 (2008) 57-68. We show that the necessary condition for a (4,2μ)-GDD satisfying both of these properties, namely (1) n≥4, μg(n−1)≡0 (mod 3), and (2) g−1,n are not both even if μ is odd are sufficient. When λ=2, our designs are super-simple.We also determine the spectrum of (4,2)-GDDs which are super-simple and possess some of the decomposable/orientable conditions, but are not pan-decomposable or pan-orientable. In particular, we show that the necessary conditions for a super-simple directable (4,2)-GDD of type gⁿ are sufficient.     

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.     

Local regularity theorems for the stationary thermistor problem with oscillating degeneracy

In this paper we present some regularity results for solutions to the system −Δu=σ(u)²|∇φ|, div(σ(u)∇φ)=0 in the case where σ(u) is allowed to oscillate between 0 and a positive number as u→∞. In particular, we show that u is locally bounded if σ(u) is bounded below by a suitable exponential function.