Contributions of Spin–Lattice Relaxation to the Echo Decay of Planar Cu in High-Temperature Superconductors

Measurement ofT_2G, the Gaussian component of the spin-echo envelope of planar Cu nuclei in high-temperature superconductors, gives important information about the real part of the Cu electron spin susceptibility. In the traditional picture of the planar Cu echo decay, the internuclear coupling is assumed to remain static with respect to spin–lattice relaxation and mutual exchange fluctuations. In some circumstances, however, this assumption breaks down. We calculate the internuclear corrections arising from spin–lattice relaxation to the conventional theory ofT_2Gand show thatT_2Gcan be easily corrected for these effects. We argue that mutual exchanges due to the perpendicular indirect couplings are suppressed in these materials. For YBa₂Cu₄O₈, we find a correction on the order of 10% inT_2Gand using the corrected values we find that the isotope ratio⁶³T_2G/⁶⁵T_2Gagrees with theory.     

Synthesis and cationic photopolymerization of new fluorinated,polyfunctional propenyl ether oligomers

New fluorinated, polyfunctional propenyl ether functionalized resins were synthesized, and their behavior in cationic photopolymerization was investigated. The photopolymerization proceeded efficiently with a high double‐bond conversion (>90%), giving rise to UV‐cured coatings characterized by low glass‐transition temperatures (?33 °C ≤ glass‐transition temperature ≤ ?15 °C) and hydrophobic surface properties. A fluorinated additive was also employed as a reactive additive in the cationic photopolymerization of trimethylolpropane tripropenyl ether, increasing the double‐bond conversion, polymer network flexibility, thermal stability, and surface hydrophobicity. © 2006 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 44: 6943–6951, 2006     

Algebraic properties of discrete box splines

The central objective of this paper is to discuss linear independence of translates of discrete box splines which we introduced earlier as a device for the fast computation of multivariate splines. The results obtained here allow us to draw conclusions about the structure of such discrete splines which have, in particular, applications to counting the number of nonnegative integer solutions of linear diophantine equations.     

A Problem-Solving Based Mathematics Course and Elementary Teachers' Beliefs

This study examined the impact a problem-solving based mathematics content course for preservice elementary education teachers (PSTs) had on challenging the beliefs they held with respect to mathematics and themselves as doers of mathematics. Nine PSTs were interviewed to gain insight into changes that occurred to their belief systems and what aspect(s) of the course were instrumental in producing those changes. Surveys to measure how strongly PSTs subscribed to five mathematical beliefs were administered to 137 PSTs who were enrolled in the course. Significant positive changes (p < .01) were observed for four of the five beliefs. When changes were studied by achievement level, students with final grades of A or B showed statistically significant changes (p < .005) in three of the five beliefs. Students who were interviewed consistently reported increased confidence in their mathematical abilities as a result of the course.     

Algorithmic aspects of intersection graphs and representation hypergraphs

Let be a family of sets. The intersection graph of is obtained by representing each set in by a vertex and connecting two vertices by an edge if and only if their corresponding sets intersect. Of primary interest are those classes of intersection graphs of families of sets having some specific topological or other structure. The grandfather of all intersection graphs is the class of interval graphs, that is, the intersection graphs of intervals on a line.The scope of research that has been going on in this general area extends from the mathematical and algorithmic properties of intersection graphs, to their generalizations and graph parameters motivated by them. In addition, many real-world applications involve the solution of problems on such graphs.In this paper a number of topics in algorithmic combinatorics which involve intersection graphs and their representative families of sets are presented. Recent applications to computer science are also discussed. The intention of this presentation is to provide an understanding of the main research directions which have been investigated and to suggest possible new directions of research.