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.     

The dominating number of a random cubic graph

We show that if G is a random 3-regular graph on n vertices, then its dominating number, D(G), almost surely satisfies .2636n ≤ D(G) ≤ .3126n. © 1995 John Wiley & Sons, Inc.     

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.     

Pattern formation in diffusion-limited reactions

The conditions for macroscopic segregation ofA andB in a steady-stateA+B 0 reaction are studied in infinite systems. Segregation occurs in one and two dimensions and is marginal ford=3. We note the dependence of these results on the precise experimental conditions assumed in the theory. We also note the difference between these results and our earlier ones for finite systems where the critical dimension isd=2.