On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance

The graph-theoretic operation of rooted subtree prune and regraft is increasingly being used as a tool for understanding and modelling reticulation events in evolutionary biology. In this paper, we show that computing the rooted subtree prune and regraft distance between two rooted binary phylogenetic trees on the same label set is NP-hard. This resolves a longstanding open problem. Furthermore, we show that this distance is fixed parameter tractable when parameterised by the distance between the two trees.Received March 16, 2004     

Cochran's statistical theorem for outer inverses of matrices and matrix quadratic forms

We extend the matrix version of Cochran's statistical theorem to outer inverses of a matrix. As applications, we investigate the Wishartness and independence of matrix quadratic forms for Kronecker product covariance structures.     

More on Kleinewillinghöfer Types of Flat Laguerre Planes

Polster and Steinke [Result. Math., 46 (2004), 103–122] determined the possible Kleinewillingh?fer types of flat Laguerre planes. These types reflect transitivity properties of groups of certain central automorphisms. We exclude three more types from the list given there with respect to Laguerre homotheties. This yields a complete determination of all possible single types with respect to Laguerre homotheties that can occur in flat Laguerre planes. Building on results by M?urer and Hartmann to characterize ovoidal or miquelian Laguerre planes we further characterize certain flat Laguerre planes in terms of their Kleinewillingh?fer types. Received: January 16, 2007. Revised: July 26, 2007.     

Expected Reflection Distance in G(r, 1, n) after a Fixed Number of Reflections

Extending to r > 1 a formula of the authors, we compute the expected reflection distance of a product of t random reflections in the complex reflection group G(r, 1, n). The result relies on an explicit decomposition of the reflection distance function into irreducible G(r, 1, n)-characters and on the eigenvalues of certain adjacency matrices.Received December 8, 2003     

Synthesis under Micromave Irradition and Crystal Structure of 4''-Acetylbenzo-15 -crown-5thiosemicarbazone

The title compound is a bifunctional receptors including a thiourea group and a crown ether ring. Due to many possible potentials as a new class of reagents for membrane transports,ion-selective electrodes as well as reaction catalysts, the design and synthesis of bifunctional receptors for simultaneous binding of cations and anions is of ongoning interest in srprarnolecular chemistry1-5. In bifunctional receptors, the binding sites for anions and cations are covalently linked so as to exhibit allosteric or cooperative complexation where the binding affinity for anions(cations)is modified as a result of the cation(anion) complexation.Literature[6] reported that the ability of the thiourea group to bind anions is significantly enhanced when Na+ is bound to the crown moiety. To date, however only a few receptors of this class have been reported.6-8In this paper, we report an improved procedure under microwave irradiation that gives higher yields of title compound and needs fewer reaction times than traditional method.The structure of this compound was determined by IR ,element analysis and X-ray analysis.Scheme 1 The reaction equationThe crystal belongs to triclinic crystal system, P-1 space group, a=0.9547(0)nm, b=1.3637(3)nm,c=1.6029(3)nm, α =75.33(3) , β =83.62(3) , γ =70.99(3) ,Z=4,Dc=1.335g/cm3,F(000)=816,R1= 0.0557 ,wR2=0.1281. It is assembled into a three-dimensionalsupramolecule by intermolecular hydrogen bonds.     

On the recognition problem of quasi-homogeneous locally nilpotent derivations in dimension three

We give a criterion to decide if a given w-homogeneous derivation on A?k[X₁,X₂,X₃] is locally nilpotent. We deduce an algorithm which decides if a k-subalgebra of A, which is finitely generated by w-homogeneous elements, is the kernel of some locally nilpotent derivation.     

Contact hypersurfaces of Kaehler manifolds

Contact hypersurfaces of a Kaehler manifold have been characterized and classified, assuming the second fundamental form to be Codazzi (in particular, parallel). We have also discussed the special cases when the ambient space is a (i) Calabi-Yau manifold and (ii) a complex space-form.     

A real algorithm for the Hermitian eigenvalue decomposition

Modifying complex plane rotations, we derive a new Jacobi-type algorithm for the Hermitian eigendecomposition, which uses only real arithmetic. When the fast-scaled rotations are incorporated, the new algorithm brings a substantial reduction in computational costs. The new method has the same convergence properties and parallelism as the symmetric Jacobi algorithm. Computational test results show that it produces accurate eigenvalues and eigenvectors and achieves great reduction in computational time.The work of this author was supported in part by the National Science Foundation grant CCR-8813493 and by the University of Minnesota Army High Performance Computing Research Center contract DAAL 03-89-C-0038.The work of this author was supported in part by the University of Minnesota Army High Performance Computing Research Center contract DAAL 03-89-C-0038.