An empirical model predicting the viscosity of highly concentrated, bimodal dispersions with colloidal interactions

The relationship between particle size distribution and viscosity of concentrated dispersions is of great industrial importance, since it is the key to get high solids dispersions or suspensions. The problem is treated here experimentally as well as theoretically for the special case of strongly interacting colloidal particles. An empirical model based on a generalized Quemada equation is used to describe η as a function of volume fraction for mono- as well as multimodal dispersions. The pre-factor η˜ accounts for the shear rate dependence of η and does not affect the shape of the η vs φ curves. It is shown here for the first time that colloidal interactions do not show up in the maximum packing parameter and φ_max can be calculated from the particle size distribution without further knowledge of the interactions among the suspended particles. On the other hand, the exponent ɛ is controlled by the interactions among the particles. Starting from a limiting value of 2 for non-interacting either colloidal or non-colloidal particles, ɛ generally increases strongly with decreasing particle size. For a given particle system it then can be expressed as a function of the number average particle diameter. As a consequence, the viscosity of bimodal dispersions varies not only with the size ratio of large to small particles, but also depends on the absolute particle size going through a minimum as the size ratio increases. Furthermore, the well-known viscosity minimum for bimodal dispersions with volumetric mixing ratios of around 30/70 of small to large particles is shown to vanish if colloidal interactions contribute significantly. Received: 7 June 2000/Accepted: 12 February 2001     

Enantioselective Sulfoxidations Catalyzedby Horseradish Peroxidase, ManganesePeroxidase, and Myeloperoxidase

Summary.  Horseradish peroxidase (HRP), myeloperoxidase (MPO), and manganese peroxidase (MnP) have been shown to catalyze the asymmetric sulfoxidation of thioanisole. When H₂O₂ was added stepwise to MPO, a maximal yield of 78% was obtained at pH 5 (ee 23%), whereas an optimum in the enantiomeric excess (32%, (R)-sulfoxide) was found at pH 6 (60% yield). For MnP a yield of 18% and a high enantiomeric excess of 91% of the (S)-sulfoxide were obtained at pH 5 and a yield of 36% and an ee of 87% at pH 7.0. Optimization of the conversion catalyzed by horseradish peroxidase at pH 7.0 by controlled continuous addition of hydrogen peroxide during turnover and monitoring the presence of native enzyme as well as of intermediates I, II, and III led to the formation of the sulfoxide in high yield (100%) and moderate enantioselectivity (60%, (S)-sulfoxide). Received November 18, 1999. Accepted January 21, 2000     

Boundary Value Problems with a Parameter of Differential Equations with Deviated Arguments

The aim of the present paper is to study boundary value problems with a parameter of differential equations with deviated arguments. The existence, uniqueness and continuous dependence of the solution on the right-hand side of our problem are considered.     

Application of a Mickens finite‐difference scheme to the cylindrical Bratu‐Gelfand problem

The boundary value problem Δu + λe^u = 0 where u = 0 on the boundary is often referred to as “the Bratu problem.” The Bratu problem with cylindrical radial operators, also known as the cylindrical Bratu‐Gelfand problem, is considered here. It is a nonlinear eigenvalue problem with two known bifurcated solutions for λ < λ_c, no solutions for λ > λ_c and a unique solution when λ = λ_c. Numerical solutions to the Bratu‐Gelfand problem at the critical value of λ_c = 2 are computed using nonstandard finite‐difference schemes known as Mickens finite differences. Comparison of numerical results obtained by solving the Bratu‐Gelfand problem using a Mickens discretization with results obtained using standard finite differences for λ < 2 are given, which illustrate the superiority of the nonstandard scheme. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 20: 327–337, 2004     

Counting 1-factors in infinite graphs

F. Bry (J. Combin. Theory Ser. B 34 (1983), 48–57) proved that a locally finite infinite n-connected factorizable graph has at least (n−1)! 1-factors and showed that for n = 2 this lower bound is sharp. We prove that for n≥3 any infinite n-connected factorizable graph has at least n! 1-factors (which is a sharp lower bound).