Algebra Commons^™

Test Retakes In Introductory Math Courses, John Hird, Chris Mcclain

2026 Scholarly Teaching Conference: Poster Session Papers

In this poster, we describe the implementation of an exam retake model using specifications grading for math courses taken by non-STEM majors. This system was implemented by two faculty members over three years in two sequential courses. During that time, we tried several versions of allowed retakes, with varying restrictions on partial credit. Some of the challenges that we faced were scaling the system for use by different faculty members and with different courses, managing faculty workload on writing and grading multiple exams, and managing student expectations.

Studies On The Depth Formula And On Reducing Dimensions, Brian Mccourt Laverty

Graduate Theses, Dissertations, and Problem Reports (ETD)

This dissertation presents the author’s recent research, conducted under the supervision of Professor Olgur Celikbas, and based on two articles—one published and one in progress. These works develop two closely related research directions in commutative algebra. Together, they contribute to the subject by addressing aspects of existing conjectures, establishing new results, and introducing methods for studying homological invariants.

The first research direction concerns the depth formula, namely the equality \[ \depth_R(M)+\depth_R(N)=\depth(R)+\depth_R(M\otimes_RN) \] where $M$ and $N$ are finitely generated $R$-modules. A classical result of Auslander \cite{Aus} shows that the depth formula holds provided that either $M$ or $N$ has finite …

When The Gorenstein Projective Modules Are Precovering: A Survey On The Existence Of The Gorenstein Projective Precovers, Alexis L. Mcburney

College of Graduate Studies: Theses & Dissertations

This thesis surveys known results on the existence of Gorenstein projective precovers and studies conditions under which the class of Gorenstein projective modules is precovering. In classical homological algebra, projective resolutions are used to study modules, while relative homological algebra replaces projective modules with a different class that must be precovering for resolutions to exist. Gorenstein homological algebra extends these ideas using Gorenstein projective modules. We review key developments by Jorgensen, Murfet and Salarian, Estrada, Iacob, and Yeomans, and Cortés and Saroch. We discuss the strongest known existence result, showing that Gorenstein projective precovers exist under suitable conditions; in particular, …

Free Probability Theory Over The Scaled Hyperbolic Numbers, Daniel Alpay, Ilwoo Choo

Mathematics, Physics, and Computer Science Faculty Articles and Research

In this paper, we introduce a notion of free probability over the scaled hyperbolic numbers. Scaled hypercomplex numbers {D_t} _t∈R are constructed as sub-structures of scaled hypercomplex numbers {H_t} _t∈R under the scales (or, the moments) of the set R of real numbers.We show that if t < 0, then the classical free probability theory covers our free probability on {D_t} _{t< 0}; if t > 0, then our free probability on {D_t} _t>0 is represented by the free probability over the classical hyperbolic numbers D = D₁; and if t = 0, then the free probability on D₀ is actually over the …

(R2127) On 2-Absorbing Hesitant Primary Fuzzy Ideals Of Rings, B. Anitha, M. Vidhya

Applications and Applied Mathematics: An International Journal (AAM)

By presenting 2-absorbing hesitant primary fuzzy ideals, we begin the investigation of a generalisation of hesitant primary fuzzy ideals (HPRFI) in rings in this research. The concepts of a weakly completely 2-absorbing hesitant primary fuzzy ideal (WC2-AHPRFI) and a Weakly completely 2-absorbing hesitant fuzzy ideal (WC2-AHFI) are developed, and their structural features and attributes are examined. We introduce the idea of a 2-absorbing hesitant K-fuzzy ideal (2-AHK-FI), 2-absorbing hesitant K-primary fuzzy ideal (2-AHK-PRFI) and examine a few of its characteristics.

(R2094) On Mds Bisymmetric Rhotrices Using Self-Dual Bases And Conjugate Elements Of Finite Fields, Shalini Gupta, Ruchi Narang, Manpreet Singh

Applications and Applied Mathematics: An International Journal (AAM)

Bisymmetric matrices have wide range of applications in statistics, engineering problems, information theory and computer science including coding theory and cryptography. In cryptography, a rhotrix being a couple matrix doubles the security of the cryptosystem. Here, we construct maximum distance separable (MDS) bisymmetric rhotrices using self-dual bases and conjugate elements of finite fields. MDS rhotrices are very crucial for the designing of block ciphers and hash functions in cryptography.

A Leslie System For A Demographic Simulation: From An Actuarial Point Of View, David Kings

Electronic Theses and Dissertations

This thesis develops a discrete stochastic linear systems interpretation of age–stage demographic evolution grounded in Leslie operators and realized in a discrete-event simulation implemented with salabim. The central claim is that one annual cycle of the simulation constitutes a cone-preserving, stochastic affine transformation on a high- dimensional population state vector indexed by age, sex, marital status, household type, employment, and education, and that the composition of yearly operators yields a random matrix product whose top Lyapunov exponent is the stochastic counterpart of the Perron–Frobenius growth rate (Caswell, 2001; Tuljapurkar, 1997)[1, 2]. The actuarial bridge is constructed by mapping simulated survival …

The Kaczmarz Algorithm In Hilbert C*-Modules, Daniel Alpay, Chad Berner, Eric S. Weber

Mathematics, Physics, and Computer Science Faculty Articles and Research

The Kaczmarz algorithm in Hilbert spaces is a classical iterative method for stably recovering vectors from inner product data. In this paper, we extend the algorithm to the setting of Hilbert C*-modules and establish analogues of its effectiveness in both finite-dimensional and stationary cases. Consequently, we demonstrate that continuous families of elements in a Hilbert space can be uniformly recovered using the Kaczmarz algorithm. Additionally, we develop a normalized Cauchy transform for continuous families of measures and use it to provide sufficient conditions under which standard frames in Hilbert C(X)-modules can be generated by the Kaczmarz …

Principal Quandles, Jesse Parrish

Electronic Theses and Dissertations

This thesis concerns principal quandles and, as a special case, Alexander quandles. A principal quandle is a coset quandle, Q(G,H, f), in which the subgroup H is trivial. If in addition the group G is abelian, then the coset quandle is called an Alexander quandle. The isomorphism types of Alexander quandles were classified [16], and some progress was made on describing the isomorphism types of principal quandles in [14] and [13]. The first part of this thesis applies the ideas used in Holmes’ paper to give a classification of the isomorphism types of principal quandles. The second …

Invitation To Polynomiography Via Chatgpt: For Teachers, Students And Artists, Bahman Kalantari

LASER Journal

Teachers, students, and artists in the United States and abroad who have encountered polynomiography, in lectures, demos, or software, consistently appreciate its educational value and artistic potential. While dedicated polynomiography programs require upkeep as systems evolve, AI chatbots now offer a practical, accessible alternative. This article invites readers to explore polynomiography with ChatGPT, broadening access beyond specialized tools. While the approach will not match the full range or polish of advanced software, it provides a powerful and flexible entry point with many possibilities.

At its core, polynomiography transforms polynomial equations, each encoding a finite set of points in the complex …

Dimension Of Subalgebras Of Fomin-Kirillov Algebras, Taro Ikeda, Sirous Homayouni

Annual Student Research Poster Session

One of the central open problems concerning the Fomin-Kirillov algebras was whether their dimension is finite or infinite. This question was recently resolved in one research by C. Barligea, where it was shown that FK(n) is infinite-dimensional for all n ≥ 6. In our work, we investigate the dimension of a certain subalgebra of FK(6).

(Si15-064) Permutation Pentanomials Over Finite Fields With Even Characteristic, Shalini Gupta, Sushil Kumar, Ashima .

Applications and Applied Mathematics: An International Journal (AAM)

Permutation polynomials over finite fields constitute an active area of research and play an important role in diverse domains, including finite geometry, combinatorial design, coding theory, and cryptography. The study of these polynomials has a long history, and many results have been obtained in recent years. This paper presents new classes of permutation pentanomials based on permutation over the unit circle of finite fields with even characteristic that contribute to the theoretical development of permutation polynomials.

How Many Symmetries Of The Regular N-Gon Are Even?, Thi Mai Khoi Ha

Rose-Hulman Undergraduate Mathematics Journal

One of the simplest classes of finite groups used as a source of counterexamples in a first course of modern algebra is the class of finite dihedral groups. Among the subgroups of dihedral group, finding subgroups of index 2 is of interest in part because these subgroups are normal subgroups. In this article, we use the representations of the symmetries of the dihedral groups as permutations of the vertices and determine concretely all its subgroups of index 2. Under this representation or embedding, the article determines the intersection of the dihedral group with the corresponding alternating groups when they are …

Sugar: A Sequence Unfolding Based Transformer Model For Group Activity Recognition, Yash U. Gondkar

Graduate Masters Theses

Large Language Models have improved significantly in the past couple of years due to the adoption of transformers. However, transformers still find it challenging to process videos due to limited context size caused by their quadratic computing cost. Therefore, we studied a booming field in machine learning which powers applications like social scene analysis and video surveillance systems called Group Activity Recognition (GAR). We found that recent models were able to achieve more than 90% accuracy on popular datasets like the Volleyball dataset, however, it turned out that even they relied on transformers.

Therefore, in this work, we developed a …

Universal Centralizers, Morita Abelianization, And Wonderful Models In Lie Theory, Peter Crooks

Funded Research Records

No abstract provided.

Career: Algebra And Representation Theory For Non-Semisimple Topological Field Theory, Matthew Young

Funded Research Records

No abstract provided.

An Exploration Of The Structure Of The Linear Algebraic Model Of Color, Isaac Martin

University Honors Theses

This thesis surveys the mathematical grounding of linear algebraic models of color. It aims to build from the ground up the framework by which additive color is broadly understood in the digital age. Primarily building on the work of Jozef Cohen, Eric Dubois, David H. Krantz, and Günter Wyszecki, it aims to chart the construction of a model of color that underpins most modern understandings of color. While the construction is certainly established in colorimetric circles, the construction is, in the thesis author's opinion, either obtuse or non-rigorous. Ideally, this thesis serves to make the construction accessible to an audience …

Constructing Code-Based Zero-Knowledge Proofs Leveraging Generic Errors And Bounded Vectors, Freeman Slaughter

All Dissertations

Quantum computing is developing at an expeditious rate, and once fully scalable quantum computers become realized, classical cryptographic systems face obsolescence. This approaching peril has prompted a paradigm shift away from pre-quantum cryptography and towards post-quantum primitives, such as those that arise from the field of coding theory. Among these, zero-knowledge proofs have emerged as a dynamic tool instrumental in constructing quantum-resilient digital signature schemes.

We being by introducing HammR, a pre-quantum zero-knowledge proof protocol designed to verify Hamming weight and entry constraints of error vectors, and comprehensively establish its security. Subsequently, we extend HammR to the multi-party computation setting, …

A Theory Of Fundamental Strata For Twisted Formal Connections, Sorawit Viwanthananut

LSU Doctoral Dissertations

Let $G$ be a complex reductive group. A fundamental stratum for $G$ is a triple $(x,r,\beta)$ where $x$ is a point in the Bruhat-Tits building of $G$, $r$ is a nonnegative real number called depth of the stratum, and $\beta$ is a semistable functional on the Moy-Prasad filtration of $\fg$ associated to $x$ at level $r$. Fundamental strata were first introduced to classify admissible representations of a $p$-adic reductive group. More recently, Bremer and Sage have shown that fundamental strata play an important role in the geometric Langlands program and developed a theory of fundamental strata for $G$-connections. In this …

Probabilities With Values In Scaled Hyperbolic Numbers, Daniel Alpay, Ilwoo Choo

Mathematics, Physics, and Computer Science Faculty Articles and Research

In this paper, we introduce a notion of a probabilistic measure which takes values in t-scaled hyperbolic numbers for t ∈ R, with a system of axioms generalizing directly Kolmogorov’s axioms. i.e., we establish a suitable measure theory in the set Dt of all t-scaled hyperbolic numbers for arbitrarily fixed t ∈ R.