Students’ Reasoning About One-Object Stochastic Phenomena in an ICT-Environment

This paper focuses on the different ways in which students in lower secondary school (14–16 year olds) experience compound random events, presented to them in the form of combined junctions. A carefully designed ICT environment was developed enabling the students to interact with different representations of such structures. Data for the analysis was gathered from two interview sessions. The analysis of the interaction is based on constructivist principles on learning; i.e. we adopted a student-oriented perspective, taking into consideration the different ways students try to make sense of chance encounters. Our results show how some students give priority to geometrical and physical concerns, and we discuss how seeking causal explanations of random phenomena may have encouraged this. With respect to numerically oriented models a division strategy appears to stand out as the preferred one.     

Group-valued measures on coarse-grained quantum logics

In [3] it was shown that a (real) signed measure on a cyclic coarse-grained quantum logic can be extended, as a signed measure, over the entire power algebra. Later ([9]) this result was re-proved (and further improved on) and, moreover, the non-negative measures were shown to allow for extensions as non-negative measures. In both cases the proof technique used was the technique of linear algebra. In this paper we further generalize the results cited by extending group-valued measures on cyclic coarse-grained quantum logics (or non-negative group-valued measures for lattice-ordered groups). Obviously, the proof technique is entirely different from that of the preceding papers. In addition, we provide a new combinatorial argument for describing all atoms of cyclic coarse-grained quantum logics.     

On the genericity of chaos

Let M be a compact manifold with dimM?2. We prove that some iteration of the generic homeomorphism on M is semiconjugated to the shift map and has infinite topological entropy (Theorem 1.1).     

Spectral Properties of Four-Dimensional Compact Flat Manifolds

We study the spectral properties of a large class of compact flat Riemannian manifolds of dimension 4, namely, those whose corresponding Bieberbach groups have the canonical lattice as translation lattice. By using the explicit expression of the heat trace of the Laplacian acting on p-forms, we determine all p-isospectral and L-isospectral pairs and we show that in this class of manifolds, isospectrality on functions and isospectrality on p-forms for all values of p are equivalent to each other. The list shows for any p, 1 ≤ p ≤ 3, many p-isospectral pairs that are not isospectral on functions and have different lengths of closed geodesics. We also determine all length isospectral pairs (i.e. with the same length multiplicities), showing that there are two weak length isospectral pairs that are not length isospectral, and many pairs, p-isospectral for all p and not length isospectral. Mathematics Subject Classifications (2000): 58J53, 58C22, 20H15.     

A polar macroporous sorbent for gas chromatography

Summary The gas chromatographic behaviour of crosslinked macroporous 2-hydroxyethyl methacrylate grafted with 2-methyloxazoline was investigated and the range of applicability of the copolymer was assessed. Retention index values were measured on this copolymer and compared with those obtained on the terpolymer 2-hydroxyethyl methacrylate-ethylene dimethacrylate-acrylonitrile. Rohrschneider constants and efficiency data for selected sorbates are given. The use of this type of polymer in the separation of various types of compounds is documented by various examples.     

Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets

Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their elements converging to zero sufficiently slowly. When these sets are convex hulls of sets with power-type covering numbers, the bounds are tight. The arguments exploit properties of generalized Hadamard matrices. The results are illustrated by examples from machine learning, neurocomputing, and nonlinear approximation.