Abstracts of Presentations
This study focuses on how the ‘Neutralization on an Empty Number Line’ (NNL) model can be used in a classroom to help students better understand the meaning of integer addition and subtraction. The design research methodology that was used in this study was conducted in three phases: first, a Hypothetical Learning Trajectory (HLT) was designed, second, the HLT was tried out in a classroom, and third, an analysis of how the learning process took place as well as how students developed during the lessons was carried out. Although there was little evidence on the development of students’ thinking in the classroom, a closer observation of a student helps us understand that with a thorough planning, the NNL model has the potential to help students in developing an understanding of integer addition and subtraction.
This study examined factors that influence teachers’ selection, modification and design of mathematics tasks for instruction. It comprised two phases, a qualitative survey and an interview using stimulus texts. The qualitative survey solicited the manner in which teachers select their tasks, the types of tasks they use in the classroom and the considerations behind this use. The interview using stimulus texts probed teachers thought process during task selection to teach the sub-topic, polygons. During the presentation findings of the study will be shared with participants.
Domain theory, roughly speaking, is topology done on partially ordered sets, and is hence a meeting place of Topology and Order. Being a successful theory in explaining the phenomenon of approximation in many contexts ranging from Computer Science to even linguistics, Domain Theory is very rich in itself as a field of mathematical study. In this talk, we shall look at some open problems in Domain Theory which are both interesting in their own right and important in the mainstream theoretical development.
The independence polynomial of a graph G is the polynomial where the coefficient of xk is the number of independent sets in G of cardinality k. Graphs with the same independence polynomial are called independence equivalent graphs. In this presentation, some properties of the independence polynomial will be discussed, with an emphasis on independence equivalence of trees and cyclic graphs.
We are all familiar with the epsilon-delta definition of continuity at a point. Given an equivalent definition of continuity, we would like to study the type of functions that can be obtained when a simple modification to this definition is made.
Given the numbers 1,1,2,2,3,3,4,4, how can we arrange them in a row such that there are exactly r-1 numbers between a pair of `r' where r=1,2,3,4? And is there always a way to arrange 2n numbers, 1,1,2,2,3,3,…,n,n in this way for different values of n where n∈N?
Thoralf Skolem explored this problem in his paper. My project involves rewriting his paper in a more detailed and comprehensive manner with additional theorems as extensions and addressing certain errors made in the paper. In this presentation, I will prove some of the main results and include a few computer programming codes created using Visual Basic for Applications (VBA) on Excel to demonstrate the l,+m systems for different values.
Combinatorial Identities