Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Physical Sciences and Mathematics
What Allows Teachers To Extend Student Thinking During Whole-Group Discussions, Nesrin Cengiz
What Allows Teachers To Extend Student Thinking During Whole-Group Discussions, Nesrin Cengiz
Dissertations
Research indicates that extending students' mathematical thinking during whole-group discussions is challenging, even for the most experienced teachers. That is, it is challenging for teachers to help students move beyond their initial mathematical observations and solutions during whole-group discussions. To better understand this phenomena, the teaching of six experienced elementary school teachers, who had been teaching aStandards-based curriculum for several years and had participated in a multi-year professional development project focused on that curriculum, is explored in this study. In particular, two issues are addressed: what it looks like to extend student thinking during whole-group discussions and how …
The Fock Space And Related Bergman Type Integral Operators, Ovidiu Furdui
The Fock Space And Related Bergman Type Integral Operators, Ovidiu Furdui
Dissertations
In this thesis we study the boundedness of a general class of integral operators induced by the kernel functions of Fock spaces. More precisely, for a, b, and c real parameters we study the action of [Special characters omitted.] and [Special characters omitted.] on Lp ([Special characters omitted.] ,dvs ), where dvs ( z ) = [Special characters omitted.] is the Gaussian probability measure on [Special characters omitted.] . We prove that, when p > 1, respectively p = 1, these operators are bounded if and only if p satisfies a quadratic, respectively a linear, inequality. The …
Measures Of Travers Ability In Graphs, Futaba Okamoto
Measures Of Travers Ability In Graphs, Futaba Okamoto
Dissertations
For a connected graph G of order n ≥ 3 and a cyclic ordering sc : v 1, v2,..., vn, v n+1 = v1 of vertices of G, the number d(sc) is defined by d(sc) = i=1n d(vi, vi +1), where d(vi, vi +1) is the distance between vi and vi+1 in G for 1 ≤ i ≤ n. The Hamiltonian number h(G) and upper Hamiltonian number h +(G) of G are defined as h(G) = min{d(sc)} and h+(G) = max{d(sc)}, respectively, where the minimum and maximum are taken over all cyclic orderings s c of vertices of G. For …