Physical Sciences and Mathematics Commons^™

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.

Polygonal Analogues To The Topological Tverberg And Van Kampen-Flores Theorems, Leah Leiner

Senior Projects Spring 2019

Tverberg’s theorem states that any set of (q-1)(d+1)+1 points in d-dimensional Euclidean space can be partitioned into q subsets whose convex hulls intersect. This is topologically equivalent to saying any continuous map from a (q-1)(d+1)-dimensional simplex to d-dimensional Euclidean space has q disjoint faces whose images intersect, given that q is a prime power. These continuous functions have a Fourier decomposition, which admits a Tverberg partition when all of the Fourier coefficients, except the constant coefficient, are zero. We have been working with continuous functions where all of the Fourier coefficients except the constant and one other coefficient are zero. …

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 …

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 ϵ Z ^≥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 …

Riemann-Hilbert Problem, Integrability And Reductions, Vladimir Gerdjikov, Rossen Ivanov, Aleksander Stefanov

Articles

Abstract. The present paper is dedicated to integrable models with Mikhailov reduction groups G_R ≃ D_h. Their Lax representation allows us to prove, that their solution is equivalent to solving Riemann-Hilbert problems, whose contours depend on the realization of the G_R-action on the spectral parameter. Two new examples of Nonlinear Evolution Equations (NLEE) with D_h symmetries are presented.

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 Conditional Probability That An Elliptic Curve Has A Rational Subgroup Of Order 5 Or 7, Meagan Kenney

Senior Projects Spring 2019

Let E be an elliptic curve over the rationals. There are two different ways in which the set of rational points on E can be said to be divisible by a prime p. We will call one of these types of divisibility local and the other global. Global divisibility will imply local divisibility; however, the converse is not guaranteed. In this project we focus on the cases where p=5 and p=7 to determine the probability that E has global divisibility by p, given that E has local divisibility by p.

Factorization Lengths In Numerical Monoids, Maya Samantha Schwartz

Senior Projects Spring 2019

A numerical monoid M generated by the natural numbers n_1, ..., n_k is a subset of {0, 1, 2, ...} whose elements are non-negative linear combinations of the generators n_1, ..., n_k. The set of factorizations of an element in M is the set of all the different ways to write that element as a linear combination of the generators. The length of a factorization of an element is the sum of the coefficients of that factorization. Since an element in a monoid can be written in different ways in terms of the generators, its set of factorization lengths may …

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 …

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 …

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 …

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).

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.

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 …

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 …

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 …

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 …

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

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

Electronic Theses and 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.

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

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

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 …

Totally Acyclic Complexes, Holly M. Zolt

Electronic Theses and 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.

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.

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.