Stable Cohomology Of Local Rings And Castelnuovo-Mumford Regularity Of Graded Modules, 2017 University of Nebraska-Lincoln

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

*Dissertations, Theses, and Student Research Papers in Mathematics*

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

Residuated Maps, The Way-Below Relation, And Contractions On Probabilistic Metric Spaces., 2017 University of Louisville

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

Ideal Containments Under Flat Extensions And Interpolation On Linear Systems In P2, 2017 University of Nebraska-Lincoln

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

*Dissertations, Theses, and Student Research Papers in Mathematics*

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**^{n}], I^{(mn)} ⊆ I^{m} for all m ∈ N. Over the projective plane, we obtain I^{(4)}< ⊆ I^{2}. Huneke asked whether it was the case that I^{(3)} ⊆ I^{2}. Dumnicki, Szemberg and Tutaj-Gasinska show that if I is the saturated homogeneous radical ideal of the 12 points of the Hesse configuration, then ...

Π-Operators In Clifford Analysis And Its Applications, 2017 University of Arkansas, Fayetteville

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

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

Efficiently Representing The Integer Factorization Problem Using Binary Decision Diagrams, 2017 Utah State University

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

*All Graduate Plan B and other Reports*

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_{2}(α)^{3} + 16.5log_{2}(α)^{2} + 6log ...

Classification Results Of Hadamard Matrices, 2017 University of Tennessee, Knoxville

#### Classification Results Of Hadamard Matrices, Gregory Allen Schmidt

*Masters Theses*

In 1893 Hadamard proved that for any *n* x *n* matrix A over the complex numbers, with all of its entries of absolute value less than or equal to 1, it necessarily follows that

|*det*(*A*)| ≤ *n ^{n/2}* [n raised to the power n divided by two],

with equality if and only if the rows of A are mutually orthogonal and the absolute value of each entry is equal to 1 (See [2], [3]). Such matrices are now appropriately identified as Hadamard matrices, which provides an active area of research in both theoretical and applied fields of the sciences ...

Various Topics On Graphical Structures Placed On Commutative Rings, 2017 University of Tennessee, Knoxville

#### Various Topics On Graphical Structures Placed On Commutative Rings, Darrin Weber

*Doctoral Dissertations*

In this dissertation, we look at two types of graphs that can be placed on a commutative ring: the zero-divisor graph and the ideal-based zero-divisor graph. A zero-divisor graph is a graph whose vertices are the nonzero zero-divisors of a ring and two vertices are connected by an edge if and only if their product is 0. We classify, up to isomorphism, all commutative rings without identity that have a zero-divisor graph on 14 or fewer vertices.

An ideal-based zero-divisor graph is a generalization of the zero-divisor graph where for a ring *R* and ideal *I* the vertices are {* x ...*

Generalizations And Variations Of The Zero-Divisor Graph, 2017 University of Tennessee, Knoxville

#### Generalizations And Variations Of The Zero-Divisor Graph, Grace Elizabeth Mcclurkin

*Doctoral Dissertations*

We explore generalizations and variations of the zero-divisor graph on commutative rings with identity. A zero-divisor graph is a graph whose vertex set is the nonzero zero-divisors of a ring, wherein two distinct vertices are adjacent if their product is zero. Variations of the zero-divisor graph are created by changing the vertex set, the edge condition, or both. The annihilator graph and the extended zero-divisor graph are both variations that change the edge condition, whereas the compressed graph and ideal-based graph change the vertex set. By combining these concepts, we define and investigate graphs where both the vertex set and ...

Construction And Classification Results For Commuting Squares Of Finite Dimensional *-Algebras, 2017 University of Tennessee, Knoxville

#### Construction And Classification Results For Commuting Squares Of Finite Dimensional *-Algebras, Chase Thomas Worley

*Doctoral Dissertations*

In this dissertation, we present new constructions of commuting squares, and we investigate finiteness and isolation results for these objects. We also give applications to the classification of complex Hadamard matrices and to Hopf algebras.

In the first part, we recall the notion of commuting squares which were introduced by Popa and arise naturally as invariants in Jones' theory of subfactors. We review some of the main known examples of commuting squares such as those constructed from finite groups and from complex Hadamard matrices. We also recall Nicoara's notion of defect which gives an upper bound for the number ...

Optimal Dual Fusion Frames For Probabilistic Erasures, 2017 Universidad Nacional de San Luis and CONICET, Argentina

#### Optimal Dual Fusion Frames For Probabilistic Erasures, Patricia Mariela Morillas

*Electronic Journal of Linear Algebra*

For any fixed fusion frame, its optimal dual fusion frames for reconstruction is studied in case of erasures of subspaces. It is considered that a probability distribution of erasure of subspaces is given and that a blind reconstruction procedure is used, where the erased data are set to zero. It is proved that there are always optimal duals. Sufficient conditions for the canonical dual fusion frame being either the unique optimal dual, a non-unique optimal dual, or a non optimal dual, are obtained. The reconstruction error is analyzed, using the optimal duals in the probability model considered here and using ...

College Algebra, Trigonometry, And Precalculus (Clayton), 2017 Clayton State University

#### 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, 2017 East Georgia State College

#### 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

Solving A System Of Linear Equations Using Ancient Chinese Methods, 2017 University of St Thomas

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

*Linear Algebra*

No abstract provided.

How The Use Of Subjectivist Instructional Strategies In Teaching Multiple Sections Of An Eighth Grade Algebra Class In Guyana Relates To Algebra Achievement And Attitude Changes Toward Mathematics, 2017 Florida International University

#### How The Use Of Subjectivist Instructional Strategies In Teaching Multiple Sections Of An Eighth Grade Algebra Class In Guyana Relates To Algebra Achievement And Attitude Changes Toward Mathematics, Jennifer Hoyte

*FIU Electronic Theses and Dissertations*

In Guyana, South America, the Ministry of Education seeks to provide universal, inclusive education that prepares its citizens to take their productive places in society and to creatively solve complex, real-world problems. However, with frequent national assessments that are used to place students in high school, college or into jobs, teachers resort to using familiar strategies such as lecture, recitation and test drilling. Despite their efforts, over 56% of students are failing the Grade 6 assessments, 43% failing 10th grade Mathematics and over 60% failing college algebra courses. Such performance has been linked to students’ lower academic self-concept and their ...

Solutions Of The System Of Operator Equations $Bxa=B=Axb$ Via The *-Order, 2017 Ferdowsi University of Mashhad

#### Solutions Of The System Of Operator Equations $Bxa=B=Axb$ Via The *-Order, Mehdi Vosough, Mohammad Sal Moslehian

*Electronic Journal of Linear Algebra*

In this paper, some necessary and sufficient conditions are established for the existence of solutions to the system of operator equations $BXA=B=AXB$ in the setting of bounded linear operators on a Hilbert space, where the unknown operator $X$ is called the inverse of $A$ along $B$. After that, under some mild conditions, it is proved that an operator $X$ is a solution of $BXA=B=AXB$ if and only if $B \stackrel{*}{ \leq} AXA$, where the $*$-order $C\stackrel{*}{ \leq} D$ means $CC^*=DC^*, C^*C=C^*D$. Moreover, the general solution of the equation above is obtained ...

Zero Forcing Propagation Time On Oriented Graphs, 2017 Saint Olaf College

#### Zero Forcing Propagation Time On Oriented Graphs, Adam Berliner, Chassidy Bozeman, Steve Butler, Minerva Catral, Leslie Hogben, Brenda Kroschel, Jephian C.H. Lin, Nathan Warnberg, Michael Young

*Mathematics Publications*

Zero forcing is an iterative coloring procedure on a graph that starts by initially coloring vertices white and blue and then repeatedly applies the following rule: if any blue vertex has a unique (out-)neighbor that is colored white, then that neighbor is forced to change color from white to blue. An initial set of blue vertices that can force the entire graph to blue is called a zero forcing set. In this paper we consider the minimum number of iterations needed for this color change rule to color all of the vertices blue, also known as the propagation time ...

Recursive Robust Pca Or Recursive Sparse Recovery In Large But Structured Noise, 2017 Iowa State University

#### Recursive Robust Pca Or Recursive Sparse Recovery In Large But Structured Noise, Chenlu Qiu, Namrata Vaswani, Brian Lois, Leslie Hogben

*Namrata Vaswani*

This paper studies the recursive robust principal components analysis problem. If the outlier is the signal-of-interest, this problem can be interpreted as one of recursively recovering a time sequence of sparse vectors, St, in the presence of large but structured noise, Lt. The structure that we assume on Lt is that Lt is dense and lies in a low-dimensional subspace that is either fixed or changes slowly enough. A key application where this problem occurs is in video surveillance where the goal is to separate a slowly changing background (Lt) from moving foreground objects (St) on-the-fly. To solve the above ...

Recursive Robust Pca Or Recursive Sparse Recovery In Large But Structured Noise, 2017 Iowa State University

#### Recursive Robust Pca Or Recursive Sparse Recovery In Large But Structured Noise, Chenlu Qiu, Namrata Vaswani, Brian Lois, Leslie Hogben

*Namrata Vaswani*

This paper studies the recursive robust principal components analysis problem. If the outlier is the signal-of-interest, this problem can be interpreted as one of recursively recovering a time sequence of sparse vectors, St, in the presence of large but structured noise, Lt. The structure that we assume on Lt is that Lt is dense and lies in a low-dimensional subspace that is either fixed or changes slowly enough. A key application where this problem occurs is in video surveillance where the goal is to separate a slowly changing background (Lt) from moving foreground objects (St) on-the-fly. To solve the above ...

On Higman`S Conjecture, 2017 Universidad del Pais Vasco

#### On Higman`S Conjecture, A. Vera-López, J. M. Arregi, M. A. García-Sánchez, L. Ormaetxea

*Electronic Journal of Linear Algebra*

Let Gn be the subgroup of GLn(q) consisting of the upper unitriangular matrices of size nxn over Fq. In 1960, G. Higman conjectured that the number of conjugacy classes of Gn, denoted by r(Gn), was given by a polynomial in q with integer coefficients. This has been verified for nn, r(Gn) can be expressed in terms of r(Gi), with i

Discovery Learning Plus Direct Instruction Equals Success: Modifying American Math Education In The Algebra Classroom, 2017 Seattle Pacific University

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