Algebra Commons^™

Numerical Experiments For Finding Roots Of The Polynomials In Chebyshev Basis, M. S. Solary

Applications and Applied Mathematics: An International Journal (AAM)

Root finding for a function or a polynomial that is smooth on the interval [a; b], but otherwise arbitrary, is done by the following procedure. First, approximate it by a Chebyshev polynomial series. Second, find the zeros of the truncated Chebyshev series. Finding roots of the Chebyshev polynomial is done by eigenvalues of a nXn matrix such as companion or comrade matrices. There are some methods for finding eigenvalues of these matrices such as companion matrix and chasing procedures.We derive another algorithm by second kind of Chebyshev polynomials.We computed the numerical results of these methods for some special and ill-conditioned …

Some Pre-Filters In Eq-Algebras, M. Behzadi, L. Torkzadeh

Applications and Applied Mathematics: An International Journal (AAM)

In this paper, the notion of an obstinate prefilter (filter) in an EQ-algebra ξ is introduced and a characterization of it is obtained by some theorems. Then the notion of maximal prefilter is defined and is characterized under some conditions. Finally, the relations among obstinate, prime, maximal, implicative and positive implicative prefilters are studied.

Effective Modified Hybrid Conjugate Gradient Method For Large-Scale Symmetric Nonlinear Equations, Jamilu Sabi'u, Mohammed Y. Waziri

Applications and Applied Mathematics: An International Journal (AAM)

In this paper, we proposed hybrid conjugate gradient method using the convex combination of FR and PRP conjugate gradient methods for solving Large-scale symmetric nonlinear equations via Andrei approach with nonmonotone line search. Logical formula for obtaining the convex parameter using Newton and our proposed directions was also proposed. Under appropriate conditions global convergence was established. Reported numerical results show that the proposed method is very promising.

Investigation Of Finite Groups Through Progenitors, Charles Baccari

Electronic Theses, Projects, and Dissertations

The goal of this presentation is to find original symmetric presentations of finite groups. It is frequently the case, that progenitors factored by appropriate relations produce simple and even sporadic groups as homomorphic images. We have discovered two of the twenty-six sporadic simple groups namely, M₁₂, J₁ and the Lie type group Suz(8). In addition several linear and classical groups will also be presented. We will present several progenitors including: 2^*12: 2² x (3 : 2), 2^*11: PSL₂(11), 2^*5: (5 : 4) which have produced the homomorphic images: …

An Introduction To Lie Algebra, Amanda Renee Talley

Electronic Theses, Projects, and Dissertations

An (associative) algebra is a vector space over a field equipped with an associative, bilinear multiplication. By use of a new bilinear operation, any associative algebra morphs into a nonassociative abstract Lie algebra, where the new product in terms of the given associative product, is the commutator. The crux of this paper is to investigate the commutator as it pertains to the general linear group and its subalgebras. This forces us to examine properties of ring theory under the lens of linear algebra, as we determine subalgebras, ideals, and solvability as decomposed into an extension of abelian ideals, and nilpotency, …

Distributive Residuated Frames And Generalized Bunched Implication Algebras, Nikolaos Galatos, Peter Jipsen

Mathematics, Physics, and Computer Science Faculty Articles and Research

We show that all extensions of the (non-associative) Gentzen system for distributive full Lambek calculus by simple structural rules have the cut elimination property. Also, extensions by such rules that do not increase complexity have the finite model property, hence many subvarieties of the variety of distributive residuated lattices have decidable equational theories. For some other extensions, we prove the finite embeddability property, which implies the decidability of the universal theory, and we show that our results also apply to generalized bunched implication algebras. Our analysis is conducted in the general setting of residuated frames.

Distributed Evolution Of Spiking Neuron Models On Apache Mahout For Time Series Analysis, Andrew Palumbo

Annual Symposium on Biomathematics and Ecology Education and Research

No abstract provided.

The Roots Of Early Group Theory In The Works Of Lagrange, Janet Heine Barnett

Abstract Algebra

No abstract provided.

Inquiry Into Saving [Mathematics], Jeanne Funk

Open Educational Resources

‘Inquiry Into Saving’ is an assignment originally designed for MAT117, which is a course for students who have been placed in basic skills mathematics and who can apply a college level course in Algebra and Trigonometry to their program. These students should, ideally, be early in their LaGuardia career, though that is frequently not the case. All, however, are novices of mathematics. The assignment was vetted and revised based on feedback from the Inquiry and Problem Solving in STEM CTL seminar and a charrette not affiliated with the seminar. Revisions addressed connections to the Inquiry and Problem Solving/Written competency/ability pair, …

World Population Dynamics: Modeling Involving Polynomial Functions [Mathematics], Mangala Kothari

Open Educational Resources

In this Inquiry and Problem Solving Assignment students are expected to reflect on their analysis and compare their results with the actual population by conducting their own elementary level research such as searching databases, gathering information and interpreting. Students are expected to comment on the scope of the mathematical model and connect their learning in context to the real-world problem. The assignment includes open-ended questions such as: Write a paragraph about the dynamics of population for the world. What could be some of the possible parameters that contribute to the change in population size? Reflect on what you learned by …

Neutrosophic N -Structures Applied To Bck/Bci-Algebras, Florentin Smarandache, Young Bae Jun, Hashem Bordbar

Branch Mathematics and Statistics Faculty and Staff Publications

Neutrosophic N -structures with applications in BCK/BC I-algebras is discussed. The notions of a neutrosophic N -subalgebra and a (closed) neutrosophic N -ideal in a BCK/BC I-algebra are introduced, and several related properties are investigated. Characterizations of a neutrosophic N -subalgebra and a neutrosophic N -ideal are considered, and relations between a neutrosophic N -subalgebra and a neutrosophic N -ideal are stated. Conditions for a neutrosophic N -ideal to be a closed neutrosophic N -ideal are provided.

Neutrosophic Commutative N-Ideals In Bck-Algebras, Florentin Smarandache, Seok-Zun Song, Young Bae Jun

Branch Mathematics and Statistics Faculty and Staff Publications

The notion of a neutrosophic commutative N -ideal in BCK-algebras is introduced, and several properties are investigated. Relations between a neutrosophic N -ideal and a neutrosophic commutative N -ideal are discussed. Characterizations of a neutrosophic commutative N -ideal are considered.

On A Frobenius Problem For Polynomials, Ricardo Conceição, R. Gondim, M. Rodriguez

Math Faculty Publications

We extend the famous diophantine Frobenius problem to a ring of polynomials over a field~k. Similar to the classical problem we show that the n = 2 case of the Frobenius problem for polynomials is easy to solve. In addition, we translate a few results from the Frobenius problem over ℤ to k[t] and give an algorithm to solve the Frobenius problem for polynomials over a field k of sufficiently large size.

“Wrong” Side Interpolation By Positive Real Rational Functions, Daniel Alpay, Izchak Lewkowicz

Mathematics, Physics, and Computer Science Faculty Articles and Research

Using polynomial interpolation, along with structural properties of the family of rational positive real functions, we here show that a set of m nodes in the open left half of the complex plane, can always be mapped to anywhere in the complex plane by rational positive real functions whose degree is at most m. Moreover we introduce an easy-to-find parametrization in R2m+3 of a large subset of these interpolating functions.

Predicting Locations Of Pollution Sources Using Convolutional Neural Networks, Yiheng Chi, Nickolas D. Winovich, Guang Lin

The Summer Undergraduate Research Fellowship (SURF) Symposium

Pollution is a severe problem today, and the main challenge in water and air pollution controls and eliminations is detecting and locating pollution sources. This research project aims to predict the locations of pollution sources given diffusion information of pollution in the form of array or image data. These predictions are done using machine learning. The relations between time, location, and pollution concentration are first formulated as pollution diffusion equations, which are partial differential equations (PDEs), and then deep convolutional neural networks are built and trained to solve these PDEs. The convolutional neural networks consist of convolutional layers, reLU layers …

Efficiently Representing The Integer Factorization Problem Using Binary Decision Diagrams, David Skidmore

All Graduate Plan B and other Reports, Spring 1920 to Spring 2023

Let p be a prime positive integer and let α be a positive integer greater than 1. A method is given to reduce the problem of finding a nontrivial factorization of α to the problem of finding a solution to a system of modulo p polynomial congruences where each variable in the system is constrained to the set {0,...,p − 1}. In the case that p = 2 it is shown that each polynomial in the system can be represented by an ordered binary decision diagram with size less than 20.25log₂(α)³ + 16.5log₂(α)² + …

Π-Operators In Clifford Analysis And Its Applications, Wanqing Cheng

Graduate Theses and Dissertations

In this dissertation, we studies Π-operators in different spaces using Clifford algebras. This approach generalizes the Π-operator theory on the complex plane to higher dimensional spaces. It also allows us to investigate the existence of the solutions to Beltrami equations in different spaces.

Motivated by the form of the Π-operator on the complex plane, we first construct a Π-operator on a general Clifford-Hilbert module. It is shown that this operator is an L^2 isometry. Further, this can also be used for solving certain Beltrami equations when the Hilbert space is the L^2 space of a measure space. This idea is …

Ideal Containments Under Flat Extensions And Interpolation On Linear Systems In P2, Solomon Akesseh

Department of Mathematics: Dissertations, Theses, and Student Research

Fat points and their ideals have stimulated a lot of research but this dissertation concerns itself with aspects of only two of them, broadly categorized here as, the ideal containments and polynomial interpolation problems.

Ein-Lazarsfeld-Smith and Hochster-Huneke cumulatively showed that for all ideals I in k[Pⁿ], I^(mn) ⊆ I^m for all m ∈ N. Over the projective plane, we obtain I⁽⁴⁾< ⊆ I². Huneke asked whether it was the case that I⁽³⁾ ⊆ I². Dumnicki, Szemberg and Tutaj-Gasinska show that if I is the saturated homogeneous radical ideal of the 12 …

Stable Cohomology Of Local Rings And Castelnuovo–Mumford Regularity Of Graded Modules, Luigi Ferraro

Department of Mathematics: Dissertations, Theses, and Student Research

This thesis consists of two parts:

1) A bimodule structure on the bounded cohomology of a local ring (Chapter 1),

2) Modules of infinite regularity over graded commutative rings (Chapter 2).

Chapter 1 deals with the structure of stable cohomology and bounded cohomology. Stable cohomology is a $\mathbb{Z}$-graded algebra generalizing Tate cohomology and first defined by Pierre Vogel. It is connected to absolute cohomology and bounded cohomology. We investigate the structure of the bounded cohomology as a graded bimodule. We use the information on the bimodule structure of bounded cohomology to study the stable cohomology algebra as a trivial extension …

Residuated Maps, The Way-Below Relation, And Contractions On Probabilistic Metric Spaces., M. Ryan Luke

Electronic Theses and Dissertations

In this dissertation, we will examine residuated mappings on a function lattice and how they behave with respect to the way-below relation. In particular, which residuated $\phi$ has the property that $F$ is way-below $\phi(F)$ for $F$ in appropriate sets. We show the way-below relation describes the separation of two functions and how this corresponds to contraction mappings on probabilistic metric spaces. A new definition for contractions is considered using the way-below relation.

Cayley Graphs Of Groups And Their Applications, Anna Tripi

Graduate Theses/Dissertations

Cayley graphs are graphs associated to a group and a set of generators for that group (there is also an associated directed graph). The purpose of this study was to examine multiple examples of Cayley graphs through group theory, graph theory, and applications. We gave background material on groups and graphs and gave numerous examples of Cayley graphs and digraphs. This helped investigate the conjecture that the Cayley graph of any group (except Z_2) is hamiltonian. We found the conjecture to still be open. We found Cayley graphs and hamiltonian cycles could be applied to campanology (in particular, to the …

Solving A System Of Linear Equations Using Ancient Chinese Methods, Mary Flagg

Linear Algebra

No abstract provided.

Blow-Up Algebras, Determinantal Ideals, And Dedekind-Mertens-Like Formulas, Alberto Corso, Uwe Nagel, Sonja Petrović, Cornelia Yuen

Mathematics Faculty Publications

We investigate Rees algebras and special fiber rings obtained by blowing up specialized Ferrers ideals. This class of monomial ideals includes strongly stable monomial ideals generated in degree two and edge ideals of prominent classes of graphs. We identify the equations of these blow-up algebras. They generate determinantal ideals associated to subregions of a generic symmetric matrix, which may have holes. Exhibiting Gröbner bases for these ideals and using methods from Gorenstein liaison theory, we show that these determinantal rings are normal Cohen–Macaulay domains that are Koszul, that the initial ideals correspond to vertex decomposable simplicial complexes, and we determine …

College Algebra, Trigonometry, And Precalculus (Clayton), Chaogui Zhang, Scott Bailey, Billie May, Jelinda Spotorno, Kara Mullen

Mathematics Grants Collections

This Grants Collection for College Algebra, Trigonometry, and Precalculus was created under a Round Five 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, Da'mon Andrews, Antre' Drummer

Mathematics Grants Collections

This Grants Collection for Biochemistry was created under a Round Seven 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

Multi-Type Display Calculus For Semi-De Morgan Logic, Giuseppe Greco, Fei Liang, M. Andrew Moshier, Alessandra Palmigiano

Mathematics, Physics, and Computer Science Faculty Articles and Research

We introduce a proper multi-type display calculus for semi De Morgan logic which is sound, complete, conservative, and enjoys cut-elimination and subformula property. Our proposal builds on an algebraic analysis of semi De Morgan algebras and applies the guidelines of the multi-type methodology in the design of display calculi.

Discovery Learning Plus Direct Instruction Equals Success: Modifying American Math Education In The Algebra Classroom, Sean P. Ferrill Mr.

Honors Projects

In light of both high American failure rates in algebra courses and the significant proportion of innumerate American students, this thesis examines a variety of effective educational methods in mathematics. Constructivism, discovery learning, traditional instruction, and the Japanese primary education system are all analyzed to incorporate effective education techniques. Based on the meta-analysis of each of these methods, a hybrid method has been constructed to adapt in the American Common Core algebra classroom.

Elimination For Systems Of Algebraic Differential Equations, Richard Gustavson

Dissertations, Theses, and Capstone Projects

We develop new upper bounds for several effective differential elimination techniques for systems of algebraic ordinary and partial differential equations. Differential elimination, also known as decoupling, is the process of eliminating a fixed subset of unknown functions from a system of differential equations in order to obtain differential algebraic consequences of the original system that do not depend on that fixed subset of unknowns. A special case of differential elimination, which we study extensively, is the question of consistency, that is, if the given system of differential equations has a solution. We first look solely at the ``algebraic data" of …

Solving Algorithmic Problems In Finitely Presented Groups Via Machine Learning, Jonathan Gryak

Dissertations, Theses, and Capstone Projects

Machine learning and pattern recognition techniques have been successfully applied to algorithmic problems in free groups. In this dissertation, we seek to extend these techniques to finitely presented non-free groups, in particular to polycyclic and metabelian groups that are of interest to non-commutative cryptography.

As a prototypical example, we utilize supervised learning methods to construct classifiers that can solve the conjugacy decision problem, i.e., determine whether or not a pair of elements from a specified group are conjugate. The accuracies of classifiers created using decision trees, random forests, and N-tuple neural network models are evaluated for several non-free groups. …

Conquering Worrisome Word Problems – Algebra Success, Vicki-Lynn Holmes, Karla Spence, Jane Finn, Shelia Mcgee Ingram, Libbey Horton

Faculty Publications

High school students can struggle with word problems in upper level math classes. Causes for this struggle could include lower reading comprehension, limited mathematic vocabulary, and difficulty changing words to algebraic expressions. This article proposes three techniques to help teachers instruct these struggling students that include (a) organization by difficulty of comprehension and computation (b) scaffolding and (c) utilizing the Explain, Practice and Assess (EPA) strategy.