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.     

Endomorphisms of the shift dynamical system, discrete derivatives, and applications

All continuous endomorphisms f_∞ of the shift dynamical system S on the 2-adic integers Z₂ are induced by some , where n is a positive integer, B_n is the set of n-blocks over {0, 1}, and f_∞(x)=y₀y₁y₂… where for all i∈N, y_i=f(x_ix_i+1…x_i+n−1). Define D:Z₂→Z₂ to be the endomorphism of S induced by the map {(00,0),(01,1),(10,1),(11,0)} and V:Z₂→Z₂ by V(x)=−1−x. We prove that D, V°D, S, and V°S are conjugate to S and are the only continuous endomorphisms of S whose parity vector function is solenoidal. We investigate the properties of D as a dynamical system, and use D to construct a conjugacy from the 3x+1 function T:Z₂→Z₂ to a parity-neutral dynamical system. We also construct a conjugacy R from D to T. We apply these results to establish that, in order to prove the 3x+1 conjecture, it suffices to show that for any m∈Z⁺, there exists some n∈N such that R⁻¹(m) has binary representation of the form or .     

On extension of isometries and approximate isometries between unit spheres

In this paper, we will study the isometric extension problem for L¹-spaces and prove that every surjective isometry from the unit sphere of L¹(μ) onto that of a Banach space E can be extended to a linear surjective isometry from L¹(μ) onto E. Moreover, we introduce the approximate isometric extension problem and show that, if E and F are Banach spaces and E satisfies the property (m) (special cases are L^∞(Γ), C₀(Ω) and L^∞(μ)), then every bijective ?-isometry between the unit spheres of E and F can be extended to a bijective 5?-isometry between their closed unit balls. At last, we will give an example to show that the surjectivity assumption cannot be omitted. Using this, we solve the non-surjective isometric extension problem in the negative.     

Numerical index of absolute sums of Banach spaces

We study the numerical index of absolute sums of Banach spaces, giving general conditions which imply that the numerical index of the sum is less or equal than the infimum of the numerical indices of the summands and we provide some examples where the equality holds covering the already known case of c₀-, ?₁- and ?_∞-sums and giving as a new result the case of E-sums where E has the RNP and n(E)=1 (in particular for finite-dimensional E with n(E)=1). We also show that the numerical index of a Banach space Z which contains a dense union of increasing one-complemented subspaces is greater or equal than the limit superior of the numerical indices of those subspaces. Using these results, we give a detailed short proof of the already known fact that, for a fixed p, the numerical indices of all infinite-dimensional Lp(μ)-spaces coincide.     

Domains of infinitesimal generators of automorphism flows

We present a systematic characterization of the domain of a generator of a one parameter group on certain C∗-subalgebras of via finite-dimensional estimates. Our approach yields an example of a densely defined closed symmetric derivation on a C∗-subalgebras of whose domain is not closed with respect to the C¹-functional calculus. This completes and complements the earlier example of McIntosh (J. Funct. Anal. 30 (1977) 264). Our methods are partly based on the theory of adjoint C₀-semigroups.     

A unique decomposition result for HT factors with torsion free core

We prove that II₁ factors M have a unique (up to unitary conjugacy) cross-product type decomposition around “core subfactors” N⊂M satisfying the property HT of [S. Popa, On a class of type II₁ factors with Betti numbers invariants, Ann. of Math. (2) 163 (2006) 809-899] and a certain “torsion freeness” condition. In particular, this shows that isomorphism of factors of the form Lαi(Z²)?Fni, i=1,2, for Fni⊂SL(2,Z) free groups of rank ni and αj=e2πitj, tj∉Q, implies n₁=n₂.     

Solution techniques for the Large Set Covering Problem

Given a finite set E and a family F={E₁,…,E_m} of subsets of E such that F covers E, the famous unicost set covering problem (USCP) is to determine the smallest possible subset of F that also covers E. We study in this paper a variant, called the Large Set Covering Problem (LSCP), which differs from the USCP in that E and the subsets E_i are not given in extension because they are very large sets that are possibly infinite. We propose three exact algorithms for solving the LSCP. Two of them determine minimal covers, while the third one produces minimum covers. Heuristic versions of these algorithms are also proposed and analysed. We then give several procedures for the computation of a lower bound on the minimum size of a cover. We finally present algorithms for finding the largest possible subset of F that does not cover E. We also show that a particular case of the LSCP is to determine irreducible infeasible sets in inconsistent constraint satisfaction problems. All concepts presented in the paper are illustrated on the k-colouring problem which is formulated as a constraint satisfaction problem.     

The hardness of approximating the boxicity, cubicity and threshold dimension of a graph

A k-dimensional box is the Cartesian product R₁×R₂×?×R_k where each R_i is a closed interval on the real line. The boxicity of a graph G, denoted as , is the minimum integer k such that G can be represented as the intersection graph of a collection of k-dimensional boxes. A unit cube in k-dimensional space or a k-cube is defined as the Cartesian product R₁×R₂×?×R_k where each R_i is a closed interval on the real line of the form [a_i,a_i+1]. The cubicity of G, denoted as , is the minimum integer k such that G can be represented as the intersection graph of a collection of k-cubes. The threshold dimension of a graph G(V,E) is the smallest integer k such that E can be covered by k threshold spanning subgraphs of G. In this paper we will show that there exists no polynomial-time algorithm for approximating the threshold dimension of a graph on n vertices with a factor of O(n^0.5−?) for any ?>0 unless NP=ZPP. From this result we will show that there exists no polynomial-time algorithm for approximating the boxicity and the cubicity of a graph on n vertices with factor O(n^0.5−?) for any ?>0 unless NP=ZPP. In fact all these hardness results hold even for a highly structured class of graphs, namely the split graphs. We will also show that it is NP-complete to determine whether a given split graph has boxicity at most 3.     

Least and most colored bases

Consider a matroid M=(E,B), where B denotes the family of bases of M, and assign a color c(e) to every element e∈E (the same color can go to more than one element). The palette of a subset F of E, denoted by c(F), is the image of F under c. Assume also that colors have prices (in the form of a function π(?), where ? is the label of a color), and define the chromatic price as: π(F)=∑_?∈c(F)π(?). We consider the following problem: find a base B∈B such that π(B) is minimum. We show that the greedy algorithm delivers a lnr(M)-approximation of the unknown optimal value, where r(M) is the rank of matroid M. By means of a reduction from SETCOVER, we prove that the lnr(M) ratio cannot be further improved, even in the special case of partition matroids, unless . The results apply to the special case where M is a graphic matroid and where the prices π(?) are restricted to be all equal. This special case was previously known as the minimum label spanning tree (MLST) problem. For the MLST, our results improve over the ln(n-1)+1 ratio achieved by Wan, Chen and Xu in 2002. Inspired by the generality of our results, we study the approximability of coloring problems with different objective function π(F), where F is a common independent set on matroids M₁,…,M_k and, more generally, to independent systems characterized by the k-for-1 property.     

The Rohlin property for automorphisms of the Jiang-Su algebra

For projectionless C^∗-algebras absorbing the Jiang-Su algebra tensorially, we study a kind of the Rohlin property for automorphisms. We show that the crossed products obtained by automorphisms with this Rohlin property also absorb the Jiang-Su algebra tensorially under a mild technical condition on the C^∗-algebras. In particular, for the Jiang-Su algebra we show the uniqueness up to outer conjugacy of the automorphism with this Rohlin property.     

On L-Tychonoff spaces II

This paper is a sequel to the 1995 paper On L-Tychonoff spaces. The embedding theorem for L-topological spaces is shown to hold true for L an arbitrary complete lattice without imposing any order reversing involution (·)^′ on L. Some results on completely L-regular spaces and on L-Tychonoff spaces, which have previously been known to hold true for (L,^′) a frame, are exhibited as ones holding for (L,^′) a meet-continuous lattice. For such a lattice an insertion theorem for completely L-regular spaces is given. Some weak forms of separating families of maps are discussed. We also clarify the dependence between the sub-T₀ separation axiom of Liu and the L-T₀ separation axiom of Rodabaugh.     

Workshop lecture on products of Fréchet spaces

The general question, “When is the product of Fréchet spaces Fréchet?” really depends on the questions of when a product of α₄ Fréchet spaces (also known as strongly Fréchet or countably bisequential spaces) is α₄, and when it is Fréchet. Two subclasses of the class of strongly Fréchet spaces shed much light on these questions. These are the class of α₃ Fréchet spaces and its subclass of ℵ₀-bisequential spaces. The latter is closed under countable products, the former not even under finite products. A number of fundamental results and open problems are recalled, some further highlighting the difference between being α₃ and Fréchet and being ℵ₀-bisequential.     

Noncommutative maximal ergodic theorems for positive contractions

Let M be a von Neumann algebra equipped with a normal semifinite faithful trace τ. Let T be a positive linear contraction on M such that τ○T?τ and such that the numerical range of T as an operator on L₂(M) is contained in a Stoltz region with vertex 1. We show that Junge and Xu's noncommutative Stein maximal ergodic inequality holds for the powers of T on Lp(M), 1<p?∞. We apply this result to obtain the noncommutative analogue of a recent result of Cohen concerning the iterates of the product of a finite number of conditional expectations.     

Bessel capacities on compact manifolds and their relation to Poisson capacities

A motivation for this paper comes from the role of Choquet capacities in the study of semilinear elliptic partial differential equations. In particular, the recent progress in the classification of all positive solutions of Lu=uα in a bounded smooth domain E⊂Rd was achieved by using, as a tool, capacities on a smooth manifold ∂E. Either the Poisson capacities (associated with the Poisson kernel in E) or the Bessel capacities (related to the Bessel kernel) have been used. In this and many other applications there is no advantage in choosing any special member in a class of equivalent capacities. (Two capacities are called equivalent if their ratio is bounded away from 0 and ∞.) In the literature Bessel capacities are considered mostly in the space Rd. We introduce two versions of Bessel capacities on a compact N-dimensional manifold. A class Cap?,p of equivalent capacities is defined, for ?p?N, on every compact Lipschitz manifold. Another class CB?,p is defined (for all ?>0, p>1) in terms of a diffusion process on a C²-manifold. These classes coincide when both are defined. If the manifold is the boundary of a bounded C²-domain E⊂Rd, then both versions of the Bessel capacities are equivalent to the Poisson capacities.     

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.     

Lim's theorems for multivalued mappings in CAT(0) spaces

Let X be a complete CAT(0) space. We prove that, if E is a nonempty bounded closed convex subset of X and a nonexpansive mapping satisfying the weakly inward condition, i.e., there exists p∈E such that ∀x∈E, ∀α∈[0,1], then T has a fixed point. In Banach spaces, this is a result of Lim [On asymptotic centers and fixed points of nonexpansive mappings, Canad. J. Math. 32 (1980) 421-430]. The related result for unbounded R-trees is given.     

Well-posedness of a class of perturbed optimization problems in Banach spaces

Let X be a Banach space and Z a nonempty subset of X. Let J:Z→R be a lower semicontinuous function bounded from below and p?1. This paper is concerned with the perturbed optimization problem of finding z₀∈Z such that ‖x−z₀p^‖+J(z₀)=infz∈Z{‖x−zp^‖+J(z)}, which is denoted by minJ(x,Z). The notions of the J-strictly convex with respect to Z and of the Kadec with respect to Z are introduced and used in the present paper. It is proved that if X is a Kadec Banach space with respect to Z and Z is a closed relatively boundedly weakly compact subset, then the set of all x∈X for which every minimizing sequence of the problem minJ(x,Z) has a converging subsequence is a dense Gδ-subset of X?Z₀, where Z₀ is the set of all points z∈Z such that z is a solution of the problem minJ(z,Z). If additionally p>1 and X is J-strictly convex with respect to Z, then the set of all x∈X for which the problem minJ(x,Z) is well-posed is a dense Gδ-subset of X?Z₀.     

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     

Approximating tensor product Bézier surfaces with tangent plane continuity

We present a simple method for degree reduction of tensor product Bézier surfaces with tangent plane continuity in L₂-norm. Continuity constraints at the four corners of surfaces are considered, so that the boundary curves preserve endpoints continuity of any order α. We obtain matrix representations for the control points of the degree reduced surfaces by the least-squares method. A simple optimization scheme that minimizes the perturbations of some related control points is proposed, and the surface patches after adjustment are C^∞ continuous in the interior and G¹ continuous at the common boundaries. We show that this scheme is applicable to surface patches defined on chessboard-like domains.