Open Access. Powered by Scholars. Published by Universities.®

Algebra Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 7 of 7

Full-Text Articles in Algebra

Automorphisms Of A Generalized Quadrangle Of Order 6, Ryan Pesak May 2023

Automorphisms Of A Generalized Quadrangle Of Order 6, Ryan Pesak

Undergraduate Honors Theses

In this thesis, we study the symmetries of the putative generalized quadrangle of order 6. Although it is unknown whether such a quadrangle Q can exist, we show that if it does, that Q cannot be transitive on either points or lines. We first cover the background necessary for studying this problem. Namely, the theory of groups and group actions, the theory of generalized quadrangles, and automorphisms of GQs. We then prove that a generalized quadrangle Q of order 6 cannot have a point- or line-transitive automorphism group, and we also prove that if a group G acts faithfully on …


Voting Rules And Properties, Zhuorong Mao Dec 2022

Voting Rules And Properties, Zhuorong Mao

Undergraduate Honors Theses

This thesis composes of two chapters. Chapter one considers the higher order of Borda Rules (Bp) and the Perron Rule (P) as extensions of the classic Borda Rule. We study the properties of those vector-valued voting rules and compare them with Simple Majority Voting (SMV). Using simulation, we found that SMV can yield different results from B1, B2, and P even when it is transitive. We also give a new condition that forces SMV to be transitive, and then quantify the frequency of transitivity when it fails.

In chapter two, we study the `protocol paradox' of approval voting. In approval …


Modern Theory Of Copositive Matrices, Yuqiao Li May 2022

Modern Theory Of Copositive Matrices, Yuqiao Li

Undergraduate Honors Theses

Copositivity is a generalization of positive semidefiniteness. It has applications in theoretical economics, operations research, and statistics. An $n$-by-$n$ real, symmetric matrix $A$ is copositive (CoP) if $x^T Ax \ge 0$ for any nonnegative vector $x \ge 0.$ The set of all CoP matrices forms a convex cone. A CoP matrix is ordinary if it can be written as the sum of a positive semidefinite (PSD) matrix and a symmetric nonnegative (sN) matrix. When $n < 5,$ all CoP matrices are ordinary. However, recognizing whether a given CoP matrix is ordinary and determining an ordinary decomposition (PSD + sN) is still an unsolved problem. Here, we give an overview on modern theory of CoP matrices, talk about our progress on the ordinary recognition and decomposition problem, and emphasis the graph theory aspect of ordinary CoP matrices.


The Enumeration Of Minimum Path Covers Of Trees, Merielyn Sher Apr 2022

The Enumeration Of Minimum Path Covers Of Trees, Merielyn Sher

Undergraduate Honors Theses

A path cover of a tree T is a collection of induced paths of T that are vertex disjoint and cover all the vertices of T. A minimum path cover (MPC) of T is a path cover with the minimum possible number of paths, and that minimum number is called the path cover number of T. A tree can have just one or several MPC's. Prior results have established equality between the path cover number of a tree T and the largest possible multiplicity of an eigenvalue that can occur in a symmetric matrix whose graph is that tree. We …


A Survey Of Methods To Determine Quantum Symmetry Of Graphs, Samantha Phillips May 2021

A Survey Of Methods To Determine Quantum Symmetry Of Graphs, Samantha Phillips

Undergraduate Honors Theses

We introduce the theory of quantum symmetry of a graph by starting with quantum permutation groups and classical automorphism groups. We study graphs with and without quantum symmetry to provide a comprehensive view of current techniques used to determine whether a graph has quantum symmetry. Methods provided include specific tools to show commutativity of generators of algebras of quantum automorphism groups of distance-transitive graphs; a theorem that describes why nontrivial, disjoint automorphisms in the automorphism group implies quantum symmetry; and a planar algebra approach to studying symmetry.


Determining Quantum Symmetry In Graphs Using Planar Algebras, Akshata Pisharody May 2021

Determining Quantum Symmetry In Graphs Using Planar Algebras, Akshata Pisharody

Undergraduate Honors Theses

A graph has quantum symmetry if the algebra associated with its quantum automorphism group is non-commutative. We study what quantum symmetry means and outline one specific method for determining whether a graph has quantum symmetry, a method that involves studying planar algebras and manipulating planar tangles. Modifying a previously used method, we prove that the 5-cycle has no quantum symmetry by showing it has the generating property.


Teaching Algebra: A Comparison Of Scottish And American Perspectives, Brittany Munro May 2015

Teaching Algebra: A Comparison Of Scottish And American Perspectives, Brittany Munro

Undergraduate Honors Theses

A variety of factors influence what teaching strategies an educator uses. I analyze survey responses from algebra teachers in Scotland and Appalachia America to discover how a teacher's perception of these factors, particularly their view of mathematics itself, determines the pedagogical strategies employed in the classroom.