Algebra Commons^™

Concurrent Kleene Algebra With Tests And Branching Automata, Peter Jipsen, M. Andrew Moshier

Mathematics, Physics, and Computer Science Faculty Articles and Research

We introduce concurrent Kleene algebra with tests (CKAT) as a combination of Kleene algebra with tests (KAT) of Kozen and Smith with concurrent Kleene algebras (CKA), introduced by Hoare, Möller, Struth and Wehrman. CKAT provides a relatively simple algebraic model for reasoning about semantics of concurrent programs. We generalize guarded strings to guarded series-parallel strings , or gsp-strings, to give a concrete language model for CKAT. Combining nondeterministic guarded automata of Kozen with branching automata of Lodaya and Weil one obtains a model for processing gsp-strings in parallel. To ensure that the model satisfies the weak exchange law (x‖y)(z‖w)≤(xz)‖(yw) of …

On The Construction Of Simply Connected Solvable Lie Groups, Mark E. Fels

Research Vignettes

This worksheet contains the implementation of Theorems 4.2, 5.4 and 5.7 in the paper On the Construction of Solvable Lie Groups. All the examples in the paper are demonstrated here, along with one in Section 6 that was too long to include in the article.

Non-Commutative Holomorphic Functions On Operator Domains, Jim Agler, John E. Mccarthy

Mathematics Faculty Publications

We characterize functions of d-tuples of bounded operators on a Hilbert space that are uniformly approximable by free polynomials on balanced open sets.

Constructions And Isomorphism Types Of Images, Jessica Luna Ramirez

Electronic Theses, Projects, and Dissertations

In this thesis, we have presented our discovery of true finite homomorphic images of various permutation and monomial progenitors, such as 2^*7: D₁₄, 2^*7 : (7 : 2), 2^*6 : S₃ x 2, 2^*8: S₄, 2*⁷²: (3²:(2S₄)), and 11^*2 :_m D₁₀. We have given delightful symmetric presentations and very nice permutation representations of these images which include, the Mathieu groups M₁₁, M₁₂, the 4-fold cover of the Mathieu group M₂₂, 2 x …

Galois 2-Extensions, Masoud Ataei Jaliseh

Electronic Thesis and Dissertation Repository

The inverse Galois problem is a major question in mathematics. For a given base field and a given finite group $G$, one would like to list all Galois extensions $L/F$ such that the Galois group of $L/F$ is $G$.

In this work we shall solve this problem for all fields $F$, and for group $G$ of unipotent $4 \times 4$ matrices over $\mathbb{F}_2$. We also list all $16$ $U_4 (\mathbb{F}_2)$-extensions of $\mathbb{Q}_2$. The importance of these results is that they answer the inverse Galois problem in some specific cases.

This is joint work with J\'an Min\'a\v{c} and Nguyen Duy T\^an.

Review: The Classical Hom-Yang-Baxter Equation And Hom-Lie Bialgebras, Gizem Karaali

Pomona Faculty Publications and Research

No abstract provided.

Generating All Finite Modular Lattices Of A Given Size, Peter Jipsen, Nathan Lawless

Mathematics, Physics, and Computer Science Faculty Articles and Research

Modular lattices, introduced by R. Dedekind, are an important subvariety of lattices that includes all distributive lattices. Heitzig and Reinhold [8] developed an algorithm to enumerate, up to isomorphism, all finite lattices up to size 18. Here we adapt and improve this algorithm to construct and count modular lattices up to size 24, semimodular lattices up to size 22, and lattices of size 19. We also show that 2 ⁿ⁻³ is a lower bound for the number of nonisomorphic modular lattices of size n.

Intermediate Algebra, Michael Goodroe, Berhanu Kidane, Julian Allagan, John Williams

Mathematics Grants Collections

This Grants Collection for Intermediate Algebra was created under a Round Two ALG Textbook Transformation Grant.

Affordable Learning Georgia Grants Collections are intended to provide faculty with the frameworks to quickly implement or revise the same materials as a Textbook Transformation Grants team, along with the aims and lessons learned from project teams during the implementation process.

Documents are in .pdf format, with a separate .docx (Word) version available for download. Each collection contains the following materials:

• Linked Syllabus
• Initial Proposal
• Final Report

Foundations For College Algebra, Michael Goodroe, Berhanu Kidane, Julian Allagan, John Williams

Mathematics Grants Collections

This Grants Collection for Foundations for College Algebra was created under a Round Two ALG Textbook Transformation Grant.

Affordable Learning Georgia Grants Collections are intended to provide faculty with the frameworks to quickly implement or revise the same materials as a Textbook Transformation Grants team, along with the aims and lessons learned from project teams during the implementation process.

Documents are in .pdf format, with a separate .docx (Word) version available for download. Each collection contains the following materials:

• Linked Syllabus
• Initial Proposal
• Final Report

College Algebra (University Of North Georgia), Michael Goodroe, Berhanu Kidane, Julian Allagan, John Williams

Mathematics Grants Collections

This Grants Collection Open Textbook for College Algebra was created under a Round Two ALG Textbook Transformation Grant.

Affordable Learning Georgia Grants Collections are intended to provide faculty with the frameworks to quickly implement or revise the same materials as a Textbook Transformation Grants team, along with the aims and lessons learned from project teams during the implementation process.

Documents are in .pdf format, with a separate .docx (Word) version available for download. Each collection contains the following materials:

• Linked Syllabus
• Initial Proposal
• Final Report

Support For College Algebra, Michael Goodroe, Berhanu Kidane, Julian Allagan, John Williams

Mathematics Grants Collections

This Grants Collection for Support for College Algebra was created under a Round Two ALG Textbook Transformation Grant.

Affordable Learning Georgia Grants Collections are intended to provide faculty with the frameworks to quickly implement or revise the same materials as a Textbook Transformation Grants team, along with the aims and lessons learned from project teams during the implementation process.

Documents are in .pdf format, with a separate .docx (Word) version available for download. Each collection contains the following materials:

• Linked Syllabus
• Initial Proposal
• Final Report

Candy Crush Combinatorics, Dana Rowland

Mathematics Faculty Publications

In the popular game Candy Crush, differently colored candies are arranged in a grid and a player swaps adjacent candies in order to crush them by lining up three or more of the same color. At the beginning of each game, the grid cannot have three consecutive candies of the same color in a row or column, but it must be possible to swap two adjacent candies in order to get at least three consecutive candies of the same color. How many starting configurations are there? We derive recurrence relations to answer this question for a single line of candy, …

Geometric Constructions From An Algebraic Perspective, Betzabe Bojorquez

Electronic Theses, Projects, and Dissertations

Many topics that mathematicians study at times seem so unrelated such as Geometry and Abstract Algebra. These two branches of math would seem unrelated at first glance. I will try to bridge Geometry and Abstract Algebra just a bit with the following topics. We can be sure that after we construct our basic parallel and perpendicular lines, bisected angles, regular polygons, and other basic geometric figures, we are actually constructing what in geometry is simply stated and accepted, because it will be proven using abstract algebra. Also we will look at many classic problems in Geometry that are not possible …

On Dedekind’S “Über Die Permutationen Des Körpers Aller Algebraischen Zahlen", Joseph Jp Arsenault Jr

Electronic Theses and Dissertations

We provide an analytic read-through of Richard Dedekind's 1901 article “Über die Permutationen des Körpers aller algebraischen Zahlen," describing the principal results concerning infinite Galois theory from both Dedekind's point of view and a modern perspective, noting an apparently uncorrected error in the supplement to the article in the Collected Works. As there is no published English-language translation of the article, we provide an annotated original translation.

Combinatorial Polynomial Identity Theory, Mayada Khalil Shahada

Electronic Thesis and Dissertation Repository

This dissertation consists of two parts. Part I examines certain Burnside-type conditions on the multiplicative semigroup of an (associative unital) algebra $A$.

A semigroup $S$ is called $n$-collapsing if, for every $a_1,\ldots, a_n \in S$, there exist functions $f\neq g$ on the set $\{1,2,\ldots,n\}$ such that \begin{center} $s_{f(1)}\cdots s_{f(n)} = s_{g(1)}\cdots s_{g(n)}$. \end{center} If $f$ and $g$ can be chosen independently of the choice of $s_1,\ldots,s_n$, then $S$ satisfies a semigroup identity. A semigroup $S$ is called $n$-rewritable if $f$ and $g$ can be taken to be permutations. Semple and Shalev extended Zelmanov's Fields Medal writing solution of the Restricted …

The Design And Validation Of A Group Theory Concept Inventory, Kathleen Mary Melhuish

Dissertations and Theses

Within undergraduate mathematics education, there are few validated instruments designed for large-scale usage. The Group Concept Inventory (GCI) was created as an instrument to evaluate student conceptions related to introductory group theory topics. The inventory was created in three phases: domain analysis, question creation, and field-testing. The domain analysis phase included using an expert consensus protocol to arrive at the topics to be assessed, analyzing curriculum, and reviewing literature. From this analysis, items were created, evaluated, and field-tested. First, 383 students answered open-ended versions of the question set. The questions were converted to multiple-choice format from these responses and disseminated …

Generalizations And Algebraic Structures Of The Grøstl-Based Primitives, Dmitriy Khripkov, Nicholas Lacasse, Bai Lin, Michelle Mastrianni, Liljana Babinkostova (Mentor)

Idaho Conference on Undergraduate Research

With the large scale proliferation of networked devices ranging from medical implants like pacemakers and insulin pumps, to corporate information assets, secure authentication, data integrity and confidentiality have become some of the central goals for cybersecurity. Cryptographic hash functions have many applications in information security and are commonly used to verify data authenticity. Our research focuses on the study of the properties that dictate the security of a cryptographic hash functions that use Even-Mansour type of ciphers in their underlying structure. In particular, we investigate the algebraic design requirements of the Grøstl hash function and its generalizations. Grøstl is an …

The Impact Of A Quantitative Reasoning Instructional Approach To Linear Equations In Two Variables On Student Achievement And Student Thinking About Linearity, Paul Thomas Belue

Boise State University Theses and Dissertations

A control group and an experimental group of college students at a community college in the Pacific Northwest were taught a unit on linear equations in two variables. The control group was taught using a traditional instructional approach that focused on learning procedures and the experimental group was taught using a quantitative reasoning instructional approach that focused on learning proportional and functional reasoning. Both groups were then given the same unit assessment that had 10 procedural understanding items and 10 conceptual understanding items related to linear equations in two variables. The assessment was given to determine the impact of the …

The Congruence-Based Zero-Divisor Graph, Elizabeth Fowler Lewis

Doctoral Dissertations

Let R be a commutative ring with nonzero identity and ~ a multiplicative congruence relation on R. Then, R/~ is a semigroup with multiplication [x][y] = [xy], where [x] is the congruence class of an element x of R. We define the congruence-based zero-divisor graph of R ito be the simple graph with vertices the nonzero zero-divisors of R/~ and with an edge between distinct vertices [x] and [y] if and only if [x][y] = [0]. Examples include the usual …

Systems Of Parameters And The Cohen-Macaulay Property, Katharine Shultis

Department of Mathematics: Dissertations, Theses, and Student Research

Let R be a commutative, Noetherian, local ring and M a finitely generated R-module. Consider the module of homomorphisms Hom_R(R/a,M/bM) where b [subset of] a are parameter ideals of M. When M = R and R is Cohen-Macaulay, Rees showed that this module of homomorphisms is isomorphic to R/a, and in particular, a free module over R/a of rank one. In this work, we study the structure of such modules of homomorphisms for a not necessarily Cohen-Macaulay R-module M.

A System Of Equations: Mathematics Lessons In Classical Literature, Valery F. Ochkov, Andreas Look

Journal of Humanistic Mathematics

The aim of this paper is to showcase a handful of mathematical challenges found in classical literature and to offer possible ways of integrating classical literature in mathematics lessons. We analyze works from a range of authors such as Jules Verne, Anton Chekhov, and others. We also propose ideas for further tasks. Most of the problems can be restated in terms of simple mathematical equations, and they can often be solved without a computer. Nevertheless, we use the computer program Mathcad to solve the problems and to illustrate the solutions to enhance the reader’s mathematical experience.

Linear Algebra, Daniel Scully

Math Faculty Publications

Table of Contents:

1. Systems of Linear Equations and Matrices

• Systems of Linear Equations
• Elementary Row Operations
• Row Reduction and Reduced Row-Echelon Form
• Solutions of Systems of Linear Equations
• Matrix Operations
• Matrix Inverses

2. Euclidean 2-Space and 3-Space

• Vectors in the Plane and in Space
• The Dot Product
• Cross Product
• Lines in Space
• Planes in Space

3. Determinants

• The Definition of Determinant
• Elementary Row Operations and the Determinant
• Elementary Matrices and the Determinant
• Applications of the Determinant

4. Vector Spaces and Subspaces

• Vector Spaces
• Subspaces
• Linear Dependence and Independence
• Basis and Dimension

5. Linear Transformations

• Definition of Linear Transformation
• The …

Tame Filling Functions And Closure Properties, Anisah Nu'man

Department of Mathematics: Dissertations, Theses, and Student Research

Let G be a group with a finite presentation P = such that A is inverse- closed. Let f : N[1/4] → N[1/4] be a nondecreasing function. Loosely, f is an intrinsic tame filling function for (G;P) if for every word w over A* that represents the identity element in G, there exists a van Kampen diagram Δ for w over P and a continuous choice of paths from the basepoint * of Δ to points on the boundary of Δ such that the paths are steadily moving outward as measured by f. The isodiametric function (or intrinsic diameter function) …

Expectation Numbers Of Cyclic Groups, Miriam Mahannah El-Farrah

Masters Theses & Specialist Projects

When choosing k random elements from a group the kth expectation number is the expected size of the subgroup generated by those specific elements. The main purpose of this thesis is to study the asymptotic properties for the first and second expectation numbers of large cyclic groups. The first chapter introduces the kth expectation number. This formula allows us to determine the expected size of any group. Explicit examples and computations of the first and second expectation number are given in the second chapter. Here we show example of both cyclic and dihedral groups. In chapter three we discuss arithmetic …

Algorithms To Compute Characteristic Classes, Martin Helmer

Electronic Thesis and Dissertation Repository

In this thesis we develop several new algorithms to compute characteristics classes in a variety of settings. In addition to algorithms for the computation of the Euler characteristic, a classical topological invariant, we also give algorithms to compute the Segre class and Chern-Schwartz-MacPherson (CSM) class. These invariants can in turn be used to compute other common invariants such as the Chern-Fulton class (or the Chern class in smooth cases).

We begin with subschemes of a projective space over an algebraically closed field of characteristic zero. In this setting we give effective algorithms to compute the CSM class, Segre class and …

Mat-Rix-Toe: Improving Writing Through A Game-Based Project In Linear Algebra, Adam Graham-Squire, Elin Farnell, Julianna Stockton

Elin R Farnell

The Mat-Rix-Toe project utilizes a matrix-based game to deepen students’ understanding of linear algebra concepts and strengthen students’ ability to express themselves mathematically. The project was administered in three classes using slightly different approaches, each of which included some editing component to encourage the improvement of the students’ mathematical thinking and writing. Differences in the implementation of the project illustrate the benefits and drawbacks of various methods of editing in the mathematics classroom and highlight recommendations for improvements in future implementations of the project.

Spacetime Algebra As A Powerful Tool For Electromagnetism, Justin Dressel, Konstantin Y. Bliokh, Franco Nori

Mathematics, Physics, and Computer Science Faculty Articles and Research

We present a comprehensive introduction to spacetime algebra that emphasizes its practicality and power as a tool for the study of electromagnetism. We carefully develop this natural (Clifford) algebra of the Minkowski spacetime geometry, with a particular focus on its intrinsic (and often overlooked) complex structure. Notably, the scalar imaginary that appears throughout the electromagnetic theory properly corresponds to the unit 4-volume of spacetime itself, and thus has physical meaning. The electric and magnetic fields are combined into a single complex and frame-independent bivector field, which generalizes the Riemann-Silberstein complex vector that has recently resurfaced in studies of the single …

Characterization Of Gamma Hemirings By Generalized Fuzzy Gamma Ideals, Muhammad Gulistan, Muhammad Shahzad, Sarfraz Ahmed, Mehwish Ilyas

Applications and Applied Mathematics: An International Journal (AAM)

This paper has explored theoretical methods of evaluation in the identification of the boundedness of the generalized fuzzy gamma ideals. A functional approach was used to undertake a characterization of this structure leading to a determination of some interesting gamma hemirings theoretic properties of the generated structures. Gamma hemirings are the generalization of the classical agebraic structure of hemirings. Our aim is to extend this idea and, to introduce the concept of generalized fuzzy gamma ideals, generalized fuzzy prime (semiprime) gamma ideals, generalized fuzzy h -gamma ideals and generalized fuzzy k - gamma ideals of gamma hemirings and related properties …

On Factorization Of A Special Type Of Vandermonde Rhotrix, P. L. Sharma, Satish Kumar, Mansi Rehan

Applications and Applied Mathematics: An International Journal (AAM)

Vandermonde matrices have important role in many branches of applied mathematics such as combinatorics, coding theory and cryptography. Some authors discuss the Vandermonde rhotrices in the literature for its mathematical enrichment. Here, we introduce a special type of Vandermonde rhotrix and obtain its LR factorization namely left and right triangular factorization, which is further used to obtain the inverse of the rhotrix.

Dihedral-Like Constructions Of Automorphic Loops, Mouna Ramadan Aboras

Electronic Theses and Dissertations

In this dissertation we study dihedral-like constructions of automorphic loops. Automorphic loops are loops in which all inner mappings are automorphisms. We start by describing a generalization of the dihedral construction for groups. Namely, if (G , +) is an abelian group, m > 1 and α ∈2 Aut(G ), let Dih(m, G, α) on Z_m × G be defined by

(i, u )(j, v ) = (i + j , ((-1)^j u + v )α^ij ).

We prove that the resulting loop is automorphic if and only if m = 2 …