Open Access. Powered by Scholars. Published by Universities.®
Discrete Mathematics and Combinatorics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Discrete Mathematics and Combinatorics
Dna Self-Assembly Of Trapezohedral Graphs, Hytham Abdelkarim
Dna Self-Assembly Of Trapezohedral Graphs, Hytham Abdelkarim
Electronic Theses, Projects, and Dissertations
Self-assembly is the process of a collection of components combining to form an organized structure without external direction. DNA self-assembly uses multi-armed DNA molecules as the component building blocks. It is desirable to minimize the material used and to minimize genetic waste in the assembly process. We will be using graph theory as a tool to find optimal solutions to problems in DNA self-assembly. The goal of this research is to develop a method or algorithm that will produce optimal tile sets which will self-assemble into a target DNA complex. We will minimize the number of tile and bond-edge types …
Complex-Valued Approach To Kuramoto-Like Oscillators, Jacqueline Bao Ngoc Doan
Complex-Valued Approach To Kuramoto-Like Oscillators, Jacqueline Bao Ngoc Doan
Electronic Thesis and Dissertation Repository
The Kuramoto Model (KM) is a nonlinear model widely used to model synchrony in a network of oscillators – from the synchrony of the flashing fireflies to the hand clapping in an auditorium. Recently, a modification of the KM (complex-valued KM) was introduced with an analytical solution expressed in terms of a matrix exponential, and consequentially, its eigensystem. Remarkably, the analytical KM and the original KM bear significant similarities, even with phase lag introduced, despite being determined by distinct systems. We found that this approach gives a geometric perspective of synchronization phenomena in terms of complex eigenmodes, which in turn …
The Lie Algebra Sl2(C) And Krawtchouk Polynomials, Nkosi Alexander
The Lie Algebra Sl2(C) And Krawtchouk Polynomials, Nkosi Alexander
UNF Graduate Theses and Dissertations
The Lie algebra L = sl2(C) consists of the 2 × 2 complex matrices that have trace zero, together with the Lie bracket [y, z] = yz − zy. In this thesis we study a relationship between L and Krawtchouk polynomials. We consider a type of element in L said to be normalized semisimple. Let a, a^∗ be normalized semisimple elements that generate L. We show that a, a^∗ satisfy a pair of relations, called the Askey-Wilson relations. For a positive integer N, we consider an (N + 1)-dimensional irreducible L-module V consisting of the homogeneous polynomials in two variables …
Counting Spanning Trees On Triangular Lattices, Angie Wang
Counting Spanning Trees On Triangular Lattices, Angie Wang
CMC Senior Theses
This thesis focuses on finding spanning tree counts for triangular lattices and other planar graphs comprised of triangular faces. This topic has applications in redistricting: many proposed algorithmic methods for detecting gerrymandering involve spanning trees, and graphs representing states/regions are often triangulated. First, we present and prove Kirchhoff’s Matrix Tree Theorem, a well known formula for computing the number of spanning trees of a multigraph. Then, we use combinatorial methods to find spanning tree counts for chains of triangles and 3 × n triangular lattices (some limiting formulas exist, but they rely on higher level mathematics). For a chain of …