Algebra Commons^™

Integrating Mathematics And Educational Robotics: Simple Motion Planning, Ronald I. Greenberg, George K. Thiruvathukal, Sara T. Greenberg

Computer Science: Faculty Publications and Other Works

This paper shows how students can be guided to integrate elementary mathematical analyses with motion planning for typical educational robots. Rather than using calculus as in comprehensive works on motion planning, we show students can achieve interesting results using just simple linear regression tools and trigonometric analyses. Experiments with one robotics platform show that use of these tools can lead to passable navigation through dead reckoning even if students have limited experience with use of sensors, programming, and mathematics.

Does Teaching The History Of Mathematics In High School Aid In Student Understanding?, Anne Campbell

Undergraduate Honors Thesis Projects

This research will study the effect teaching the history of mathematics in a high school classroom has on student understanding. To accomplish this, lessons both including and excluding historical background on different topics were taught in an Honors Algebra 2 class in the high school setting. This research aims to engage student learning and investigation of topics that normally do not draw a lot of student focus and spark a new or revived interest in mathematics for students by broadening lessons to include material of which students would not otherwise be exposed. The lessons themselves aim to engage other current …

Monoidal Supercategories And Superadjunction, Dene Lepine

Rose-Hulman Undergraduate Mathematics Journal

We define the notion of superadjunction in the context of supercategories. In particular, we give definitions in terms of counit-unit superadjunctions and hom-space superadjunctions, and prove that these two definitions are equivalent. These results generalize well-known statements in the non-super setting. In the super setting, they formalize some notions that have recently appeared in the literature. We conclude with a brief discussion of superadjunction in the language of string diagrams.

Strengthening Relationships Between Neural Ideals And Receptive Fields, Angelique Morvant

Rose-Hulman Undergraduate Mathematics Journal

Neural codes are collections of binary vectors that represent the firing patterns of neurons. The information given by a neural code C can be represented by its neural ideal J_C. In turn, the polynomials in J_C can be used to determine the relationships among the receptive fields of the neurons. In a paper by Curto et al., three such relationships, known as the Type 1-3 relations, were linked to the neural ideal by three if-and-only-if statements. Later, Garcia et al. discovered the Type 4-6 relations. These new relations differed from the first three in that they were …

Parametric Natura Morta, Maria C. Mannone

The Transdisciplinary STEAM+ Journal

Parametric equations can also be used to draw fruits, shells, and a cornucopia of a mathematical still life. Simple mathematics allows the creation of a variety of shapes and visual artworks, and it can also constitute a pedagogical tool for students.

Positivity, Rational Schur Functions, Blaschke Factors, And Other Related Results In The Grassmann Algebra, Daniel Alpay, Ismael L. Paiva, Daniele C. Struppa

Mathematics, Physics, and Computer Science Faculty Articles and Research

We begin a study of Schur analysis in the setting of the Grassmann algebra when the latter is completed with respect to the 1-norm. We focus on the rational case. We start with a theorem on invertibility in the completed algebra, and define a notion of positivity in this setting. We present a series of applications pertaining to Schur analysis, including a counterpart of the Schur algorithm, extension of matrices and rational functions. Other topics considered include Wiener algebra, reproducing kernels Banach modules, and Blaschke factors.

Logics For Rough Concept Analysis, Giuseppe Greco, Peter Jipsen, Krishna Manoorkar, Alessandra Palmigiano, Apostolos Tzimoulis

Mathematics, Physics, and Computer Science Faculty Books and Book Chapters

Taking an algebraic perspective on the basic structures of Rough Concept Analysis as the starting point, in this paper we introduce some varieties of lattices expanded with normal modal operators which can be regarded as the natural rough algebra counterparts of certain subclasses of rough formal contexts, and introduce proper display calculi for the logics associated with these varieties which are sound, complete, conservative and with uniform cut elimination and subformula property. These calculi modularly extend the multi-type calculi for rough algebras to a ‘nondistributive’ (i.e. general lattice-based) setting.

A Re-Emergent Analysis Of Early Algebraic Learning, Steven Boyce, Diana Moss

Extension Research

In this paper, we discuss a novel approach for collaborative retrospective analysis. One researcher was directly involved in a classroom teaching experiment, adopting an emergent perspective as an interpreter-witness of classroom interactions during a four-week algebra instructional unit with sixth-grade students. The other researcher experienced and analyzed the data in reverse chronological order. We describe how this re-emergent perspective revealed aspects of students’ early algebraic reasoning.

Positive And Generalized Positive Real Lemma For Slice Hyperholomorphic Functions, Daniel Alpay, Fabrizio Colombo, Izchak Lewkowicz, Irene Sabadini

Mathematics, Physics, and Computer Science Faculty Articles and Research

In this paper we prove a quaternionic positive real lemma as well as its generalized version, in case the associated kernel has negative squares for slice hyperholomorphic functions. We consider the case of functions with positive real part in the half space of quaternions with positive real part, as well as the case of (generalized) Schur functions in the open unit ball.

Distribution Spaces And A New Construction Of Stochastic Processes Associated With The Grassmann Algebra, Daniel Alpay, Ismael L. Paiva, Daniele C. Struppa

Mathematics, Physics, and Computer Science Faculty Articles and Research

We associate with the Grassmann algebra a topological algebra of distributions, which allows the study of processes analogous to the corresponding free stochastic processes with stationary increments, as well as their derivatives.

The Explicit Formula And A Motivic Splitting, David P. Roberts

Mathematics Publications

We apply the Guinand-Weil-Mestre explicit formula to resolve two questions about how a certain hypergeometric motive splits into two irreducible motives.

Leibniz Algebras As Non-Associative Algebras, Jorg Feldvoss

University Faculty and Staff Publications

In this paper we define the basic concepts for left or right Leibniz algebras and prove some of the main results. Our proofs are often variations of the known proofs but several results seem to be new.

Counting And Coloring Sudoku Graphs, Kyle Oddson

Mathematics and Statistics Dissertations, Theses, and Final Project Papers

A sudoku puzzle is most commonly a 9 × 9 grid of 3 × 3 boxes wherein the puzzle player writes the numbers 1 - 9 with no repetition in any row, column, or box. We generalize the notion of the n² × n² sudoku grid for all n ∈ ℤ^≥2 and codify the empty sudoku board as a graph. In the main section of this paper we prove that sudoku boards and sudoku graphs exist for all such n; we prove the equivalence of [3]'s construction using unions and products of graphs to the definition of …

Decidability For Residuated Lattices And Substructural Logics, Gavin St. John

Electronic Theses and Dissertations

We present a number of results related to the decidability and undecidability of various varieties of residuated lattices and their corresponding substructural logics. The context of this analysis is the extension of residuated lattices by various simple equations, dually, the extension of substructural logics by simple structural rules, with the aim of classifying simple equations by the decidability properties shared by their extensions. We also prove a number of relationships among simple extensions by showing the equational theory of their idempotent semiring reducts coincides with simple extensions of idempotent semirings. On the decidability front, we develop both semantical and syntactical …

Enhancing The Quandle Coloring Invariant For Knots And Links, Karina Elle Cho

HMC Senior Theses

Quandles, which are algebraic structures related to knots, can be used to color knot diagrams, and the number of these colorings is called the quandle coloring invariant. We strengthen the quandle coloring invariant by considering a graph structure on the space of quandle colorings of a knot, and we call our graph the quandle coloring quiver. This structure is a categorification of the quandle coloring invariant. Then, we strengthen the quiver by decorating it with Boltzmann weights. Explicit examples of links that show that our enhancements are proper are provided, as well as background information in quandle theory.

Spacetime Groups, Ian M. Anderson, Charles G. Torre

Publications

A spacetime group is a connected 4-dimensional Lie group G endowed with a left invariant Lorentz metric h and such that the connected component of the isometry group of h is G itself. The Newman-Penrose formalism is used to give an algebraic classification of spacetime groups, that is, we determine a complete list of inequivalent spacetime Lie algebras, which are pairs (g,η), with g being a 4-dimensional Lie algebra and η being a Lorentzian inner product on g. A full analysis of the equivalence problem for spacetime Lie algebras is given which leads to a completely algorithmic solution to the …

The State Of Lexicodes And Ferrers Diagram Rank-Metric Codes, Jared E. Antrobus

Theses and Dissertations--Mathematics

In coding theory we wish to find as many codewords as possible, while simultaneously maintaining high distance between codewords to ease the detection and correction of errors. For linear codes, this translates to finding high-dimensional subspaces of a given metric space, where the induced distance between vectors stays above a specified minimum. In this work I describe the recent advances of this problem in the contexts of lexicodes and Ferrers diagram rank-metric codes.

In the first chapter, we study lexicodes. For a ring R, we describe a lexicographic ordering of the left R-module Rⁿ. With this …

An Invitation To Linear Algebra, David N. Pham, Jonathon Funk, Wenjian Liu

Open Educational Resources

This is an OER textbook on linear algebra.

Homological Constructions Over A Ring Of Characteristic 2, Michael S. Nelson

College of Graduate Studies: Theses & Dissertations

We study various homological constructions over a ring $R$ of characteristic $2$. We construct chain complexes over a field $K$ of characteristic $2$ using polynomials rings and partial derivatives. We also provide a link from the homology of these chain complexes to the simplicial homology of simplicial complexes. We end by showing how to construct all finitely-generated commutative differential graded $R$-algebras using polynomial rings and partial derivatives.

Basis Reduction In Lattice Cryptography, Raj Kane

Honors Theses

We develop an understanding of lattices and their use in cryptography. We examine how reducing lattice bases can yield solutions to the Shortest Vector Problem and the Closest Vector Problem.