Partitioning graphs into complete and empty graphs

Given integers j and k and a graph G, we consider partitions of the vertex set of G into j+k parts where j of these parts induce empty graphs and the remaining k induce cliques. If such a partition exists, we say G is a (j,k)-graph. For a fixed j and k we consider the maximum order n where every graph of order n is a (j,k)-graph. The split-chromatic number of G is the minimum j where G is a (j,j)-graph. Further, the cochromatic number is the minimum j+k where G is a (j,k)-graph. We examine some relations between cochromatic, split-chromatic and chromatic numbers. We also consider some computational questions related to chordal graphs and cographs.     

A Morita theorem for dual operator algebras

We prove that two dual operator algebras are weak^∗ Morita equivalent in the sense of [D.P. Blecher, U. Kashyap, Morita equivalence of dual operator algebras, J. Pure Appl. Algebra 212 (2008) 2401-2412] if and only if they have equivalent categories of dual operator modules via completely contractive functors which are also weak^∗-continuous on appropriate morphism spaces. Moreover, in a fashion similar to the operator algebra case, we characterize such functors as the module normal Haagerup tensor product with an appropriate weak^∗ Morita equivalence bimodule. We also develop the theory of the W^∗-dilation, which connects the non-selfadjoint dual operator algebra with the W^∗-algebraic framework. In the case of weak^∗ Morita equivalence, this W^∗-dilation is a W^∗-module over a von Neumann algebra generated by the non-selfadjoint dual operator algebra. The theory of the W^∗-dilation is a key part of the proof of our main theorem.     

Decomposing the essential spectrum

We use C^*-algebra theory to provide a new method of decomposing the essential spectra of self-adjoint and non-self-adjoint Schrödinger operators in one or more space dimensions.     

Approximate and pseudo-amenability of various classes of Banach algebras

We continue the investigation of notions of approximate amenability that were introduced in work of the second and third authors together with R.J. Loy. It is shown that every boundedly approximately contractible Banach algebra has a bounded approximate identity, and that the Fourier algebra of the free group on two generators is not operator approximately amenable. Further examples are obtained of ?¹-semigroup algebras which are approximately amenable but not amenable; using these, we show that bounded approximate contractibility need not imply sequential approximate amenability. Results are also given for Segal algebras on locally compact groups, and algebras of p-pseudo-functions on discrete groups.     

Radial rapid decay property for cocompact lattices

We study Haagerup inequality for radial functions on uniform lattices in semisimple Lie groups, with respect to Riemannian metrics and, in some case, to word metrics. In particular we extend the Swiatkowski-Valette results to any lattice acting properly and essentially transitively on classical buildings.     

Uniqueness results for nonlocal Hamilton-Jacobi equations

We are interested in nonlocal eikonal equations describing the evolution of interfaces moving with a nonlocal, non-monotone velocity. For these equations, only the existence of global-in-time weak solutions is available in some particular cases. In this paper, we propose a new approach for proving uniqueness of the solution when the front is expanding. This approach simplifies and extends existing results for dislocation dynamics. It also provides the first uniqueness result for a Fitzhugh-Nagumo system. The key ingredients are some new perimeter estimates for the evolving fronts as well as some uniform interior cone property for these fronts.     

Saturated packings and reduced coverings obtained by perturbing tilings

Let a normed space X possess a tiling T consisting of unit balls. We show that any packing P of X obtained by a small perturbation of T is completely translatively saturated; that is, one cannot replace finitely many elements of P by a larger number of unit balls such that the resulting arrangement is still a packing.In contrast with that, given a tiling T of Rⁿ with images of a convex body C under Euclidean isometries, there may exist packings P consisting of isometric images of C obtained from T by arbitrarily small perturbations which are no longer completely saturated. This means that there exists some positive integer k such that one can replace k−1 members of P by k isometric copies of C without violating the packing property. However, we quantify a tradeoff between the size of the perturbation and the minimal k such that the above phenomenon occurs.Analogous results are obtained for coverings.     

On a deterministic linear partial differential system

We develop an Lp theory for the Cauchy problem of linear partial differential systems of the form

     

Multiplicity of characteristics with Lagrangian boundary values on symmetric star-shaped hypersurfaces

In this paper, the multiplicity of Lagrangian orbits on C² smooth compact symmetric star-shaped hypersurfaces with respect to the origin in R2n is studied. These Lagrangian orbits begin from one Lagrangian subspace and end on another. An infinitely many existence result is proved via Z₂-index theory. This is a multiplicity result about the Arnold Chord Conjecture in some sense, and is a generalization of the problem about the multiplicity of Lagrangian orbits beginning from and ending on the same Lagrangian subspace which was considered in the authors' previous paper [F. Guo, C. Liu, Multiplicity of Lagrangian orbits on symmetric star-shaped hypersurfaces, Nonlinear Anal. 69 (4) (2008) 1425-1436].     

A combinatorial sample-preparation robot system using the volumetric-weighing method

We have developed a new automatic sample-preparation robot system with use of the volumetric-weighing method. In this system, slurries, aqueous solutions, and other wet reagents are employed as starting materials and 64 (8×8) samples at the maximum are prepared on a library plate of 35 mm × 35 mm size. Volumetric-weighing and mixing of the starting materials and distributing reaction mixtures to the library plate are automatically performed by computer-controlled mechanisms with an easy-to-use programming software interface. While this robot is designed in terms of space saving and portability, it is able to equip with an atmosphere-controlled furnace to sinter the samples on the library plate. Typical preparation time for a library plate of 36 (6×6) samples is less than 40 min. This robot system is promising in enhancing throughput of wet-chemically synthesized materials researches.