Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 6 of 6
Full-Text Articles in Entire DC Network
The Complexity Of Linear Algebra, Leann Kay Christensen
The Complexity Of Linear Algebra, Leann Kay Christensen
Theses Digitization Project
This study examines the complexity of linear algebra. Complexity means how much work, or the number of calculations or time it takes to perform a task. As linear algebra is used more and more in different fields, it becomes useful to study ways of reducing the amount of work required to complete basic procedures.
Snort: A Combinatorial Game, Keiko Kakihara
Snort: A Combinatorial Game, Keiko Kakihara
Theses Digitization Project
This paper focuses on the game Snort, which is a combinatorial game on graphs. This paper will explore the characteristics of opposability through examples. More fully, we obtain some neccessary conditions for a graph to be opposable. Since an opposable graph guarantees a second player win, we examine graphs that result in a first player win.
The Evolution Of Equation-Solving: Linear, Quadratic, And Cubic, Annabelle Louise Porter
The Evolution Of Equation-Solving: Linear, Quadratic, And Cubic, Annabelle Louise Porter
Theses Digitization Project
This paper is intended as a professional developmental tool to help secondary algebra teachers understand the concepts underlying the algorithms we use, how these algorithms developed, and why they work. It uses a historical perspective to highlight many of the concepts underlying modern equation solving.
Symmetric Representations Of Elements Of Finite Groups, Abeir Mikhail Kasouha
Symmetric Representations Of Elements Of Finite Groups, Abeir Mikhail Kasouha
Theses Digitization Project
This thesis demonstrates an alternative, concise but informative, method for representing group elements, which will prove particularly useful for the sporadic groups. It explains the theory behind symmetric presentations, and describes the algorithm for working with elements represented in this manner.
The Embedding Of Complete Bipartite Graphs Onto Grids With A Minimum Grid Cutwidth, Mário Rocha
The Embedding Of Complete Bipartite Graphs Onto Grids With A Minimum Grid Cutwidth, Mário Rocha
Theses Digitization Project
Algorithms will be domonstrated for how to embed complete bipartite graphs onto 2xn type grids, where the imimum grid cutwidth is attained.
Fundamental Theorem Of Algebra, Paul Shibalovich
Fundamental Theorem Of Algebra, Paul Shibalovich
Theses Digitization Project
The fundamental theorem of algebra (FTA) is an important theorem in algebra. This theorem asserts that the complex field is algebracially closed. This thesis will include historical research of proofs of the fundamental theorem of algebra and provide information about the first proof given by Gauss of the theorem and the time when it was proved.