Papers by Jumela Sarmiento
Even with major advancements in the field of mathematics education, many students still do not at... more Even with major advancements in the field of mathematics education, many students still do not attain the learning competencies prescribed by official curricula. This may be partially explained by students’ immersion in classrooms characterized by superficial strategies or rote-learning methods. This paper reports on the design of mobile applications (apps) developed by the authors as part of an ongoing project funded by a national government agency and intended to promote structural thinking and statistical reasoning. It describes the general features of the apps, as well as the pedagogical principles upon which the apps’ designs were anchored on. These principles are grounded on research and established practices on number sense and statistical learning. Collaborations with the Philippine Department of Education for widespread implementation and sustainability are also discussed.
Journal of Combinatorial Designs, 2000
Graphs and Combinatorics, 2002
A t-ðv; k; kÞ design is a set of v points together with a collection of its k-subsets called bloc... more A t-ðv; k; kÞ design is a set of v points together with a collection of its k-subsets called blocks so that t points are contained in exactly k blocks. PGðn; qÞ, the n-dimensional projective geometry over GFðqÞ is a 2-ðq n þ q nÀ1 þ Á Á Á þ q þ 1; q 2 þ q þ 1; q nÀ2 þ q nÀ3 þ Á Á Á þ q þ 1Þ design when we take its points as the points of the design and its planes as the blocks of the design. A 2-ðv; k; kÞ design is said to be resolvable if the blocks can be partitioned as F ¼ fR 1 ; R 2 ;. .. ; R s g, where s ¼ kðv À 1Þ=ðk À 1Þ and each R i consists of v=k disjoint blocks. If a resolvable design has an automorphism r which acts as a cycle of length v on the points and F r ¼ F, then the design is said to be point-cyclically resolvable. The design consisting of points and planes of PGð5; 2Þ is shown to be point-cyclically resolvable by enumerating all inequivalent resolutions which are invariant under a cyclic automorphism group G ¼ hri where r is a cycle of length v. These resolutions are shown to be the only resolutions which admit point-transitive automorphism group.
Uploads
Papers by Jumela Sarmiento