Open Access. Powered by Scholars. Published by Universities.®

Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 4 of 4

Full-Text Articles in Mathematics

Active Learning In Computer-Based College Algebra, Steven Boyce, Joyce O'Halloran Jan 2019

Active Learning In Computer-Based College Algebra, Steven Boyce, Joyce O'Halloran

Mathematics and Statistics Faculty Publications and Presentations

We describe the process of adjusting the balance between computerbased learning and peer interaction in a college algebra course. In our first experimental class, students used the adaptive-learning program ALEKS within an emporium-style format. Comparing student performance in the emporium format class with that in a traditional lecture format class, we found an improvement in procedural skills, but a weakness in the students’ conceptual understanding of mathematical ideas. Consequently, we shifted to a blended format, cutting back on the number of ALEKS (procedural) topics and integrating activities that fostered student discourse about mathematics concepts. In our third iteration using ALEKS, …


Cycle Structures Of Orthomorphisms Extending Partial Orthomorphisms Of Boolean Groups, Nichole Louise Schimanski, John S. Caughman Iv Sep 2016

Cycle Structures Of Orthomorphisms Extending Partial Orthomorphisms Of Boolean Groups, Nichole Louise Schimanski, John S. Caughman Iv

Mathematics and Statistics Faculty Publications and Presentations

A partial orthomorphism of a group GG (with additive notation) is an injection π:S→G for some S⊆G such that π(x)−x ≠ π(y) for all distinct x,y∈S. We refer to |S| as the size of π, and if S=G, then π is an orthomorphism. Despite receiving a fair amount of attention in the research literature, many basic questions remain concerning the number of orthomorphisms of a given group, and what cycle types these permutations have.

It is known that conjugation by automorphisms of G forms a group action on the set of orthomorphisms of G. In this paper, we consider the …


A Mixed Method For Axisymmetric Div-Curl Systems, Dylan M. Copeland, Jay Gopalakrishnan, Joseph E. Pasciak Jan 2008

A Mixed Method For Axisymmetric Div-Curl Systems, Dylan M. Copeland, Jay Gopalakrishnan, Joseph E. Pasciak

Mathematics and Statistics Faculty Publications and Presentations

We present a mixed method for a three-dimensional axisymmetric div-curl system reduced to a two-dimensional computational domain via cylindrical coordinates. We show that when the meridian axisymmetric Maxwell problem is approximated by a mixed method using the lowest order Nédélec elements (for the vector variable) and linear elements (for the Lagrange multiplier), one obtains optimal error estimates in certain weighted Sobolev norms. The main ingredient of the analysis is a sequence of projectors in the weighted norms satisfying some commutativity properties.


Polynomial Extension Operators. Part I, Leszek Demkowicz, Jay Gopalakrishnan, Joachim Schöberl Jan 2008

Polynomial Extension Operators. Part I, Leszek Demkowicz, Jay Gopalakrishnan, Joachim Schöberl

Mathematics and Statistics Faculty Publications and Presentations

In this series of papers, we construct operators that extend certain given functions on the boundary of a tetrahedron into the interior of the tetrahedron, with continuity properties in appropriate Sobolev norms. These extensions are novel in that they have certain polynomial preservation properties important in the analysis of high order finite elements. This part of the series is devoted to introducing our new technique for constructing the extensions, and its application to the case of polynomial extensions from H½(∂K) into H¹(K), for any tetrahedron K.