Algebra Commons^™

Cgi (Computer Generated Imagery) Matrix Multiplication Activity, Cynthia J. Huffman Ph.D.

Open Educational Resources - Math

Many students are motivated by real world applications of mathematics, and most students are familiar with the term CGI from watching movies and playing video games. This particular activity ties matrix multiplication to CGI (Computer Generated Imagery). It has been used successfully with high school students in an Algebra II course who had just learned how to do matrix multiplication, middle school and high school students (some of whom were seeing matrix multiplication for the first time) attending a special Math Day on a university campus, and with College Algebra students (during a unit about matrices).

What Is The Shape Of A Traditional Rapanui House On Easter Island? A Multicultural Mathematical Activity Involving Ellipses, Cynthia J. Huffman Ph.D.

Open Educational Resources - Math

The Rapanui people of the island Rapa Nui, also known as Easter Island, at one time had a system of “writing” called Rongorongo. Unfortunately, the ability to read Rongorongo has since been lost. So currently archaeology and oral tradition are the only available sources for information about the early people of the island. Oral tradition states that the houses originally had upside down canoes for their roofs, and thus they are called hare paenga, or in English, boat-houses. In the literature, these boat-houses are said to be elliptical in shape. In this activity, we will investigate the shape of archaeological …

Equivalence Of Classical And Quantum Codes, Tefjol Pllaha

Theses and Dissertations--Mathematics

In classical and quantum information theory there are different types of error-correcting codes being used. We study the equivalence of codes via a classification of their isometries. The isometries of various codes over Frobenius alphabets endowed with various weights typically have a rich and predictable structure. On the other hand, when the alphabet is not Frobenius the isometry group behaves unpredictably. We use character theory to develop a duality theory of partitions over Frobenius bimodules, which is then used to study the equivalence of codes. We also consider instances of codes over non-Frobenius alphabets and establish their isometry groups. Secondly, …

Lattice Simplices: Sufficiently Complicated, Brian Davis

Theses and Dissertations--Mathematics

Simplices are the "simplest" examples of polytopes, and yet they exhibit much of the rich and subtle combinatorics and commutative algebra of their more general cousins. In this way they are sufficiently complicated --- insights gained from their study can inform broader research in Ehrhart theory and associated fields.

In this dissertation we consider two previously unstudied properties of lattice simplices; one algebraic and one combinatorial. The first is the Poincar\'e series of the associated semigroup algebra, which is substantially more complicated than the Hilbert series of that same algebra. The second is the partial ordering of the elements of …

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, …

Positivity Among P-Partition Generating Functions Of Partially Ordered Sets, Nate Lesnevich

Honors Theses

We find necessary and separate sufficient conditions for the difference between two labeled partially ordered set's (poset) partition generating functions to be positive in the fundamental basis. We define the notion of a jump sequence for a poset and show how different conditions on the jump sequences of two posets are necessary for those posets to have an order relation in the fundamental basis. Our sufficient conditions are of two types. First, we show how manipulating a poset's Hasse diagram produces a poset that is greater according to the fundamental basis. Secondly, we also provide tools to explain posets that …

Special Issue: New Types Of Neutrosophic Set/Logic/Probability, Neutrosophic Over-/Under-/ Off-Set, Neutrosophic Refined Set, And Their Extension To Plithogenic Set/Logic/ Probability, With Applications, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

No abstract provided.

The Encyclopedia Of Neutrosophic Researchers - Vol. 3, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

This is the third volume of the Encyclopedia of Neutrosophic Researchers, edited from materials offered by the authors who responded to the editor’s invitation. The authors are listed alphabetically. The introduction contains a short history of neutrosophics, together with links to the main papers and books. Neutrosophic set, neutrosophic logic, neutrosophic probability, neutrosophic statistics, neutrosophic measure, neutrosophic precalculus, neutrosophic calculus and so on are gaining significant attention in solving many real life problems that involve uncertainty, impreciseness, vagueness, incompleteness, inconsistent, and indeterminacy. In the past years the fields of neutrosophics have been extended and applied in various fields, such as: …

Neutrosophic Triplet Structures - Vol. 1, Florentin Smarandache, Memet Sahin

Branch Mathematics and Statistics Faculty and Staff Publications

Neutrosophic set has been derived from a new branch of philosophy, namely Neutrosophy. Neutrosophic set is capable of dealing with uncertainty, indeterminacy and inconsistent information. Neutrosophic set approaches are suitable to modeling problems with uncertainty, indeterminacy and inconsistent information in which human knowledge is necessary, and human evaluation is needed. Neutrosophic set theory was firstly proposed in 1998 by Florentin Smarandache, who also developed the concept of single valued neutrosophic set, oriented towards real world scientific and engineering applications. Since then, the single valued neutrosophic set theory has been extensively studied in books and monographs, the properties of neutrosophic sets …

Special Subset Vertex Multisubgraphs For Multi Networks, Florentin Smarandache, W.B. Vasantha Kandasamy, Ilanthenral K

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors study special type of subset vertex multi subgraphs; these multi subgraphs can be directed or otherwise. Another special feature of these subset vertex multigraphs is that we are aware of the elements in each vertex set and how it affects the structure of both subset vertex multisubgraphs and edge multisubgraphs. It is pertinent to record at this juncture that certain ego centric directed multistar graphs become empty on the removal of one edge, there by theorising the importance, and giving certain postulates how to safely form ego centric multi networks. Given any subset vertex multigraph we …

Special Issue: Algebraic Structures Of Neutrosophic Triplets, Neutrosophic Duplets, Or Neutrosophic Multisets, Vol. Ii, Florentin Smarandache, Xiaohong Zhang, Mumtaz Ali

Branch Mathematics and Statistics Faculty and Staff Publications

No abstract provided.

Plithogenic Fuzzy Whole Hypersoft Set, Construction Of Operators And Their Application In Frequency Matrix Multi Attribute Decision Making Technique, Florentin Smarandache, Shazia Rana, Madiha Qayyum, Muhammad Saeed, Bakhtawar Ali Khan

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, initially a matrix representation of Plithogenic Hypersoft Set (PHSS) is introduced and then with the help of this matrix some local operators for Plithogenic Fuzzy Hypersoft set (PFHSS) are developed. These local operators are used to generalize PFHSS to Plithogenic Fuzzy Whole Hypersoft set (PFWHSS). The generalized PFWHSS set is hybridization of Fuzzy Hypersoft set (which represent multiattributes and their subattributes as a combined whole membership i.e. case of having an exterior view of the event) and the Plithogenic Fuzzy Hypersoft set (in which multi attributes and their subattributes are represented with individual memberships case of having …

Positive Subreducts In Finitely Generated Varieties Of Mv-Algebras, Leonardo M. Cabrer, Peter Jipsen, Tomáš Kroupa

Mathematics, Physics, and Computer Science Faculty Articles and Research

Positive MV-algebras are negation-free and implication-free subreducts of MV-algebras. In this contribution we show that a finite axiomatic basis exists for the quasivariety of positive MV-algebras coming from any finitely generated variety of MV-algebras.

A (Co)Algebraic Approach To Hennessy-Milner Theorems For Weakly Expressive Logics, Zeinab Bakhtiari, Helle Hvid Hansen, Alexander Kurz

Engineering Faculty Articles and Research

"Coalgebraic modal logic, as in [9, 6], is a framework in which modal logics for specifying coalgebras can be developed parametric in the signature of the modal language and the coalgebra type functor T. Given a base logic (usually classical propositional logic), modalities are interpreted via so-called predicate liftings for the functor T. These are natural transformations that turn a predicate over the state space X into a predicate over TX. Given that T-coalgebras come with general notions of T-bisimilarity [11] and behavioral equivalence [7], coalgebraic modal logics are designed to respect those. In particular, if two states are behaviourally …

Totally Acyclic Complexes, Holly M. Zolt

College of Graduate Studies: Theses & Dissertations

We consider the following question: when is every exact complex of injective modules a totally acyclic one? It is known, for example, that over a commutative Noetherian ring of finite Krull dimension this condition is equivalent with the ring being Iwanaga-Gorenstein. We give equivalent characterizations of the condition that every exact complex of injective modules (over arbitrary rings) is totally acyclic. We also give a dual result giving equivalent characterizations of the condition that every exact complex of flat modules is F-totally acyclic over an arbitrary ring.

Upper Dimension And Bases Of Zero-Divisor Graphs Of Commutative Rings, S. Pirzada, M. Aijaza, Shane Redmond

EKU Faculty and Staff Scholarship

For a commutative ring R with non-zero zero divisor set Z∗(R), the zero divisor graph of R is Γ(R) with vertex set Z∗(R), where two distinct vertices x and y are adjacent if and only if x y = 0. The upper dimension and the resolving number of a zero divisor graph Γ(R) of some rings are determined. We provide certain classes of rings which have the same upper dimension and metric dimension and give an example of a ring for which these values do not coincide. Further, we obtain some bounds for the upper dimension in zero divisor graphs …