Negative thermal expansion in the plateau state of a magnetically-frustrated spinel

We report on negative thermal expansion (NTE) in the high-field, half-magnetization plateau phase of the frustrated magnetic insulator CdCr2O4. Using dilatometry, we precisely map the phase diagram at fields of up to 30T, and identify a strong NTE associated with the collinear half-magnetization plateau for B > 27T. The resulting phase diagram is compared with a microscopic theory for spin-lattice coupling, and the origin of the NTE is identified as a large negative change in magnetization with temperature, coming from a nearly-localised band of spin excitations in the plateau phase. These results provide useful guidelines for the discovery of new NTE materials.Comment: 6 pages, 2 figure

Phospholipid membrane protection by sugar molecules during dehydration - insights into molecular mechanisms using scattering techniques

Scattering techniques have played a key role in our understanding of the structure and function of phospholipid membranes. These techniques have been applied widely to study how different molecules (e.g., cholesterol) can affect phospholipid membrane structure. However, there has been much less attention paid to the effects of molecules that remain in the aqueous phase. One important example is the role played by small solutes, particularly sugars, in protecting phospholipid membranes during drying or slow freezing. In this paper, we present new results and a general methodology, which illustrate how contrast variation small angle neutron scattering (SANS) and synchrotron-based X-ray scattering (small angle (SAXS) and wide angle (WAXS)) can be used to quantitatively understand the interactions between solutes and phospholipids. Specifically, we show the assignment of lipid phases with synchrotron SAXS and explain how SANS reveals the exclusion of sugars from the aqueous region in the particular example of hexagonal II phases formed by phospholipids

OBDD-Based Representation of Interval Graphs

A graph $G = (V,E)$ can be described by the characteristic function of the edge set $\chi_E$ which maps a pair of binary encoded nodes to 1 iff the nodes are adjacent. Using \emph{Ordered Binary Decision Diagrams} (OBDDs) to store $\chi_E$ can lead to a (hopefully) compact representation. Given the OBDD as an input, symbolic/implicit OBDD-based graph algorithms can solve optimization problems by mainly using functional operations, e.g. quantification or binary synthesis. While the OBDD representation size can not be small in general, it can be provable small for special graph classes and then also lead to fast algorithms. In this paper, we show that the OBDD size of unit interval graphs is $O(\ | V \ | /\log \ | V \ |)$ and the OBDD size of interval graphs is $O(\ | V \ | \log \ | V \ |)$which both improve a known result from Nunkesser and Woelfel (2009). Furthermore, we can show that using our variable order and node labeling for interval graphs the worst-case OBDD size is$\Omega(\ | V \ | \log \ | V \ |)$. We use the structure of the adjacency matrices to prove these bounds. This method may be of independent interest and can be applied to other graph classes. We also develop a maximum matching algorithm on unit interval graphs using$O(\log \ | V \ |)$operations and a coloring algorithm for unit and general intervals graphs using$O(\log^2 \ | V \ |)$ operations and evaluate the algorithms empirically.Comment: 29 pages, accepted for 39th International Workshop on Graph-Theoretic Concepts 201

Willmore Surfaces of Constant Moebius Curvature

We study Willmore surfaces of constant Moebius curvature $K$ in $S^4$. It is proved that such a surface in $S^3$ must be part of a minimal surface in $R^3$ or the Clifford torus. Another result in this paper is that an isotropic surface (hence also Willmore) in $S^4$ of constant $K$ could only be part of a complex curve in $C^2\cong R^4$ or the Veronese 2-sphere in $S^4$. It is conjectured that they are the only examples possible. The main ingredients of the proofs are over-determined systems and isoparametric functions.Comment: 16 pages. Mistakes occured in the proof to the main theorem (Thm 3.6) has been correcte

Multiband theory of quantum-dot quantum wells: Dark excitons, bright excitons, and charge separation in heteronanostructures

Electron, hole, and exciton states of multishell CdS/HgS/CdS quantum-dot quantum well nanocrystals are determined by use of a multiband theory that includes valence-band mixing, modeled with a 6-band Luttinger-Kohn Hamiltonian, and nonparabolicity of the conduction band. The multiband theory correctly describes the recently observed dark-exciton ground state and the lowest, optically active, bright-exciton states. Charge separation in pair states is identified. Previous single-band theories could not describe these states or account for charge separation.Comment: 10 pages of ReVTex, 6 ps figures, submitted to Phys. Rev.

Sediment Loading and Water Quality of Field Run-off Water

Intensive tillage is commonly employed in many agronomic production systems in the United States. Tillage operations may include disking the field, re-smoothing the soil, seedbed formation, reducing the seedbeds, and shallow cultivation for weed control. Tillage practices in conjunction with rainfall have been linked to soil erosion, which may adversely affect the environment. The soil erosion dynamics of two large-scale production cotton fields that utilized both modern-conventional and conservation-tillage technology were examined. Studies were conducted in the cotton-producing region of southeast Arkansas in the Bayou Bartholomew watershed. Bayou Bartholomew is currently listed by the United States Environmental Protection Agency as an impacted stream. The soils at these sites were related, coarse-textured alfisols. One field was cropped to conventionally tilled cotton and intensively tilled. The second field was cropped to cotton using modern conservation tillage technology. Both fields were furrow-flow irrigated using piped water. Intense rainfall usually occurs in the Mississippi River Delta Region, particularly in the winter and spring months. Conservation tillage proved to be immediately beneficial in controlling soil erosion and sediment loss due to field run-off water from rainfall. Sediment content of run-off water induced by rainfall from the conventionally tilled cotton field was significantly greater than the sediments found in run-off water from the conservation tilled cotton field. The amount of sediment found in rainfall run-off water decreased more rapidly with time under conservation tillage than under conventional tillage. The tillage system made little difference in sediment content of run-off water from irrigation. The water flow from furrow irrigation is typically slow and steady. There is no droplet impact on the ground from furrow-flow irrigation as there would be from rainfall. Apparently, the gentle flow of the water down the furrows was insufficient to dislodge large numbers of soil particles

Neighborhoods of trees in circular orderings

In phylogenetics, a common strategy used to construct an evolutionary tree for a set of species X is to search in the space of all such trees for one that optimizes some given score function (such as the minimum evolution, parsimony or likelihood score). As this can be computationally intensive, it was recently proposed to restrict such searches to the set of all those trees that are compatible with some circular ordering of the set X. To inform the design of efficient algorithms to perform such searches, it is therefore of interest to find bounds for the number of trees compatible with a fixed ordering in the neighborhood of a tree that is determined by certain tree operations commonly used to search for trees: the nearest neighbor interchange (nni), the subtree prune and regraft (spr) and the tree bisection and reconnection (tbr) operations. We show that the size of such a neighborhood of a binary tree associated with the nni operation is independent of the tree’s topology, but that this is not the case for the spr and tbr operations. We also give tight upper and lower bounds for the size of the neighborhood of a binary tree for the spr and tbr operations and characterize those trees for which these bounds are attained