Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Chapman University (46)
- University of Arkansas, Fayetteville (7)
- Prairie View A&M University (5)
- Western University (4)
- Bucknell University (3)
-
- Claremont Colleges (3)
- Bard College (2)
- City University of New York (CUNY) (2)
- Loyola University Chicago (2)
- Purdue University (2)
- Rose-Hulman Institute of Technology (2)
- Selected Works (2)
- Singapore Management University (2)
- Trinity College (2)
- University of New Mexico (2)
- University of Puget Sound (2)
- Air Force Institute of Technology (1)
- Brigham Young University (1)
- California Polytechnic State University, San Luis Obispo (1)
- Colby College (1)
- Georgia Southern University (1)
- Illinois State University (1)
- Liberty University (1)
- Louisiana State University (1)
- Minnesota State University, Mankato (1)
- National University of Uzbekistan (1)
- Old Dominion University (1)
- The College of Wooster (1)
- United Arab Emirates University (1)
- University of Kentucky (1)
- Keyword
-
- Coalgebra (13)
- Modal logic (6)
- Algebra (5)
- Algorithms (4)
- Mathematics (4)
-
- Coalgebraic logic (3)
- Coalgebras (3)
- Computer Science (3)
- Conjugacy (3)
- Cryptography (3)
- Display calculus (3)
- Subdivision (3)
- A-ary (2)
- Abstract Algebra (2)
- CSP (2)
- Category theory (2)
- Complexity (2)
- Computer algebra (2)
- Computer science education (2)
- Cover modality (2)
- Curve design (2)
- Descriptive general frames (2)
- Distributive lattices (2)
- Duality (2)
- Dynamic epistemic logic (2)
- Fuzzy number (2)
- Kripke polynomial functors (2)
- Linear Algebra (2)
- Linear algebra (2)
- Linear regression (2)
- Publication Year
- Publication
-
- Engineering Faculty Articles and Research (45)
- Mathematical Sciences Spring Lecture Series (7)
- Applications and Applied Mathematics: An International Journal (AAM) (5)
- Electronic Thesis and Dissertation Repository (4)
- HMC Senior Theses (3)
-
- Branch Mathematics and Statistics Faculty and Staff Publications (2)
- Computer Science: Faculty Publications and Other Works (2)
- Dissertations, Theses, and Capstone Projects (2)
- Faculty Journal Articles (2)
- Honors Theses (2)
- Mathematical Sciences Technical Reports (MSTR) (2)
- Research Collection School Of Computing and Information Systems (2)
- Senior Theses and Projects (2)
- Summer Research (2)
- Access*: Interdisciplinary Journal of Student Research and Scholarship (1)
- All Graduate Plan B and other Reports, Spring 1920 to Spring 2023 (1)
- All Graduate Theses, Dissertations, and Other Capstone Projects (1)
- Annual Symposium on Biomathematics and Ecology Education and Research (1)
- Bulletin of National University of Uzbekistan: Mathematics and Natural Sciences (1)
- Cybersecurity Undergraduate Research Showcase (1)
- Departmental Technical Reports (CS) (1)
- Emirates Journal for Engineering Research (1)
- George K. Thiruvathukal (1)
- Honors College Theses (1)
- Journal of Nonprofit Innovation (1)
- LSU Doctoral Dissertations (1)
- MODVIS Workshop (1)
- Manfred Minimair (1)
- Masters Theses & Specialist Projects (1)
- Math 365 Class Projects (1)
- Publication Type
- File Type
Articles 1 - 30 of 107
Full-Text Articles in Algebra
Reducing Food Scarcity: The Benefits Of Urban Farming, S.A. Claudell, Emilio Mejia
Reducing Food Scarcity: The Benefits Of Urban Farming, S.A. Claudell, Emilio Mejia
Journal of Nonprofit Innovation
Urban farming can enhance the lives of communities and help reduce food scarcity. This paper presents a conceptual prototype of an efficient urban farming community that can be scaled for a single apartment building or an entire community across all global geoeconomics regions, including densely populated cities and rural, developing towns and communities. When deployed in coordination with smart crop choices, local farm support, and efficient transportation then the result isn’t just sustainability, but also increasing fresh produce accessibility, optimizing nutritional value, eliminating the use of ‘forever chemicals’, reducing transportation costs, and fostering global environmental benefits.
Imagine Doris, who is …
The Vulnerabilities To The Rsa Algorithm And Future Alternative Algorithms To Improve Security, James Johnson
The Vulnerabilities To The Rsa Algorithm And Future Alternative Algorithms To Improve Security, James Johnson
Cybersecurity Undergraduate Research Showcase
The RSA encryption algorithm has secured many large systems, including bank systems, data encryption in emails, several online transactions, etc. Benefiting from the use of asymmetric cryptography and properties of number theory, RSA was widely regarded as one of most difficult algorithms to decrypt without a key, especially since by brute force, breaking the algorithm would take thousands of years. However, in recent times, research has shown that RSA is getting closer to being efficiently decrypted classically, using algebraic methods, (fully cracked through limited bits) in which elliptic-curve cryptography has been thought of as the alternative that is stronger than …
Efficient And Secure Digital Signature Algorithm (Dsa), Nissa Mehibel, M'Hamed Hamadouche
Efficient And Secure Digital Signature Algorithm (Dsa), Nissa Mehibel, M'Hamed Hamadouche
Emirates Journal for Engineering Research
The digital signature is used to ensure the integrity of messages as well as the authentication and non-repudiation of users. Today it has a very important role in information security. Digital signature is used in various fields such as e-commerce and e-voting, health, internet of things (IOT). Many digital signature schemes have been proposed, depending on the computational cost and security level. In this paper, we analyzed a recently proposed digital signature scheme based on the discrete logarithm problem (DLP). Our analysis shows that the scheme is not secure against the repeated random number attack to determine the secret keys …
A Graphical User Interface Using Spatiotemporal Interpolation To Determine Fine Particulate Matter Values In The United States, Kelly M. Entrekin
A Graphical User Interface Using Spatiotemporal Interpolation To Determine Fine Particulate Matter Values In The United States, Kelly M. Entrekin
Honors College Theses
Fine particulate matter or PM2.5 can be described as a pollution particle that has a diameter of 2.5 micrometers or smaller. These pollution particle values are measured by monitoring sites installed across the United States throughout the year. While these values are helpful, a lot of areas are not accounted for as scientists are not able to measure all of the United States. Some of these unmeasured regions could be reaching high PM2.5 values over time without being aware of it. These high values can be dangerous by causing or worsening health conditions, such as cardiovascular and lung diseases. Within …
A Visual Tour Of Dynamical Systems On Color Space, Jonathan Maltsman
A Visual Tour Of Dynamical Systems On Color Space, Jonathan Maltsman
HMC Senior Theses
We can think of a pixel as a particle in three dimensional space, where its x, y and z coordinates correspond to its level of red, green, and blue, respectively. Just as a particle’s motion is guided by physical rules like gravity, we can construct rules to guide a pixel’s motion through color space. We can develop striking visuals by applying these rules, called dynamical systems, onto images using animation engines. This project explores a number of these systems while exposing the underlying algebraic structure of color space. We also build and demonstrate a Visual DJ circuit board for …
The Mceliece Cryptosystem As A Solution To The Post-Quantum Cryptographic Problem, Isaac Hanna
The Mceliece Cryptosystem As A Solution To The Post-Quantum Cryptographic Problem, Isaac Hanna
Senior Honors Theses
The ability to communicate securely across the internet is owing to the security of the RSA cryptosystem, among others. This cryptosystem relies on the difficulty of integer factorization to provide secure communication. Peter Shor’s quantum integer factorization algorithm threatens to upend this. A special case of the hidden subgroup problem, the algorithm provides an exponential speedup in the integer factorization problem, destroying RSA’s security. Robert McEliece’s cryptosystem has been proposed as an alternative. Based upon binary Goppa codes instead of integer factorization, his cryptosystem uses code scrambling and error introduction to hinder decrypting a message without the private key. This …
Decoding Cyclic Codes Via Gröbner Bases, Eduardo Sosa
Decoding Cyclic Codes Via Gröbner Bases, Eduardo Sosa
Honors Theses
In this paper, we analyze the decoding of cyclic codes. First, we introduce linear and cyclic codes, standard decoding processes, and some standard theorems in coding theory. Then, we will introduce Gr¨obner Bases, and describe their connection to the decoding of cyclic codes. Finally, we go in-depth into how we decode cyclic codes using the key equation, and how a breakthrough by A. Brinton Cooper on decoding BCH codes using Gr¨obner Bases gave rise to the search for a polynomial-time algorithm that could someday decode any cyclic code. We discuss the different approaches taken toward developing such an algorithm and …
Linear Algebra For Computer Science, M. Thulasidas
Linear Algebra For Computer Science, M. Thulasidas
Research Collection School Of Computing and Information Systems
This textbook introduces the essential concepts and practice of Linear Algebra to the undergraduate student of computer science. The focus of this book is on the elegance and beauty of the numerical techniques and algorithms originating from Linear Algebra. As a practical handbook for computer and data scientists, LA4CS restricts itself mostly to real fields and tractable discourses, rather than deep and theoretical mathematics.
Linear Algebra For Computer Science, M. Thulasidas
Linear Algebra For Computer Science, M. Thulasidas
Research Collection School Of Computing and Information Systems
This book has its origin in my experience teaching Linear Algebra to Computer Science students at Singapore Management University. Traditionally, Linear Algebra is taught as a pure mathematics course, almost as an afterthought, not fully integrated with any other applied curriculum. It certainly was taught that way to me. The course I was teaching, however, had a definite pedagogical objective of bringing out the applicability and the usefulness of Linear Algebra in Computer Science, which is nothing but applied mathematics. In today’s age of machine learning and artificial intelligence, Linear Algebra is the branch of mathematics that holds the most …
Negative Representability Degree Structures Of Linear Orders With Endomorphisms, Nadimulla Kasymov, Sarvar Javliyev
Negative Representability Degree Structures Of Linear Orders With Endomorphisms, Nadimulla Kasymov, Sarvar Javliyev
Bulletin of National University of Uzbekistan: Mathematics and Natural Sciences
The structure of partially ordered sets of degrees of negative representability of linear orders with endomorphisms is studied. For these structures, the existence of incomparable, maximum and minimum degrees, infinite chains and antichains is established,and also considered connections with the concepts of reducibility of enumerations, splittable degrees and positive representetions.
Lecture 09: Hierarchically Low Rank And Kronecker Methods, Rio Yokota
Lecture 09: Hierarchically Low Rank And Kronecker Methods, Rio Yokota
Mathematical Sciences Spring Lecture Series
Exploiting structures of matrices goes beyond identifying their non-zero patterns. In many cases, dense full-rank matrices have low-rank submatrices that can be exploited to construct fast approximate algorithms. In other cases, dense matrices can be decomposed into Kronecker factors that are much smaller than the original matrix. Sparsity is a consequence of the connectivity of the underlying geometry (mesh, graph, interaction list, etc.), whereas the rank-deficiency of submatrices is closely related to the distance within this underlying geometry. For high dimensional geometry encountered in data science applications, the curse of dimensionality poses a challenge for rank-structured approaches. On the other …
Lecture 14: Randomized Algorithms For Least Squares Problems, Ilse C.F. Ipsen
Lecture 14: Randomized Algorithms For Least Squares Problems, Ilse C.F. Ipsen
Mathematical Sciences Spring Lecture Series
The emergence of massive data sets, over the past twenty or so years, has lead to the development of Randomized Numerical Linear Algebra. Randomized matrix algorithms perform random sketching and sampling of rows or columns, in order to reduce the problem dimension or compute low-rank approximations. We review randomized algorithms for the solution of least squares/regression problems, based on row sketching from the left, or column sketching from the right. These algorithms tend to be efficient and accurate on matrices that have many more rows than columns. We present probabilistic bounds for the amount of sampling required to achieve a …
Lecture 13: A Low-Rank Factorization Framework For Building Scalable Algebraic Solvers And Preconditioners, X. Sherry Li
Lecture 13: A Low-Rank Factorization Framework For Building Scalable Algebraic Solvers And Preconditioners, X. Sherry Li
Mathematical Sciences Spring Lecture Series
Factorization based preconditioning algorithms, most notably incomplete LU (ILU) factorization, have been shown to be robust and applicable to wide ranges of problems. However, traditional ILU algorithms are not amenable to scalable implementation. In recent years, we have seen a lot of investigations using low-rank compression techniques to build approximate factorizations.
A key to achieving lower complexity is the use of hierarchical matrix algebra, stemming from the H-matrix research. In addition, the multilevel algorithm paradigm provides a good vehicle for a scalable implementation. The goal of this lecture is to give an overview of the various hierarchical matrix formats, such …
Lecture 03: Hierarchically Low Rank Methods And Applications, David Keyes
Lecture 03: Hierarchically Low Rank Methods And Applications, David Keyes
Mathematical Sciences Spring Lecture Series
As simulation and analytics enter the exascale era, numerical algorithms, particularly implicit solvers that couple vast numbers of degrees of freedom, must span a widening gap between ambitious applications and austere architectures to support them. We present fifteen universals for researchers in scalable solvers: imperatives from computer architecture that scalable solvers must respect, strategies towards achieving them that are currently well established, and additional strategies currently being developed for an effective and efficient exascale software ecosystem. We consider recent generalizations of what it means to “solve” a computational problem, which suggest that we have often been “oversolving” them at the …
Lecture 11: The Road To Exascale And Legacy Software For Dense Linear Algebra, Jack Dongarra
Lecture 11: The Road To Exascale And Legacy Software For Dense Linear Algebra, Jack Dongarra
Mathematical Sciences Spring Lecture Series
In this talk, we will look at the current state of high performance computing and look at the next stage of extreme computing. With extreme computing, there will be fundamental changes in the character of floating point arithmetic and data movement. In this talk, we will look at how extreme-scale computing has caused algorithm and software developers to change their way of thinking on implementing and program-specific applications.
Lecture 00: Opening Remarks: 46th Spring Lecture Series, Tulin Kaman
Lecture 00: Opening Remarks: 46th Spring Lecture Series, Tulin Kaman
Mathematical Sciences Spring Lecture Series
Opening remarks for the 46th Annual Mathematical Sciences Spring Lecture Series at the University of Arkansas, Fayetteville.
Lecture 06: The Impact Of Computer Architectures On The Design Of Algebraic Multigrid Methods, Ulrike Yang
Lecture 06: The Impact Of Computer Architectures On The Design Of Algebraic Multigrid Methods, Ulrike Yang
Mathematical Sciences Spring Lecture Series
Algebraic multigrid (AMG) is a popular iterative solver and preconditioner for large sparse linear systems. When designed well, it is algorithmically scalable, enabling it to solve increasingly larger systems efficiently. While it consists of various highly parallel building blocks, the original method also consisted of various highly sequential components. A large amount of research has been performed over several decades to design new components that perform well on high performance computers. As a matter of fact, AMG has shown to scale well to more than a million processes. However, with single-core speeds plateauing, future increases in computing performance need to …
The Complexity Of Symmetry, Matthew Lemay
The Complexity Of Symmetry, Matthew Lemay
HMC Senior Theses
One of the main goals of theoretical computer science is to prove limits on how efficiently certain Boolean functions can be computed. The study of the algebraic complexity of polynomials provides an indirect approach to exploring these questions, which may prove fruitful since much is known about polynomials already from the field of algebra. This paper explores current research in establishing lower bounds on invariant rings and polynomial families. It explains the construction of an invariant ring for whom a succinct encoding would imply that NP is in P/poly. It then states a theorem about the circuit complexity partial …
Hamming Codes, Steve Mwangi, Sterling Quinn
Hamming Codes, Steve Mwangi, Sterling Quinn
Access*: Interdisciplinary Journal of Student Research and Scholarship
We will be looking into the application of Matrix Algebra in forming Hamming Codes. Hamming Codes are essential not just in the detection of errors, but also in the linear concurrent correction of these errors. The matrices we will use, will have entries that are binary units. Binary units are mathematically convenient, and their simplicity permits the representation of many open and closed circuits used in communication systems. The entries in the matrices will represent a message that is meant for transmission or reception, akin to the contemporary application of Hamming Codes in wireless communication. We will use Hamming (7,4) …
Some Generalizations Of Classical Integer Sequences Arising In Combinatorial Representation Theory, Sasha Verona Malone
Some Generalizations Of Classical Integer Sequences Arising In Combinatorial Representation Theory, Sasha Verona Malone
Masters Theses & Specialist Projects
There exists a natural correspondence between the bases for a given finite-dimensional representation of a complex semisimple Lie algebra and a certain collection of finite edge-colored ranked posets, laid out by Donnelly, et al. in, for instance, [Don03]. In this correspondence, the Serre relations on the Chevalley generators of the given Lie algebra are realized as conditions on coefficients assigned to poset edges. These conditions are the so-called diamond, crossing, and structure relations (hereinafter DCS relations.) New representation constructions of Lie algebras may thus be obtained by utilizing edge-colored ranked posets. Of particular combinatorial interest are those representations whose corresponding …
Evolution Of Computational Thinking Contextualized In A Teacher-Student Collaborative Learning Environment., John Arthur Underwood
Evolution Of Computational Thinking Contextualized In A Teacher-Student Collaborative Learning Environment., John Arthur Underwood
LSU Doctoral Dissertations
The discussion of Computational Thinking as a pedagogical concept is now essential as it has found itself integrated into the core science disciplines with its inclusion in all of the Next Generation Science Standards (NGSS, 2018). The need for a practical and functional definition for teacher practitioners is a driving point for many recent research endeavors. Across the United States school systems are currently seeking new methods for expanding their students’ ability to analytically think and to employee real-world problem-solving strategies (Hopson, Simms, and Knezek, 2001). The need for STEM trained individuals crosses both the vocational certified and college degreed …
Connectedness In Cayley Graphs And P/Np Dichotomy For Quay Algebras, Thuy Trang Nguyen
Connectedness In Cayley Graphs And P/Np Dichotomy For Quay Algebras, Thuy Trang Nguyen
Senior Projects Spring 2020
This senior thesis attempts to determine the extent to which the P/NP dichotomy of finite algebras (as proven by Bulatov, et.al in 2017) can be cast in terms of connectedness in Cayley graphs. This research is motivated by Prof. Robert McGrail's work ``CSPs and Connectedness: P/NP-Complete Dichotomy for Idempotent, Right Quasigroups" published in 2014 in which he demonstrates the strong correspondence between tractability and total path-connectivity in Cayley graphs for right, idempotent quasigroups. In particular, we will introduce the notion of total V-connectedness and show how it could be potentially used to phrase the dichotomy in terms of connectivity for …
Gröbner Bases And Systems Of Polynomial Equations, Rachel Holmes
Gröbner Bases And Systems Of Polynomial Equations, Rachel Holmes
All Graduate Theses, Dissertations, and Other Capstone Projects
This paper will explore the use and construction of Gröbner bases through Buchberger's algorithm. Specifically, applications of such bases for solving systems of polynomial equations will be discussed. Furthermore, we relate many concepts in commutative algebra to ideas in computational algebraic geometry.
Testing Isomorphism Of Graded Algebras, Peter A. Brooksbank, James B. Wilson, Eamonn A. O'Brien
Testing Isomorphism Of Graded Algebras, Peter A. Brooksbank, James B. Wilson, Eamonn A. O'Brien
Faculty Journal Articles
We present a new algorithm to decide isomorphism between finite graded algebras. For a broad class of nilpotent Lie algebras, we demonstrate that it runs in time polynomial in the order of the input algebras. We introduce heuristics that often dramatically improve the performance of the algorithm and report on an implementation in Magma.
Mathematics And Programming Exercises For Educational Robot Navigation, Ronald I. Greenberg
Mathematics And Programming Exercises For Educational Robot Navigation, Ronald I. Greenberg
Computer Science: Faculty Publications and Other Works
This paper points students towards ideas they can use towards developing a convenient library for robot navigation, with examples based on Botball primitives, and points educators towards mathematics and programming exercises they can suggest to students, especially advanced high school students.
Analysis Of A Group Of Automorphisms Of A Free Group As A Platform For Conjugacy-Based Group Cryptography, Pavel Shostak
Analysis Of A Group Of Automorphisms Of A Free Group As A Platform For Conjugacy-Based Group Cryptography, Pavel Shostak
Dissertations, Theses, and Capstone Projects
Let F be a finitely generated free group and Aut(F) its group of automorphisms.
In this monograph we discuss potential uses of Aut(F) in group-based cryptography.
Our main focus is on using Aut(F) as a platform group for the Anshel-Anshel-Goldfeld protocol, Ko-Lee protocol, and other protocols based on different versions of the conjugacy search problem or decomposition problem, such as Shpilrain-Ushakov protocol.
We attack the Anshel-Anshel-Goldfeld and Ko-Lee protocols by adapting the existing types of the length-based attack to the specifics of Aut(F). We also present our own version of the length-based attack that significantly increases the attack' success …
Integrating Mathematics And Educational Robotics: Simple Motion Planning, Ronald I. Greenberg, George K. Thiruvathukal, Sara T. Greenberg
Integrating Mathematics And Educational Robotics: Simple Motion Planning, Ronald I. Greenberg, George K. Thiruvathukal, Sara T. Greenberg
George K. Thiruvathukal
This paper shows how students can be guided to integrate elementary mathematical analyses with motion planning for typical educational robots. Rather than using calculus as in comprehensive works on motion planning, we show students can achieve interesting results using just simple linear regression tools and trigonometric analyses. Experiments with one robotics platform show that use of these tools can lead to passable navigation through dead reckoning even if students have limited experience with use of sensors, programming, and mathematics.
Integrating Mathematics And Educational Robotics: Simple Motion Planning, Ronald I. Greenberg, George K. Thiruvathukal, Sara T. Greenberg
Integrating Mathematics And Educational Robotics: Simple Motion Planning, Ronald I. Greenberg, George K. Thiruvathukal, Sara T. Greenberg
Computer Science: Faculty Publications and Other Works
This paper shows how students can be guided to integrate elementary mathematical analyses with motion planning for typical educational robots. Rather than using calculus as in comprehensive works on motion planning, we show students can achieve interesting results using just simple linear regression tools and trigonometric analyses. Experiments with one robotics platform show that use of these tools can lead to passable navigation through dead reckoning even if students have limited experience with use of sensors, programming, and mathematics.
Equivalence Of Classical And Quantum Codes, Tefjol Pllaha
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, …
High Performance Sparse Multivariate Polynomials: Fundamental Data Structures And Algorithms, Alex Brandt
High Performance Sparse Multivariate Polynomials: Fundamental Data Structures And Algorithms, Alex Brandt
Electronic Thesis and Dissertation Repository
Polynomials may be represented sparsely in an effort to conserve memory usage and provide a succinct and natural representation. Moreover, polynomials which are themselves sparse – have very few non-zero terms – will have wasted memory and computation time if represented, and operated on, densely. This waste is exacerbated as the number of variables increases. We provide practical implementations of sparse multivariate data structures focused on data locality and cache complexity. We look to develop high-performance algorithms and implementations of fundamental polynomial operations, using these sparse data structures, such as arithmetic (addition, subtraction, multiplication, and division) and interpolation. We revisit …