Factors Influencing the Outcomes of Collaborative Mathematical Problem Solving: An Introduction

This study is an investigation of the factors that influence the effectiveness of collaboration on open-ended mathematical tasks. Students in Grades 3, 6, and 9 worked in groups of 3 on 2 chance and data tasks-1 related to fair dice and the other related to associations among variables presented on data cards. The groups' outcomes and the types of collaboration observed are investigated in relation to issues raised in the literature. Various phenomena are identified that influence cognitive "lifting," "hovering," and "falling," that is, improvement, no change, and reduction in levels of functioning, respectively. These phenomena include cognitive factors, social or interpersonal factors, and external factors.     

Multi-step quasi-Newton methods for optimization

Quasi-Newton methods update, at each iteration, the existing Hessian approximation (or its inverse) by means of data deriving from the step just completed. We show how “multi-step” methods (employing, in addition, data from previous iterations) may be constructed by means of interpolating polynomials, leading to a generalization of the “secant” (or “quasi-Newton”) equation. The issue of positive-definiteness in the Hessian approximation is addressed and shown to depend on a generalized version of the condition which is required to hold in the original “single-step” methods. The results of extensive numerical experimentation indicate strongly that computational advantages can accrue from such an approach (by comparison with “single-step” methods), particularly as the dimension of the problem increases.     

Systems of first-order chemical reactions

We consider the classical model in chemical kinetics of a system of n species in which each species is converted to every other species by a first-order reaction. Solutions to the initial-value problem are given in matrix form and the properties of the n × n matrix K representing the system are analysed. For arbitrary (i.e. non-negative) values of the first-order rate constants, zero is an eigenvalue, and the other eigenvalues are complex with negative real parts. Thus, in this case the system generally oscillates to equilibrium. However, if the principle of microscopic reversibility is applied, and if each species is converted directly to every other species, then the system cannot oscillate but must converge “exponentially” to equilibrium. We discuss when K is diagonalizable, and we calculate a bound for the eigenvalues of K. Special forms of K, corresponding to special systems of reactions, are also examined; these include reactions in the configuration of a “chain”, a “cycle”, a “node” and reactions comprising combinations of these. We find again that if the principle of microscopic reversibility is rigorously applied then oscillations cannot take place, but that if this principle is not applied then oscillations may take place. The system of rate equations considered can be used to model various chemical, physical and biological phenomena.     

A natural prior probability distribution derived from the propositional calculus

A σ-additive probability measure on the real interval [0, 1] is defined by considering the expected values of “randomly chosen” large formulae of the propositional calculus, where the propositional variables are treated as independent random variables on {0, 1} with expected value . Although arising naturally from logical and/or cognitive considerations, this measure is extremely complex and displays certain formally pathological features, including infinite density at all points of a certain dense subset of [0, 1]. Certain variantsof the construction are also considered. The introduction includes an account of motivation for the study of such measures arising from a fundamental problem in inexact reasoning.     

Fuzzy logic in measurements

Our main interest in this paper is to translate from “natural language” into “system theoretical language”. This is of course important since a statement in system theory can be analyzed mathematically or computationally. We assume that, in order to obtain a good translation, “system theoretical language” should have great power of expression. Thus we first propose a new frame of system theory, which includes the concepts of “measurement” as well as “state equation”. And we show that a certain statement in usual conversation, i.e., fuzzy modus ponens with the word “very”, can be translated into a statement in the new frame of system theory. Though our result is merely one example of the translation from “natural language” into “system theoretical language”, we believe that our method is fairly general.     

Quasilinear conflict-controlled processes with additional restrictions

A class of conflict-controlled processes [1–3] with additional (“phase” type) restrictions on the state of the evader is considered. A similar unrestricted problem was considered in [4]. Unlike [5, 6] the boundary of the “phase” restrictions is not a “death line” for the evader. Sufficient conditions for the solvability of the pursuit and evasion problems are obtained, which complement a range of well-known results [5–10].^‡     

Construction of the value function in a pursuit-evasion game with three pursuers and one evader

A differential pursuit-evasion game is considered with three pursuers and one evader. It is assumed that all objects (players) have simple motions and that the game takes place in a plane. The control vectors satisfy geometrical constraints and the evader has a superiority in control resources. The game time is fixed. The value functional is the distance between the evader and the nearest pursuer at the end of the game. The problem of determining the value function of the game for any possible position is solved.

Three possible cases for the relative arrangement of the players at an arbitrary time are studied: “one-after-one”, “two-after-one”, “three-after-one-in-the-middle” and “three-after-one”. For each of the relative arrangements of the players a guaranteed result function is constructed. In the first three cases the function is expressed analytically. In the fourth case a piecewise-programmed construction is presented with one switchover, on the basis of which the value of the function is determined numerically. The guaranteed result function is shown to be identical with the game value function. When the initial pursuer positions are fixed in an arbitrary manner there are four game domains depending on their relative positions. The boundary between the “three-after-one-in-the-middle” domain and the “three-after-one” domain is found numerically, and the remaining boundaries are interior Nicomedean conchoids, lines and circles. Programs are written that construct singular manifolds and the value function level lines.     

Statistical learning control of uncertain systems: theory and algorithms

It has recently become clear that many control problems are too difficult to admit analytic solutions. New results have also emerged to show that the computational complexity of some “solved” control problems is prohibitive. Many of these control problems can be reduced to decidability problems or to optimization questions. Even though such questions may be too difficult to answer analytically, or may not be answered exactly given a reasonable amount of computational resources, researchers have shown that we can “approximately” answer these questions “most of the time”, and have “high confidence” in the correctness of the answers.     

Forcing closed unbounded subsets of ω2

It is shown that there is no satisfactory first-order characterization of those subsets of ω₂ that have closed unbounded subsets in ω₁,ω₂ and GCH preserving outer models. These “anticharacterization” results generalize to subsets of successors of uncountable regular cardinals. Similar results are proved for trees of height and cardinality κ⁺ and for partitions of [κ⁺]², when κ is an infinite cardinal.     

The Dempster–Shafer calculus for statisticians

The Dempster–Shafer (DS) theory of probabilistic reasoning is presented in terms of a semantics whereby every meaningful formal assertion is associated with a triple (p, q, r) where p is the probability “for” the assertion, q is the probability “against” the assertion, and r is the probability of “don’t know”. Arguments are presented for the necessity of “don’t know”. Elements of the calculus are sketched, including the extension of a DS model from a margin to a full state space, and DS combination of independent DS uncertainty assessments on the full space. The methodology is applied to inference and prediction from Poisson counts, including an introduction to the use of join-tree model structure to simplify and shorten computation. The relation of DS theory to statistical significance testing is elaborated, introducing along the way the new concept of “dull” null hypothesis.     

Universal deformation formulas and breaking symmetry

We show that an algebra with a non-nilpotent Lie group of automorphisms or “symmetries” (e.g., smooth functions on a manifold with such a group of diffeomorphisms) may generally be deformed (in the function case, “quantized”) in such a way that only a proper subgroup of the original group acts. This symmetry breaking is a consequence of the existence of certain “universal deformation formulas” which are elements, independent of the original algebra, in the tensor algebra of the enveloping algebra of the Lie algebra of the group.     

Psychology and Mathematics Education

This article analyzes the relation between cognitive psychology, as a broad theoretical framework, and the psychology of mathematics education. It is argued that mathematics education should not simply “borrow” from cognitive psychology; rather, our discipline should provide its own psychological research problems, its adapted investigation strategies, and even, in certain circumstances, its adequate original concepts. It is argued that the didactical orientation of its research endeavors highlights new, original theoretical and applicative perspectives, perspectives that cognitive psychology cannot provide by itself. Some examples are described that emphasize the difference between the broad cognitive approach and that of the psychology of mathematics education.     

A constrained optimization approach to finite element mesh smoothing

The quality of a finite element solution has been shown to be affected by the quality of the underlying mesh. A poor mesh may lead to unstable and/or inaccurate finite element approximations. Mesh quality is often characterized by the “smoothness” or “shape” of the elements (triangles in 2-D or tetrahedra in 3-D). Most automatic mesh generators produce an initial mesh where the aspect ratio of the elements are unacceptably high. In this paper, a new approach to produce acceptable quality meshes from a topologically valid initial mesh is presented. Given an initial mesh (nodal coordinates and element connectivity), a “smooth” final mesh is obtained by solving a constrained optimization problem. The variables for the iterative optimization procedure are the nodal coordinates (excluding, the boundary nodes) of the finite element mesh, and appropriate bounds are imposed on these to prevent an unacceptable finite element mesh. Examples are given of the application of the above method for 2- and 3-D meshes generated using automatic mesh generators. Results indicate that the new method not only yields better quality elements when compared with the traditional Laplacian smoothing, but also guarantees a valid mesh unlike the Laplacian method.     

Mereological relations

A “mereological” relation is one of “part-to-whole” type. This paper proposes a model-theoretic approach to identifying and classifying such relations. Three initial applications of this approach are investigated. In each case, the class of identified relations is found to consist precisely of the partial orders on the underlying set. Further applications are proposed.     

On generalized formulation of the equilibrium problem of an elastic strip

A “nonenergetic” formulation of the boundary value problems of statics of an elastic strip based on the principle of admissible displacements, is studied. The formulation makes possible, in particular, the study of problems concerning the strips of infinite energy, while retaining the external form of the “energetic” formulation /1–3/, and produces unique solvability of the problem under weaker restrictions imposed on the external loads. Such a formulation is also possible for other problems of the theory of elasticity.     

Interval orders based on weak orders

One definition of an interval order is as an order isomorphic to that of a family of nontrivial intervals of a linearly ordered set with [a,b] < [c,d] if b c. Fishburn's theorem states that an order is an interval order if and only if it has no four-element restriction isomorphic to the ordered set (shown in Fig. 1) “ ”. We show that an order is isomorphic to a family of nontrivial intervals of a weak order, ordered as above, if and only if it has no restriction to one of the four ordered sets (shown in Fig. 2) “ ”, a six-element crown or a six-element fence.     

A simple decision model of counterproliferation

We develop a simple decision model of counterproliferation involving a status quo “incumbent” and a nuclear “entrant”. The problem is examined as a one-stage interaction in two phases: nuclear development and deployment. We examine the conditions that will influence the decision to move pre-emptively against a proliferator's nuclear program. Particular attention is given to the role of uncertainty in determining the expected costs of action at different points in the entrant's weapon's development and deployment cycle. The model permits us to determine the optimal time to act given varying levels of information concerning entrant behavior. In conclusion, we examine the tradeoffs between the expected costs of action and the costs of intelligence.     

Levy and set theory

Azriel Levy (1934–) did fundamental work in set theory when it was transmuting into a modern, sophisticated field of mathematics, a formative period of over a decade straddling Cohen’s 1963 founding of forcing. The terms “Levy collapse”, “Levy hierarchy”, and “Levy absoluteness” will live on in set theory, and his technique of relative constructibility and connections established between forcing and definability will continue to be basic to the subject. What follows is a detailed account and analysis of Levy’s work and contributions to set theory.     

The Borda rule and Pareto stability: a further comment

In their paper “The Borda rule and Pareto stability: a comment” published in 1979 by Econometrica, Farkas and Nitzan revealed the “intimate relationship” between the Borda rule and the Pareto criterion. The idea was the following: in a profile of total orders, when there is a candidate who obviously wins under unanimous agreement of the voters, that candidate should be in the choice set. In a profile where there is no obvious winner, the candidates that are the closest to unanimity should be chosen. According to this principle, they defined a choice rule called “closeness to unanimity” and they showed that it is equivalent to the Borda rule. In our paper, we give an equivalent result for a ranking rule. Then we try to obtain similar results when aggregating profiles of tournaments, weak orders, semiorders, fuzzy relations, … and we show that the definition of an obvious winner is no more obvious.     

Multicomponent steady flows in porous media with phase transitions

Steady multiphase flow of a multicomponent mixture in a porous medium with phase transitions is considered. It is shown that, in a wide class of cases, the thermodynamic problem separates from the filtration problem and the latter is integrated in quadratures. The class of exact solutions which has been found is used to interpret indicator curves. Solutions are presented in an analytic form for systems of the “gas-condensate” and “oil-gas” type.