Geometric isomers of chloro(6-methyl-1,4,8,11-tetraazacyclotetradecane-6-amine)cobalt(III) tetrachlorozincate(II)

The crystal structures of a pair of cis and trans isomers of the macrocyclic chloropentaamine title complex, as their tetrachlorozincate(II) salts, [CoCl(C11H27N5)][ZnCl4], are reported. The two distinct isomeric forms lead to significant variations in the Co-N bond lengths and, furthermore, hydrogen bonding between the complex ions is influenced by the folded (cis) or planar (trans) conformations of the coordinated ligand.

Method for determining the shear stress in cylindrical systems

We develop a method for determining the elements of the pressure tensor at a radius r in a cylindrically symmetric system, analogous to the so-called method of planes used in planar systems [B. D. Todd, Denis J. Evans, and Peter J. Daivis, Phys. Rev. E 52, 1627 (1995)]. We demonstrate its application in determining the radial shear stress dependence during molecular dynamics simulations of the forced flow of methane in cylindrical silica mesopores. Such expressions are useful for the examination of constitutive relations in the context of transport in confined systems.

Pseudo-randomness of round-off errors in discretized linear maps on the plane

We analyze the sequences of round-off errors of the orbits of a discretized planar rotation, from a probabilistic angle. It was shown [Bosio & Vivaldi, 2000] that for a dense set of parameters, the discretized map can be embedded into an expanding p-adic dynamical system, which serves as a source of deterministic randomness. For each parameter value, these systems can generate infinitely many distinct pseudo-random sequences over a finite alphabet, whose average period is conjectured to grow exponentially with the bit-length of the initial condition (the seed). We study some properties of these symbolic sequences, deriving a central limit theorem for the deviations between round-off and exact orbits, and obtain bounds concerning repetitions of words. We also explore some asymptotic problems computationally, verifying, among other things, that the occurrence of words of a given length is consistent with that of an abstract Bernoulli sequence.