Algebra Commons^™

(R1978) Heated Laminar Vertical Jet Of Psudoplastic Fluids-Against Gravity, Manisha Patel, M. G. Timol

Applications and Applied Mathematics: An International Journal (AAM)

A heated laminar jet of Pseudo-plastic fluid flowing vertically upwards from a long narrow slit into a region of the same fluid which is at a rest and at a uniform temperature is considered. The governing non-linear Partial differential equations (PDEs) for the defined flow problem are transformed into non-linear ordinary differential equations using the effective similarity technique-one parameter deductive group theory method. The obtained non-linear coupled Ordinary differential equations are solved and the results are presented by graphs. The effect of the Prandtl number and Grashof number on the velocity and temperature of the jet flow is discussed. Also, …

(R1509) Topsis And Vikor Methods For Spherical Fuzzy Soft Set Aggregating Operator Framework, M. Palanikumar, K. Arulmozhi, Lejo J. Manavalan

Applications and Applied Mathematics: An International Journal (AAM)

The Spherical Fuzzy Soft (SFS) set is a generalization of the Pythagorean fuzzy soft set and the intuitionistic fuzzy soft set. We introduce the concept of aggregating SFS decision matrices based on aggregated operations. The techniques for order of preference by similarity to ideal solution (TOPSIS) and viekriterijumsko kompromisno rangiranje (VIKOR) for the SFS approaches are the strong points of multi criteria group decision making (MCGDM), which is various extensions of fuzzy soft sets. We define a score function based on aggregating TOPSIS and VIKOR methods to the SFS-positive and SFS-negative ideal solutions. The TOPSIS and VIKOR methods provide decision-making …

(R1979) Permanent Of Toeplitz-Hessenberg Matrices With Generalized Fibonacci And Lucas Entries, Hacène Belbachir, Amine Belkhir, Ihab-Eddine Djellas

Applications and Applied Mathematics: An International Journal (AAM)

In the present paper, we evaluate the permanent and determinant of some Toeplitz-Hessenberg matrices with generalized Fibonacci and generalized Lucas numbers as entries.We develop identities involving sums of products of generalized Fibonacci numbers and generalized Lucas numbers with multinomial coefficients using the matrix structure, and then we present an application of the determinant of such matrices.

Cohen-Macaulay Type Of Weighted Path Ideals, Shuai Wei

All Dissertations

In this dissertation we give a combinatorial characterization of all the weighted $r$-path suspensions for which the $f$-weighted $r$-path ideal is Cohen-Macaulay. In particular, it is shown that the $f$-weighted $r$-path ideal of a weighted $r$-path suspension is Cohen-Macaulay if and only if it is unmixed. Type is an important invariant of a Cohen-Macaulay homogeneous ideal in a polynomial ring $R$ with coefficients in a field. We compute the type of $R/I$ when $I$ is any Cohen-Macaulay $f$-weighted $r$-path ideal of any weighted $r$-path suspension, for some chosen function $f$. In particular, this computes the type for all weighted trees …

Extension Of Fundamental Transversals And Euler’S Polyhedron Theorem, Joy Marie D'Andrea

Annual Symposium on Biomathematics and Ecology Education and Research

No abstract provided.

One-Point Gleason Parts And Point Derivations In Uniform Algebras, Swarup Ghosh, Alexander J. Izzo

Faculty Articles & Research

It is shown that a uniform algebra can have a nonzero bounded point derivation while having no nontrivial Gleason parts. Conversely, a uniform algebra can have a nontrivial Gleason part while having no nonzero, even possibly unbounded, point derivations.

A Cluster Structure On The Coordinate Ring Of Partial Flag Varieties, Fayadh Kadhem

LSU Doctoral Dissertations

The main goal of this dissertation is to show that the (multi-homogeneous) coordinate ring of a partial flag variety C[G/P_K^−] contains a cluster algebra for every semisimple complex algebraic group G. We use derivation properties and a canonical lifting map to prove that the cluster algebra structure A of the coordinate ring C[N_K] of a Schubert cell constructed by Goodearl and Yakimov can be lifted, in an explicit way, to a cluster structure \hat{A} living in the coordinate ring of the corresponding partial flag variety. Then we use a minimality condition to prove that the cluster algebra \hat{A} is equal …

(Si10-063) Number Of Automorphisms Of Some Non-Abelian P-Groups Of Order P^4, Muniya ., Harsha Arora, Mahender Singh

Applications and Applied Mathematics: An International Journal (AAM)

The automorphism of a group is a way of mapping the object to itself while preserving all of its structure, and the set of automorphisms of an object forms a group called the automorphism group. It is simply a bijective homomorphism. One of the earliest group automorphism was given by Irish mathematician William Rowan Hamilton in 1856, in his icosian calculus where he discovered an order two automorphism. In this paper, we compute the automorphisms of some non-Abelian groups of order p⁴, where p is an odd prime and GAP (Group Algorithm Programming) software has been used for …

College Algebra Slide Decks, Bader Abukhodair, Michelle Zeng

All Open Educational Resources

This collection of slide decks is designed to be used in concert with the following Open Eduational Resources:

- OpenStax College Algebra 2e Open Texbook

- Department of Mathematics Video Playlist

- Homework questions from myOpenMath

Concepts include are: A study of equations, graphs, and inequalities for linear, quadratic, polynomial, rational, logarithmic, exponential, and absolute value functions. Transformations on graphs, complex numbers, circles, systems of inequalities, and systems of equations including matrices.

Generalizations Of Commutativity In Dihedral Groups, Noah A. Heckenlively

Rose-Hulman Undergraduate Mathematics Journal

The probability that two elements commute in a non-Abelian finite group is at most 5 8 . We prove several generalizations of this result for dihedral groups. In particular, we give specific values for the probability that a product of an arbitrary number of dihedral group elements is equal to its reverse, and also for the probability that a product of three elements is equal to a permutation of itself or to a cyclic permutation of itself. We also show that for any r and n, there exists a dihedral group such that the probability that a product of n …

Minimal Differential Graded Algebra Resolutions Related To Certain Stanley-Reisner Rings, Todd Anthony Morra

All Dissertations

We investigate algebra structures on resolutions of a special class of Cohen-Macaulay simplicial complexes. Given a simplicial complex, we define a pure simplicial complex called the purification. These complexes arise as a generalization of certain independence complexes and the resultant Stanley-Reisner rings have numerous desirable properties, e.g., they are Cohen-Macaulay. By realizing the purification in the context of work of D'alì, et al., we obtain a multi-graded, minimal free resolution of the Alexander dual ideal of the Stanley-Reisner ideal. We augment this in a standard way to obtain a resolution of the quotient ring, which is likewise minimal and multi-graded. …

Identifying Trace Affine Linear Sets Using Homotopy Continuation, Julianne Mckay

All Theses

We investigate how the coefficients of a sparse polynomial system influence the sum, or the trace, of its solutions. We discuss an extension of the classical trace test in numerical algebraic geometry to sparse polynomial systems. Two known methods for identifying a trace affine linear subset of the support of a sparse polynomial system use sparse resultants and polyhedral geometry, respectively. We introduce a new approach which provides more precise classifications of trace affine linear sets than was previously known. For this new approach, we developed software in Macaulay2.

The Hfd Property In Orders Of A Number Field, Grant Moles

All Theses

We will examine orders R in a number field K. In particular, we will look at how the generalized class number of R relates to the class number of its integral closure R. We will then apply this to the case when K is a quadratic field to produce a more specific relation. After this, we will focus on orders R which are half-factorial domains (HFDs), in which the irreducible factorization of any element α∈R has fixed length. We will determine two cases in which R is an HFD if and only if its ring of …

Properties And Classifications Of Certain Lcd Codes., Dalton Seth Gannon

Electronic Theses and Dissertations

A linear code $C$ is called a linear complementary dual code (LCD code) if $C \cap C^\perp = {0}$ holds. LCD codes have many applications in cryptography, communication systems, data storage, and quantum coding theory. In this dissertation we show that a necessary and sufficient condition for a cyclic code $C$ over $\Z_4$ of odd length to be an LCD code is that $C=\big( f(x) \big)$ where $f$ is a self-reciprocal polynomial in $\Z_{4}[X]$ which is also in our paper \cite{GK1}. We then extend this result and provide a necessary and sufficient condition for a cyclic code $C$ of length …

Conductors And Rings With Shared Ideals, Sydney Maibach

All Theses

Given an additive subgroup $I$ of a field $K$, we define the colon ideal (I:I) = {\alpha \in K: \alpha I \subseteq I}. We then use this to construct collections of rings with shared ideals and explore relationships between these concepts and the complete integral closure.

Lyubeznik Ideals Minimally Generated By Four Or Fewer Elements, Nathan S. Fontes

All Theses

Free resolutions for an ideal are constructions that tell us useful information about the structure of the ideal. Every ideal has one minimal free resolution which tells us significantly more about the structure of the ideal. In this thesis, we consider a specific type of resolution, the Lyubeznik resolution, for a monomial ideal I, which is constructed using a total order on the minimal generating set G(I). An ideal is called Lyubeznik if some total order on G(I) produces a minimal Lyubeznik resolution for I. We investigate the problem of characterizing whether an ideal I is Lyubeznik …

Efficiency Of Homomorphic Encryption Schemes, Kyle Yates

All Theses

In 2009, Craig Gentry introduced the first fully homomorphic encryption scheme using bootstrapping. In the 13 years since, a large amount of research has gone into improving efficiency of homomorphic encryption schemes. This includes implementing leveled homomorphic encryption schemes for practical use, which are schemes that allow for some predetermined amount of additions and multiplications that can be performed on ciphertexts. These leveled schemes have been found to be very efficient in practice. In this thesis, we will discuss the efficiency of various homomorphic encryption schemes. In particular, we will see how to improve sizes of parameter choices in homomorphic …

On Complete Integral Closure Of Integral Domains, Todd Fenstermacher

All Dissertations

Given an integral domain D with quotient field K, an element x in K is called integral over D if x is a root of a monic polynomial with coefficients in D. The notion of integrality has roots in Dedekind's work with algebraic integers, and was later developed more rigorously by Emmy Noether. Different variations or generalizations of integrality have since been studied, including almost integrality and pseudo-integrality. In this work we give a brief history of integrality and almost integrality before developing the basic theory of these two notions. We will continue the theory of almost integrality further by …

Characterizing Unmixed Trees And Coronas With Respect To Pmu Covers, Michael Cowen

All Dissertations

In this dissertation we study the algebraic properties of ideals constructed from graphs. We use algebraic techniques to study the PMU Placement Problem from electrical engineering which asks for optimal placement of sensors, called PMUs, in an electrical power system. Motivated by algebraic and geometric considerations, we characterize the trees for which all minimal PMU covers have the same size. Additionally, we investigate the power edge ideal of Moore, Rogers, and Sather-Wagstaff which identifies the PMU covers of a power system like the edge ideal of a graph identifies the vertex covers. We characterize the trees for which the power …

Bbt Acoustic Alternative Top Bracing Cadd Data Set-Norev-2022jun28, Bill Hemphill

STEM Guitar Project’s BBT Acoustic Kit

This electronic document file set consists of an overview presentation (PDF-formatted) file and companion video (MP4) and CADD files (DWG & DXF) for laser cutting the ETSU-developed alternate top bracing designs and marking templates for the STEM Guitar Project’s BBT (OM-sized) standard acoustic guitar kit. The three (3) alternative BBT top bracing designs in this release are
(a) a one-piece base for the standard kit's (Martin-style) bracing,
(b) 277 Ladder-style bracing, and
(c) an X-braced fan-style bracing similar to traditional European or so-called 'classical' acoustic guitars.

The CADD data set for each of the three (3) top bracing designs includes …