Mathematics Commons^™

Characteristic Sets Of Matroids, Dony Varghese

Doctoral Dissertations

Matroids are combinatorial structures that generalize the properties of linear independence. But not all matroids have linear representations. Furthermore, the existence of linear representations depends on the characteristic of the fields, and the linear characteristic set is the set of characteristics of fields over which a matroid has a linear representation. The algebraic independence in a field extension also defines a matroid, and also depends on the characteristic of the fields. The algebraic characteristic set is defined in the similar way as the linear characteristic set.

The linear representations and characteristic sets are well studied. But the algebraic representations and …

"Returning To The Root" Of The Problem: Improving The Social Condition Of African Americans Through Science And Mathematics Education, Vanessa R. Pitts Bannister, Julius Davis, Jomo Mutegi, Latasha Thompson, Deborah Lewis

Catalyst: A Social Justice Forum

The underachievement and underrepresentation of African Americans in STEM (Science, Technology, Engineering and Mathematics) disciplines have been well documented. Efforts to improve the STEM education of African Americans continue to focus on relationships between teaching and learning and factors such as culture, race, power, class, learning preferences, cultural styles and language. Although this body of literature is deemed valuable, it fails to help STEM teacher educators and teachers critically assess other important factors such as pedagogy and curriculum. In this article, the authors argue that both pedagogy and curriculum should be centered on the social condition of African Americans – …

Impacts Of Climate Change On The Evolution Of The Electrical Grid, Melissa Ree Allen

Doctoral Dissertations

Maintaining interdependent infrastructures exposed to a changing climate requires understanding 1) the local impact on power assets; 2) how the infrastructure will evolve as the demand for infrastructure changes location and volume and; 3) what vulnerabilities are introduced by these changing infrastructure topologies. This dissertation attempts to develop a methodology that will a) downscale the climate direct effect on the infrastructure; b) allow population to redistribute in response to increasing extreme events that will increase under climate impacts; and c) project new distributions of electricity demand in the mid-21^st century.

The research was structured in three parts. The first …

Positive Periodic Solutions For A Higher Order Functional Difference Equation, Jacob Johnson

Chancellor’s Honors Program Projects

No abstract provided.

On The Number Of Tilings Of A Square By Rectangles, Timothy Michaels

Chancellor’s Honors Program Projects

No abstract provided.

Generalized Branching In Circle Packing, James Russell Ashe

Doctoral Dissertations

Circle packings are configurations of circle with prescribed patterns of tangency. They relate to a surprisingly diverse array of topics. Connections to Riemann surfaces, Apollonian packings, random walks, Brownian motion, and many other topics have been discovered. Of these none has garnered more interest than circle packings' relationship to analytical functions. With a high degree of faithfulness, maps between circle packings exhibit essentially the same geometric properties as seen in classical analytical functions. With this as motivation, an entire theory of discrete analytic function theory has been developed. However limitations in this theory due to the discreteness of circle packings …

The Maximum Clique Problem: Algorithms, Applications, And Implementations, John David Eblen

Doctoral Dissertations

Computationally hard problems are routinely encountered during the course of solving practical problems. This is commonly dealt with by settling for less than optimal solutions, through the use of heuristics or approximation algorithms. This dissertation examines the alternate possibility of solving such problems exactly, through a detailed study of one particular problem, the maximum clique problem. It discusses algorithms, implementations, and the application of maximum clique results to real-world problems. First, the theoretical roots of the algorithmic method employed are discussed. Then a practical approach is described, which separates out important algorithmic decisions so that the algorithm can be easily …

Computational Circle Packing: Geometry And Discrete Analytic Function Theory, Gerald Lee Orick

Doctoral Dissertations

Geometric Circle Packings are of interest not only for their aesthetic appeal but also their relation to discrete analytic function theory. This thesis presents new computational methods which enable additional practical applications for circle packing geometry along with providing a new discrete analytic interpretation of the classical Schwarzian derivative and traditional univalence criterion of classical analytic function theory. To this end I present a new method of computing the maximal packing and solving the circle packing layout problem for a simplicial 2-complex along with additional geometric variants and applications. This thesis also presents a geometric discrete Schwarzian quantity whose value …