Algebra Commons^™

An Implementation Of The Solution To The Conjugacy Problem On Thompson's Group V, Rachel K. Nalecz

Senior Projects Spring 2018

We describe an implementation of the solution to the conjugacy problem in Thompson's group V as presented by James Belk and Francesco Matucci in 2013. Thompson's group V is an infinite finitely presented group whose elements are complete binary prefix replacement maps. From these we can construct closed abstract strand diagrams, which are certain directed graphs with a rotation system and an associated cohomology class. The algorithm checks for conjugacy by constructing and comparing these graphs together with their cohomology classes. We provide a complete outline of our solution algorithm, as well as a description of the data structures which …

Determinantal Conditions On Integer Splines, Kathryn Elizabeth Blaine

Senior Projects Fall 2018

In this project, we work with integer splines on graphs with positive integer edge labels. We focus on graphs that are (m, n)-cycles for some natural numbers m, n, specifically the diamond graph, which consists of two triangles joined at an edge. We extend previous research on integer splines over the diamond graph. In particular, we prove that a set of splines on the diamond graph forms a basis if and only if it satisfies a certain determinantal criterion.

A Journey To The Adic World, Fayadh Kadhem

Electronic Theses and Dissertations

The first idea of this research was to study a topic that is related to both Algebra and Topology and explore a tool that connects them together. That was the entrance for me to the “adic world”. What was needed were some important concepts from Algebra and Topology, and so they are treated in the first two chapters.

The reader is assumed to be familiar with Abstract Algebra and Topology, especially with Ring theory and basics of Point-set Topology.

The thesis consists of a motivation and four chapters, the third and the fourth being the main ones. In the third …

Extensions Of The Morse-Hedlund Theorem, Eben Blaisdell

Honors Theses

Bi-infinite words are sequences of characters that are infinite forwards and backwards; for example "...ababababab...". The Morse-Hedlund theorem says that a bi-infinite word f repeats itself, in at most n letters, if and only if the number of distinct subwords of length n is at most n. Using the example, "...ababababab...", there are 2 subwords of length 3, namely "aba" and "bab". Since 2 is less than 3, we must have that "...ababababab..." repeats itself after at most 3 letters. In fact it does repeat itself every two letters. …

Decoding Book Barcode Images, Yizhou Tao

CMC Senior Theses

This thesis investigated a method of barcode reconstruction to address the recovery of a blurred and convoluted one-dimensional barcode. There are a lot of types of barcodes used today, such as Code 39, Code 93, Code 128, etc. Our algorithm applies to the universal barcode, EAN 13. We extend the methodologies proposed by Iwen et al. (2013) in the journal article "A Symbol-Based Algorithm for Decoding barcodes." The algorithm proposed in the paper requires a signal measured by a laser scanner as an input. The observed signal is modeled as a true signal corrupted by a Gaussian convolution, additional noises, …

Parametric Polynomials For Small Galois Groups, Claire Huang

Honors Theses

Galois theory, named after French mathematician Evariste Galois in 19th-century, is an important part of abstract algebra. It brings together many different branches of mathematics by providing connections among fields, polynomials, and groups.

Specifically, Galois theory allows us to attach a finite field extension with a finite group. We call such a group the Galois group of the finite field extension. A typical way to attain a finite field extension to compute the splitting field of some polynomial. So we can always start with a polynomial and find the finite group associate to the field extension on its splitting field. …

On Spectral Theorem, Muyuan Zhang

Honors Theses

There are many instances where the theory of eigenvalues and eigenvectors has its applications. However, Matrix theory, which usually deals with vector spaces with finite dimensions, also has its constraints. Spectral theory, on the other hand, generalizes the ideas of eigenvalues and eigenvectors and applies them to vector spaces with arbitrary dimensions. In the following chapters, we will learn the basics of spectral theory and in particular, we will focus on one of the most important theorems in spectral theory, namely the spectral theorem. There are many different formulations of the spectral theorem and they convey the "same" idea. In …

Algebraic Number Theory And Simplest Cubic Fields, Jianing Yang

Honors Theses

The motivation behind this paper lies in understanding the meaning of integrality in general number fields. I present some important definitions and results in algebraic number theory, as well as theorems and their proofs on cyclic cubic fields. In particular, I discuss my understanding of Daniel Shanks' paper on the simplest cubic fields and their class numbers.

Logic -> Proof -> Rest, Maxwell Taylor

Senior Independent Study Theses

REST is a common architecture for networked applications. Applications that adhere to the REST constraints enjoy significant scaling advantages over other architectures. But REST is not a panacea for the task of building correct software. Algebraic models of computation, particularly CSP, prove useful to describe the composition of applications using REST. CSP enables us to describe and verify the behavior of RESTful systems. The descriptions of each component can be used independently to verify that a system behaves as expected. This thesis demonstrates and develops CSP methodology to verify the behavior of RESTful applications.

New Trends In Neutrosophic Theory And Applications Volume Ii, Florentin Smarandache, Surapati Pramanik

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 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 introducing neutrosophic sets and its applications, …

Subset Vertex Graphs For Social Networks, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors for the first time introduce the notion of subset vertex graph using the vertex set as the subset of the power set P(S), S is assumed in this book to be finite; however it can be finite or infinite. We have defined two types of subset vertex graphs, one is directed and the other one is not directed. The most important fact which must be kept in record is that for a given set of vertices there exists one and only one subset vertex graph be it of type I or type II. Several important and …

Neutrosophic Logic: The Revolutionary Logic In Science And Philosophy -- Proceedings Of The National Symposium, Florentin Smarandache, Huda E. Khalid, Ahmed K. Essa

Branch Mathematics and Statistics Faculty and Staff Publications

The first part of this book is an introduction to the activities of the National Symposium, as well as a presentation of Neutrosophic Scientific International Association (NSIA), based in New Mexico, USA, also explaining the role and scope of NSIA - Iraqi branch. The NSIA Iraqi branch presents a suggestion for the international instructions in attempting to organize NSIA's work. In the second chapter, the pivots of the Symposium are presented, including a history of neutrosophic theory and its applications, the most important books and papers in the advancement of neutrosophics, a biographical note of Prof. Florentin Smarandache in Arabic …

Mod Rectangular Natural Neutrosophic Numbers, Florentin Smarandache, K. Ilanthenral, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors introduce the new notion of MOD rectangular planes. The functions on them behave very differently when compared to MOD planes (square). These are different from the usual MOD planes. Algebraic structures on these MOD rectangular planes are defined and developed. However we have built only MOD interval natural neutrosophic products

Special Subset Vertex Subgraphs For Social Networks, Florentin Smarandache, W. B. Vasantha Kandasamy, Ilanthenral K

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors for the first time introduce the new notion of special subset vertex subgraph of subset vertex graphs introduced recently in [46]. These subset vertex graphs takes the vertex set values from the power set P(X) of any set X. The main speciality of these subset vertex graphs is that once a set of subsets from P(X) is given, the edges of the graph are fixed in a unique way, so for a given collection of subset vertices the graph is always unique [46]. The special subset vertex subgraphs of G are the ones, which have the …

On The Density Of The Odd Values Of The Partition Function, Samuel Judge

Dissertations, Master's Theses and Master's Reports

The purpose of this dissertation is to introduce a new approach to the study of one of the most basic and seemingly intractable problems in partition theory, namely the conjecture that the partition function $p(n)$ is equidistributed modulo $2$. We provide a doubly-indexed, infinite family of conjectural identities in the ring of series $\Z_2[[q]]$, which relate $p(n)$ with suitable $t$-multipartition functions, and show how to, in principle, prove each such identity. We will exhibit explicit proofs for $32$ of our identities. However, the conjecture remains open in full generality. A striking consequence of these conjectural identities is that, under suitable …

Abelian Subalgebras Of Maximal Dimension In Euclidean Lie Algebras, Mark Curro

Theses and Dissertations (Comprehensive)

In this paper we define, discuss and prove the uniqueness of the abelian subalgebra of maximal dimension of the Euclidean Lie algebra. We also construct a family of maximal abelian subalgebras and prove that they are maximal.

Dimensional Analysis: Physical Insight Gained Through Algebra, John A. Adam

Mathematics & Statistics Faculty Publications

No abstract provided.

Experimenting With The Identity (Xy)Z = Y(Zx), Irvin Roy Hentzel, David P. Jacobs, Sekhar V. Muddana

Irvin Roy Hentzel

An experiment with the nonassociative algebra program Albert led to the discovery of the following surprising theorem. Let G be a groupoid satisfying the identity (xy)z = y(zx). Then for products in G involving at least five elements, all factors commute and associate. A corollary is that any semiprime ring satisfying this identity must be commutative and associative, generalizing a known result of Chen.

Semiprime Locally(-1, 1) Ring With Minimal Condition, Irvin R. Hentzel, H. F. Smith

Irvin Roy Hentzel

Let L be a left ideal of a right alternative ring A with characteristic ::/=2. If L is maximal and nil, then L is a two-sided ideal. If L is minimal, then it is either a two-sided ideal, or the ideal it generates is contained in the right nucleus of A. In particular, if A is prime, then a minimal left ideal of A must be a two-sided ideal. Let A be a semiprime locally (-1, 1) ring with characteristic ::1=2, 3. Then A is isomorphic to a subdirect sum of an alternative ring, a strong (-1, 1) ring, and …

Minimal Identities Of Bernstein Alegebras, Irvin R. Hentzel, Ivan Correa, Luiz Antionio Peresi

Irvin Roy Hentzel

We construct the minimal identities for Bernstein algebras, exceptional Bernstein algebras and normal Bernstein algebras. We use the technique of processing identities via the representation of the symmetric groups. The computer algorithms for creating the standard tableaus and the integral representations are summarized.