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.     

Partial molal heat capacities of aqueous tetraalkylammonium bromides as functions of temperature

Enthalpies of solution have been measured from 5 to 85°C for aqueous tetraethyl- and tetrapropylammonium bromides, and the integral heat method is employed to evaluate for these electrolytes over a wide temperature range. Data taken from the literature have been used to evaluate for aqueous Bu₄NBr over a similar temperature range. These data, along with similar data for Me₄NBr, previously reported, have been used to evaluate absolute ionic heat capacities. While the absolute values agree only qualitatively with two other methods of division, the temperature dependences of the three methods essentially agree up to 65°C. Heat capacities due to structural effects on the solvent, obtained by subtracting the inherent heat capacities of the ions, are extraordinarily positive for all four tetraalkylammonium ions and have negative temperature coefficients, indicating that all four ions, including the tetramethylammonium ion, are structure-making ions.