Influences of CAS and GC in early algebra

In the last years, several studies have investigated the role of technology in teaching and learning mathematics. However, the specific role of computer algebra systems (CAS) in early algebra in contrast to graphic calculators (GC) is still unclear. The CAYEN project is researching this field by comparing 13-year-old pupils—one GC class and two CAS classes have been observed while acquiring elementary algebraic competences with nearly the same teaching sequence. The field of algebraic competences is split into syntactic abilities and symbol sense. The results of this explorative case study show that the development of symbol sense is influenced by the adoption of CAS in the learning process. Especially when transitioning from arithmetic to algebra, the pupils’ views of algebra as well as their conceptions of algebraic objects seem to be affected by the availability of CAS.     

How strange can an attractor for a dynamical system in a 3-manifold look?

The aim of this paper is to characterise those compact subsets K of 3-manifolds M that are (stable and not necessarily global) attractors for some flow on M. We will show that it is the topology of M−K, rather than that of K, the one that plays a relevant role in this problem.A necessary and sufficient condition for a set K to be an attractor is that it must be an “almost tame” subset of M in a sense made precise under the equivalent notions of “weakly tame” and “tamely embedded up to shape”, defined in the paper. These are complemented by a further equivalent condition, “algebraic tameness”, which has the advantage of being checkable by explicit computation.A final section of the paper is devoted to a partial analysis of the same question when one replaces flows by discrete dynamical systems.     

Some examples for the Poincaré and Painlevé problems

In 1891, Poincaré started a series of three papers in which he tried to answer the following question (cf. [21-23]): “Is it possible to decide if an algebraic differential equation in two variables is algebraically integrable?” (in the sense that it has a rational first integral). More or less at the same time P. Painlevé asked the following question: “Is it possible to recognize the genus of the general solution of an algebraic differential equation in two variables which has a rational first integral?”. In this paper we give examples of one-parameter families which show that both problems have a negative answer. With some of the families we can also answer a question posed by M. Brunella in [5].     

The affect heuristic

This paper introduces a theoretical framework that describes the importance of affect in guiding judgments and decisions. As used here, “affect” means the specific quality of “goodness” or “badness” (i) experienced as a feeling state (with or without consciousness) and (ii) demarcating a positive or negative quality of a stimulus. Affective responses occur rapidly and automatically—note how quickly you sense the feelings associated with the stimulus word “treasure” or the word “hate”. We argue that reliance on such feelings can be characterized as “the affect heuristic”. In this paper we trace the development of the affect heuristic across a variety of research paths followed by ourselves and many others. We also discuss some of the important practical implications resulting from ways that this heuristic impacts our daily lives.     

The Isis problem as an experimental probe and teaching resource

The Isis problem, which has a link with the Isis cult of ancient Egypt, asks: “Find which rectangles with sides of integral length (in some unit) have area and perimeter (numerically) equal, and prove the result.” Since the solution requires minimal technical mathematics, the problem is accessible to a wide range of students. Further, it is notable for the variety of proofs (empirically grounded, algebraic, geometrical) using different forms of argument, and their associated representations, and it provides an instrument for probing students’ ideas about proof, and the interplay between routine and adaptive expertise. A group of 39 Flemish pre-service mathematics teachers was confronted with the Isis problem. More specifically, we first asked them to solve the problem and to look for more than one solution. Second, we invited them to study five given contrasting proofs and to rank these proofs from best to worst. The results highlight a preference of many students for algebraic proofs as well as their rejection of experimentation. The potential of the problem as a teaching tool is outlined.     

A comparison of different quantity discount pricing policies in a two-echelon channel with stochastic and asymmetric demand information

In this paper, we study quantity discount pricing policies in a channel of one manufacturer and one retailer. The paper assumes that the channel faces a stochastic price-sensitive demand but the retailer can privately observe the realization of an uncertain demand parameter. The problem is analyzed as a Stackelberg game in which the manufacturer declares quantity discount pricing schemes to the retailer and then the retailer follows by selecting the retail price and associated quantity. Proposed in the paper are four quantity-discount pricing policies: “regular quantity discount”; “fixed percentage discount”; “incremental volume discount” and “fixed marginal-profit-rate discount”. Optimal solutions are derived, and numerical examples are presented to illustrate the efficiency of each discount policy.     

Computation of the invariant measure for a Lévy driven SDE: Rate of convergence

We study the rate of convergence of some recursive procedures based on some “exact” or “approximate” Euler schemes which converge to the invariant measure of an ergodic SDE driven by a Lévy process. The main interest of this work is to compare the rates induced by “exact” and “approximate” Euler schemes. In our main result, we show that replacing the small jumps by a Brownian component in the approximate case preserves the rate induced by the exact Euler scheme for a large class of Lévy processes.     

Construction of large families of pseudorandom binary sequences

In a series of papers Mauduit and Sárközy (partly with coauthors) studied finite pseudorandom binary sequences. They showed that the Legendre symbol forms a “good” pseudorandom sequence, and they also tested other sequences for pseudorandomness, however, no large family of “good” pseudorandom sequences has been found yet.In this paper, a large family of this type is constructed by extending the earlier Legendre symbol construction.     

Problem posing via “what if not?” strategy in solid geometry — a case study

The study describes the kinds of problems posed by pre-service teachers on the basis of complex solid geometry tasks using the “what if not?” strategy and the educational value of such an activity. Twenty-eight pre-service teachers participated in two workshops in which they had to pose problems on the basis of given problems. Analysis of the posed problems revealed a wide range of problems including those containing a change of one of the numerical data to another specific one, to a proof problem. Different kinds of posed problems enlightened some phenomena such as a bigger frequency of posed problems with another numerical value and a lack of posed problems including formal generalization. We also discuss the educational strengths of problem posing in solid geometry using the “what if not?” strategy, which could make the learner rethink the geometrical concepts he uses while creating new problems, make connections between the given and the new concepts and as a result deepen his understanding of them.     

Noising methods for a clique partitioning problem

This paper deals with the application of noising methods to a clique partitioning problem for a weighted graph. The aim is to study different ways to add noise to the data, and to show that the choice of the noise-adding-scheme may have some impact on the performance of these methods. Among the noise-adding-schemes described here, two of them are totally new, leading to the “forgotten vertices” and to the “forgotten edges” methods. We also experimentally study a generic noising method that automatically tunes its parameters. For each noise-adding-scheme, we compare a variant which inserts descents and a variant which does not.     

Supertropical algebra

We develop the algebraic polynomial theory for “supertropical algebra,” as initiated earlier over the real numbers by the first author. The main innovation there was the introduction of “ghost elements,” which also play the key role in our structure theory. Here, we work somewhat more generally over an ordered monoid, and develop a theory which contains the analogs of several basic theorems of classical commutative algebra. This structure enables one to develop a Zariski-type algebraic geometric approach to tropical geometry, viewing tropical varieties as sets of roots of (supertropical) polynomials, leading to an analog of the Hilbert Nullstellensatz.Particular attention is paid to factorization of polynomials. In one indeterminate, any polynomial can be factored into linear and quadratic factors, and although unique factorization may fail, there is a “preferred” factorization that is explained both geometrically and algebraically. The failure of unique factorization in several indeterminates is explained by geometric phenomena described in the paper.     

AIR Tools — A MATLAB package of algebraic iterative reconstruction methods

We present a MATLAB package with implementations of several algebraic iterative reconstruction methods for discretizations of inverse problems. These so-called row action methods rely on semi-convergence for achieving the necessary regularization of the problem. Two classes of methods are implemented: Algebraic Reconstruction Techniques (ART) and Simultaneous Iterative Reconstruction Techniques (SIRT). In addition we provide a few simplified test problems from medical and seismic tomography. For each iterative method, a number of strategies are available for choosing the relaxation parameter and the stopping rule. The relaxation parameter can be fixed, or chosen adaptively in each iteration; in the former case we provide a new “training” algorithm that finds the optimal parameter for a given test problem. The stopping rules provided are the discrepancy principle, the monotone error rule, and the NCP criterion; for the first two methods “training” can be used to find the optimal discrepancy parameter.     

Completing Diophantus, De polygonis numeris, prop. 5

The last proposition of Diophantus’ De polygonis numeris, inquiring the number of ways that a number can be polygonal and apparently aiming at “simplifying” the definitory relation established by Diophantus himself, is incomplete. Past completions of this proposition are reported in detail and discussed, and a new route to a “simplified” relation is proposed, simpler, more transparent and more “Greek looking” than the others. The issue of the application of such a simplified relation to solving the problem set out by Diophantus is also discussed in full detail.     

Dollar vs. percentage markup pricing schemes under a dominant retailer

We investigate two very common pricing schemes for a Stackelberg-dominant retailer: percentage-markup and dollar-markup. We show that when a dominant retailer switches from dollar to percentage markup, the channel’s “overall pie” and the retailer’s “pie-piece” are both enlarged. In contrast, the manufacturer will be forced to levy a lower wholesale price, thus receiving a smaller pie-piece despite the larger pie. The preceding statements hold regardless of whether the demand is deterministic or stochastic. However, the effects of switching to percentage markup on the retail price and sales volume will depend not only on whether the demand is stochastic, but also on the assumed demand-curve shape and on whether demand stochasticity is “additive” or “multiplicative”. Besides presenting a comprehensive set of answers on the comparative performance of dollar- and percentagemarkups, our results also highlight the often overlooked importance of choosing between: (i) dollar- and percentage-markup; and (ii) the formats of the assumed stochasticity and demand curves.     

Safety and waste considerations in donated blood screening

We study an important problem faced by Blood Centers, of selecting screening tests for donated blood to reduce the risk of “transfusion-transmitted infectious diseases” (TTIs), including the human immunodeficiency virus (HIV), hepatitis viruses, human T-cell lymphotropic virus, syphilis, West Nile Virus, and Chagas’ Disease. This decision has a significant impact on health care quality in both developed and developing countries. The budget-constrained decision-maker needs to construct a portfolio of screening tests, from a set of available tests, each with given efficacy (sensitivity and specificity) and cost, to administer to each unit of donated blood so as to minimize the “risk” of a TTI for blood classified as “infection-free.” While doing this, it is critical, for a viable blood system, that the decision-maker does not falsely (i.e., through screening error) discard too much of the infection-free blood (“waste”). We construct mathematical models of this decision problem, considering the various objective functions (minimization of the TTI risk or the weighted TTI risk) and various constraints (on budget and wasted blood) relevant in practice. Our work generates insights on the test selection problem. We show, for example, that a reduction in risk does not necessarily come at the expense of an increase in waste. This underscores the importance of considering these different metrics in decision-making through an optimization-based model. Our work also highlights the importance of generating region-specific testing schemes that explicitly take into account the regional prevalence and co-infection rates, along with the impacts of the infections on the society and individuals.     

Reviving Pólya's “Look Back” in a Singapore school

This study is based on the stance that Pólya's “Look Back,” though understudied, remains relevant to Mathematics curricula that place emphasis on problem solving. Although the Singapore Mathematics curriculum adopts the goal of teaching Look Back, research about how it is carried out in actual classroom practice is rare. In our project, we focus on a redesign of a teacher development programme that is targeted to help teachers realize Pólya's original vision of Look Back in the classroom. We report the cases of two teachers who have participated in the teacher development programme: their thinking about Look Back (through interview records) and their interpretation of Look Back in their classroom practice (through video records). By bringing these two spheres of data together, we discuss their degree of ‘buy-in’ to Look Back in the overall problem solving enterprise.     

Every composition operator is (mean) asymptotically Toeplitz

Nazarov and Shapiro recently showed that, while composition operators on the Hardy space H² can only trivially be Toeplitz, or even “Toeplitz plus compact,” it is an interesting problem to determine which of them can be “asymptotically Toeplitz.” I show here that if “asymptotically” is interpreted in, for example, the Cesàro (C,α) sense (α>0), then every composition operator on H² becomes asymptotically Toeplitz.     

On semilocally simply connected spaces

The purpose of this paper is: (i) to construct a space which is semilocally simply connected in the sense of Spanier even though its Spanier group is non-trivial; (ii) to propose a modification of the notion of a Spanier group so that via the modified Spanier group semilocal simple connectivity can be characterized; and (iii) to point out that with just a slightly modified definition of semilocal simple connectivity which is sometimes also used in literature, the classical Spanier group gives the correct characterization within the general class of path-connected topological spaces.While the condition “semilocally simply connected” plays a crucial role in classical covering theory, in generalized covering theory one needs to consider the condition “homotopically Hausdorff” instead. The paper also discusses which implications hold between all of the abovementioned conditions and, via the modified Spanier groups, it also unveils the weakest so far known algebraic characterization for the existence of generalized covering spaces as introduced by Fischer and Zastrow. For most of the implications, the paper also proves the non-reversibility by providing the corresponding examples. Some of them rely on spaces that are newly constructed in this paper.     

Further improvements on the designed minimum distance of algebraic geometry codes

In the literature about algebraic geometry codes one finds a lot of results improving Goppa’s minimum distance bound. These improvements often use the idea of “shrinking” or “growing” the defining divisors of the codes under certain technical conditions. The main contribution of this article is to show that most of these improvements can be obtained in a unified way from one (rather simple) theorem. Our result does not only simplify previous results but it also improves them further.     

Arithmetic partial differential equations, I

We develop an arithmetic analogue of linear partial differential equations in two independent “space-time” variables. The spatial derivative is a Fermat quotient operator, while the time derivative is the usual derivation. This allows us to “flow” integers or, more generally, points on algebraic groups with coordinates in rings with arithmetic flavor. In particular, we show that elliptic curves carry certain canonical “arithmetic flows” that are arithmetic analogues of the convection, heat, and wave equations, respectively. The same is true for the additive and the multiplicative group.