Simple, expedient methods for the determination of water and electrolyte contents of cellulose solvent systems

The concentrations of water, W, and electrolytes present in solutions of LiCl in N,N-dimethylacetamide, LiCl/DMAc, and of tetrabutylammonium fluoride. x-hydrate in DMSO, TBAF.xW/DMSO can be accurately and expediently determined by three independent methods, UV–vis, FTIR and EMF measurement. The first relies on the use of solvatochromic probes whose spectra are sensitive to solution composition. It is applicable to W/LiCl/DMAc solutions but not to TBAF.xW/DMSO, because the charge-transfer complex bands of the probes are suppressed by strong interactions with the latter electrolyte. Integration of ν_OH band of water may be employed in order to determine [W], hence [electrolyte] by weight difference. EMF measurement uses ion-selective electrodes in order to determine [electrolyte], hence [W] by weight difference. Results of the latter method were in excellent agreement with those of FTIR. The reason for the failure of Karl Fischer titration is addressed, and the relevance of the results obtained to functionalization of cellulose under homogenous solution conditions is briefly commented on.     

Rehabilitation of the Gauss-Jordan algorithm

Summary In this paper a Gauss-Jordan algorithm with column interchanges is presented and analysed. We show that, in contrast with Gaussian elimination, the Gauss-Jordan algorithm has essentially differing properties when using column interchanges instead of row interchanges for improving the numerical stability. For solutions obtained by Gauss-Jordan with column interchanges, a more satisfactory bound for the residual norm can be given. The analysis gives theoretical evidence that the algorithm yields numerical solutions as good as those obtained by Gaussian elimination and that, in most practical situations, the residuals are equally small. This is confirmed by numerical experiments. Moreover, timing experiments on a Cyber 205 vector computer show that the algorithm presented has good vectorisation properties.     

Fibrations of bigroupoids

Using Brown's construction (J. Algebra 15 (1970) 103) of an exact 6-term sequence for a fibration of groupoids we show how an exact 9-term sequence can be associated to a fibration of bigroupoids. Applications to topology and algebra are given.     

Pentadiagonal Oscillatory Matrices with Two Spectrum in Common

We denote the spectrum of an square matrix A by σ(A), and that of the matrix obtained by deleting the first i rows and columns of A by σ_i(A). It is known that a symmetric pentadiagonal oscillatory (SPO) matrix may be constructed from σ, σ₁ and σ₂. The pairs σ, σ₁ and σ₁, σ₂ must interlace; the construction is not unique; and the conditions on the data which ensure that A is oscillatory are extremely complicated. Given one SPO matrix A, the paper shows that operations may be applied to A to construct a family of such matrices with σ and σ₁ in common. Moreover, given one totally positive (TP) matrix A, we construct a family of TP matrices with σ, σ₁ and σ₂ in common.     

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.     

Hamiltonian N2‐locally connected claw‐free graphs

A graph G is N₂‐locally connected if for every vertex ν in G, the edges not incident with ν but having at least one end adjacent to ν in G induce a connected graph. In 1990, Ryjá?ek conjectured that every 3‐connected N₂‐locally connected claw‐free graph is Hamiltonian. This conjecture is proved in this note. © 2004 Wiley Periodicals, Inc. J Graph Theory 48: 142–146, 2005     

A finiteness result for Heegaard splittings

In this paper we show that for a given 3-manifold and a given Heegaard splitting there are finitely many preferred decomposing systems of 3g−3 disjoint essential disks. These are characterized by a combinatorial criterion which is a slight strengthening of Casson-Gordon's rectangle condition. This is in contrast to fact that in general there can exist infinitely many such systems of disks which satisfy just the Casson-Gordon rectangle condition.     

Li3N、Mg3N2、Ca3N2催化作用的比较和分析

 Li₃N、Mg₃N₂和Ca₃N₂是高温高压下以hBN为原料合成cBN的催化剂。在实验中发现它们对常压高温下生成hBN的反应也表现出催化作用。对比了三种氮化物催化效果的差异，发现三种氮化物都只有在熔融状态下才能表现出催化效果，以及三种氮化物对生成hBN反应的催化效果与它们在高温高压下合成cBN反应的催化效果次序相似。提出了对合成hBN有催化作用的化合物也将对合成cBN表现出催化作用的观点。