Uniformity in Computable Structure Theory

We investigate the effects of adding uniformity requirements to concepts in computable structure theory such as computable categoricity (of a structure) and intrinsic computability (of a relation on a computable structure). We consider and compare two different notions of uniformity, previously studied by Kudinov and by Ventsov. We discuss some of their results and establish new ones, while also exploring the connections with the relative computable structure theory of Ash, Knight, Manasse, and Slaman and Chisholm and with previous work of Ash, Knight, and Slaman on uniformity in a general computable structure-theoretical setting.     

A note on compact elements in the lattice of radicals

An example of radical compact ring A whose Dorroh extension A¹ is not radical compact is constructed.     

The evolution of a truncated gaussian probability density through time—modelling animal liveweights after selection

The form of the probability density derived from the evolution in time of a previously truncated frequency distribution of animal Liveweights is of interest in animal husbandry. Truncated frequency distributions arise when the heavier animals are sold for slaughter and the lighter animals retained. The demands of modern quality assurance schemes require that, given information on animal growth, the farmer is able to estimate the number of animals that would meet the specifications at some time in the future after truncation. Assuming that animal growth can be described by a linear stochastic differential equation, we derive an explicit expression for the probability density of animal Liveweights at any time after the truncation of an initial Gaussian density. It is shown that this probability density converges rapidly to a Gaussian density, so that after about 20 days of typical growth rates for lambs, the resulting density is practically indistinguishable from Gaussian.     

Fold‐2‐covering triangular embeddings

For a graph G and a positive integer m, G_(m) is the graph obtained from G by replacing every vertex by an independent set of size m and every edge by m² edges joining all possible new pairs of ends. If G triangulates a surface, then it is easy to see from Euler's formula that G_(m) can, in principle, triangulate a surface. For m prime and at least 7, it has previously been shown that in fact G_(m) does triangulate a surface, and in fact does so as a “covering with folds” of the original triangulation. For m = 5, this would be a consequence of Tutte's 5‐Flow Conjecture. In this work, we investigate the case m = 2 and describe simple classes of triangulations G for which G₍₂₎ does have a triangulation that covers G “with folds,” as well as providing a simple infinite class of triangulations G of the sphere for which G₍₂₎ does not triangulate any surface. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 79–92, 2003     

Three-dimensional structure of Saccharomyces cerevisiae inorganic pyrophosphatase complexed with cobalt and phosphate ions

Crystals of Saccharomyces cerevisiae inorganic pyrophosphatase suitable for X-ray diffraction study were grown by cocrystallization of the enzyme with cobalt chloride and imidodiphosphate. Saccharomyces cerevisiae is a metal-dependent enzyme which catalyzes hydrolysis of inorganic pyrophosphate to orthophosphate. The three-dimensional structure of this enzyme was solved by the molecular-replacement method and refined at 1.8 Å resolution to an R factor of 19.5%. Cobalt and phosphate ions were revealed in the active centers of both identical subunits (A and B) of the pyrophosphatase molecule. In subunit B, a water molecule was found between two cobalt ions. It is believed that this water molecule acts as an attacking nucleophile in the enzymatic cleavage of the pyrophosphate bond. It was demonstrated that cobalt ions and a phosphate group occupy only part of the potential binding sites (two chemically identical and crystallographically independent subunits have different binding sites). The arrangement of ligands and the structure of the nucleophile-binding site are discussed in relation to the mechanism of action of the enzyme and the nature of the metal activator.     

A note on the necessary conditions for the algebraic Riccati equation

We derive some useful and easily computable necessary conditionsfor the existence of a positive semi-definite solution to thealgebraic Ricatti equation (ARE). A motivating example is givento highlight the usefulness of the conditions for controllerand observer designs for nonlinear systems. Further, an upperbound on the trace of the solution to the ARE is also derived.     

Karhunen–Loeve representations of turbulent channel flows using the method of snapshots

For three‐dimensional flows with one inhomogeneous spatial coordinate and two periodic directions, the Karhunen–Loeve procedure is typically formulated as a spatial eigenvalue problem. This is normally referred to as the direct method (DM). Here we derive an equivalent formulation in which the eigenvalue problem is formulated in the temporal coordinate. It is shown that this so‐called method of snapshots (MOS) has some numerical advantages when compared to the DM. In particular, the MOS can be formulated purely as a matrix composed of scalars, thus avoiding the need to construct a matrix of matrices as in the DM. In addition, the MOS avoids the need for so‐called weight functions, which emerge in the DM as a result of the non‐uniform grid typically employed in the inhomogeneous direction. The avoidance of such weight functions, which may exhibit singular behaviour, guarantees satisfaction of the boundary conditions. The MOS is applied to data sets recently obtained from the direct simulation of turbulence in a channel in which viscoelasticity is imparted to the fluid using a Giesekus model. The analysis reveals a steep drop in the dimensionality of the turbulence as viscoelasticity is increased. This is consistent with the results that have been obtained with other viscoelastic models, thus revealing an essential generic feature of polymer‐induced drag reduced turbulent flows. Published in 2006 by John Wiley & Sons, Ltd.