Algebra Commons^™

Multi-Type Display Calculus For Propositional Dynamic Logic, Sabine Frittella, Giuseppe Greco, Alexander Kurz, Alessandra Palmigiano

Engineering Faculty Articles and Research

We introduce a multi-type display calculus for Propositional Dynamic Logic (PDL). This calculus is complete w.r.t. PDL, and enjoys Belnap-style cut-elimination and subformula property.

Tool Support For Reasoning In Display Calculi, Samuel Balco, Sabine Frittella, Giuseppe Greco, Alexander Kurz, Alessandra Palmigiano

Engineering Faculty Articles and Research

We present a tool for reasoning in and about propositional sequent calculi. One aim is to support reasoning in calculi that contain a hundred rules or more, so that even relatively small pen and paper derivations become tedious and error prone. As an example, we implement the display calculus D.EAK of dynamic epistemic logic. Second, we provide embeddings of the calculus in the theorem prover Isabelle for formalising proofs about D.EAK. As a case study we show that the solution of the muddy children puzzle is derivable for any number of muddy children. Third, there is a set of meta-tools, …

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 Research

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 …

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.

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

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

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

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

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 …

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 …

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.

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 …

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.

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 …