Covalent functionalization of multi-walled carbon nanotubes by lipase

Lipase from Candida rugosa was covalently anchored onto acid-treated multi-walled carbon nanotubes (MWNTs) through a self-catalytic mechanism. A variety of characterization techniques including FTIR, Raman spectroscopy, and XPS were employed to demonstrate the formation of the ester linkage between lipase and MWNTs. The MWNTs-lipase biocomposites showed significantly increased solubility in some common-used organic solvents, such as THF, DMF and chloroform. This study may offer a novel and facile route for covalent modification of carbon nanotubes, and expand the potential utilization of both lipases and MWNTs in the fields of biocatalyst and biosensor.     

Nonnegative curvature and cobordism type

We show that in each dimension n = 4k, k≥ 2, there exist infinite sequences of closed simply connected Riemannian n-manifolds with nonnegative sectional curvature and mutually distinct oriented cobordism type. W. Tuschmann’s research was supported in part by a DFG Heisenberg Fellowship.     

Dihedral crossed products of exponent 2 are abelian

We prove that assuming enough roots of unity in the base field, a central simple algebra of exponent 2 which is split by a dihedral group, is also split by certain abelian groups.     

Confidence regions in a multivariate regression model with constraints II

The multivariate model, where not only parameters of the mean value of the observation matrix, but also some other parameters occur in constraints, is considered in the paper. Some basic inference is presented under the condition that the covariance matrix is either unknown, or partially unknown, or known. Supported by the grant of the Council of Czech Republic MSM 6 198 959 214.     

A Spherical Decomposition for Riemannian Open 3-Manifolds

We show that open 3-manifolds that have a locally finite decomposition along 2-spheres are characterized by the existence of a Riemannian metric with respect to which the second homotopy group of the manifold is generated by small elements. Received: November 2005 Revision: February 2006 Accepted: May 2006     

Lagrangian skeletons,periodic geodesic flows and symplectic cuttings

In this paper, we investigate symplectic manifolds endowed with a Morse–Bott function with only two critical submanifolds, one of which is Lagrangian while the other one is symplectic.     

Prime Fano threefolds and integrable systems

For a general K3 surface S of genus g, with 2 ≤ g ≤ 10, we prove that the intermediate Jacobians of the family of prime Fano threefolds of genus g containing S as a hyperplane section, form generically an algebraic completely integrable Hamiltonian system. The first author is partially supported by grant MI1503/2005 of the Bulgarian Foundation for Scientific Research.     

Primes in quadratic progressions on average

In this paper, we establish a theorem on the distribution of primes in quadratic progressions on average.     

On a free group of transformations defined by an automaton

We prove that three automorphisms of the rooted binary tree defined by a certain 3-state automaton generate a free non-Abelian group of rank 3. Both authors are supported by the NSF grants DMS-0308985 and DMS-0456185. Yaroslav Vorobets is supported by a Clay Research Scholarship.     

A local search approach to a circle cutting problem arising in the motor cycle industry

This paper is concerned with the development of a customized circle packing algorithm for a manufacturer of sprockets for the motor cycle industry. Practical constraints mean that the problem differs somewhat from those tackled elsewhere in the literature. In particular, the layouts need to conform to a given structure. This is achieved by using a local search algorithm with an appropriate starting solution and a series of neighbourhoods designed to preserve the layout structure. Empirical evidence based on real data shows that the quality of the resulting solutions closely matches that of cutting patterns currently produced by human experts. Computation times average around 20–30?s per order as compared to several hours for an equivalent manual solution.