Physical Sciences and Mathematics Commons^™

The Factors Affecting Fashion Trends Have Changing Over The Years By Different Age Groups & The Evolution Of Media., Omnahqiran Dazz

Honors Theses

Introduction:

Fashion trends undergo continuous evolution, influenced by factors such as age groups and the ever-changing landscape of media. This research delves into the intricate relationship between these elements. Initially driven by a passion for fashion, the project expanded to explore the profound impact of social media evolution over the past 15-20 years.

Objectives: Investigate changing fashion trends across age groups.

Examine the evolution of media.

Analyze the factors affecting current-day fashion trends.

Explore the influence of social media on fashion choices.

This study provides invaluable insights for fashion designers, brands, and retailers, aiding in the development of effective market …

Zonality In Graphs, Andrew Bowling

Dissertations

Graph labeling and coloring are among the most popular areas of graph theory due to both the mathematical beauty of these subjects as well as their fascinating applications. While the topic of labeling vertices and edges of graphs has existed for over a century, it was not until 1966 when Alexander Rosa introduced a labeling, later called a graceful labeling, that brought the area of graph labeling to the forefront in graph theory. The subject of graph colorings, on the other hand, goes back to 1852 when the young British mathematician Francis Guthrie observed that the countries in a map …

Irregular Domination In Graphs, Caryn Mays

Dissertations

Domination in graphs has been a popular area of study due in large degree to its applications to modern society as well as the mathematical beauty of the topic. While this area evidently began with the work of Claude Berge in 1958 and Oystein Ore in 1962, domination did not become an active area of research until 1977 with the appearance of a survey paper by Ernest Cockayne and Stephen Hedetniemi. Since then, a large number of variations of domination have surfaced and provided numerous applications to different areas of science and real-life problems. Among these variations are domination parameters …

Using Visual Imagery To Develop Multiplication Fact Strategies, Gina Kling

Dissertations

The learning of basic facts, or the sums and products of numbers 0–10 and their related differences and quotients, has always been a high priority for elementary school teachers. While memorization of basic facts has been a hallmark of elementary school, current recommendations focus on a more nuanced development of fluency with these facts. Fluency is characterized by the ability to demonstrate flexibility, accuracy, efficiency, and appropriate strategy use. Despite recommendations to focus on strategy use, there is insufficient information on instructional approaches that are effective for developing strategies, particularly for multiplication facts. Using visual imagery with dot patterns has …

A View Into Secondary Education Mathematics, Thomas Krieger Jr.

Honors Theses

Teaching methods, and the effects they can have on students, are important to consider for a classroom because when teaching you should allow for every student to have an opportunity. Every student should feel encouraged in the classroom, however not every method may allow for that. An important task for a teacher is to find out how to reach their students in their classroom; be it adapting methods or choosing when to implement one item over another. This task differs with every student that enters the classroom as no student is the same. Every students’ differences stem from their academic …

Autonomous Eco-Driving With Traffic Light And Lead Vehicle Constraints: An Application Of Best Constrained Interpolation, Yara Hazem Mohamed Mahmoud

Masters Theses

Eco-Driving is a critical technology for improving automotive transportation efficiency. It is achieved by modifying the driving trajectory over a particular route to minimize required propulsion energy. Eco-Driving can be approached as an optimal control problem subject to driving constraints such as traffic lights and positions of other vehicles. Best interpolation in a strip is a problem in approximation theory and optimal control. The solution to this problem is a cubic spline. In this research we demonstrate the connection between Eco-Driving and best interpolation in the strip. By exploiting this connection, we are able to generate optimal Eco-Driving trajectories that …

Parallel Resource Defined Fitness Sharing: A Study On Parallel Optimizations For Niching Algorithms, Blayne A. Rogers

Masters Theses

The exploitation of niches by genetic algorithms (GAs) is a computationally expensive, but effective, methodology for solving complex open problems and real-world applications. Niching, differentiated on the modality of sharing, casts problems in terms of the specific resources available. These concepts arise from the broader natural algorithms that encapsulate the ideas and theories used in artificial intelligence. In remediating the computational costs, a study on exploiting niche-defined parallel structures is performed in the contest of the resourcedefined fitness sharing (RFS) algorithm.

Sharing is a natural algorithm paradigm that emulates the use of resources within an environment or population. Defining these …

Irregular Orbital Domination In Graphs, Peter E. Broe

Dissertations

In recent decades, domination in graphs has become a popular area of study due in large degree to its applications to modern society and the mathematical beauty of the topic. While this area evidently began with the work of Claude Berge in 1958 and of Oystein Ore in 1962, domination did not become an active area of research until 1977 with the appearance of a survey paper by Ernest Cockayne and Stephen Hedetniemi. Since then a large number of variations of domination have surfaced and provided numerous applications to different areas of science and real-life problems. Among these variations are …

On Cup-Products Of Cofibers Of Maps Between Moore Spaces, Hopf Invariant, And Lusternik-Schnirelmann Category, Marwa A.S. Mosallam

Masters Theses

In this thesis we make a detailed investigation of the cohomology rings of the cofibers C_β of Moore spaces of dimension 2 by computing the cup products in cofibers and to do so we prove that the Hopf invariant in case of Moore spaces in the zero and nonzero homomorphism case is a homomorphism. We have shown when is 𝓍_r,_k a Co-H-Map. We calculated the homologies and cohomologies of Moore spaces of dimension 2 and of the cofibers C_β where β=𝓍_r,k. We used Lusternik-Schnirelmann category to determine the complexity of C …

Characterizing Undergraduate Students’ Proving Processes Around “Stuck Points”, Yaomingxin Lu

Dissertations

Learning to prove mathematical propositions is a cornerstone of mathematics as a discipline (de Villiers, 1990). However, since proving is a different mathematical activity as compared to students’ prior experience, research has also shown that many undergraduate students struggle to learn to prove, including those who major in mathematics (Moore, 1994; Selden, 2012). While the field has generated research that has analyzed the final products of proof (Selden & Selden, 2009) and there are frameworks for analyzing problem-solving processes (e.g., Carlson & Bloom, 2005; Schoenfeld, 1985, 2010), much remains to be known about analyzing undergraduate students’ proving processes. With a …

Dominating Functions In Graphs, Maria Talanda-Fisher

Dissertations

Domination in graphs has become one of the most popular areas of graph the- ory, no doubt due to its many fascinating problems and applications to modern society, as well as the sheer mathematical beauty of the subject. While this area evidently began with the work by the French mathematician Claude Berge in 1958 and the Norwegian-American mathematician Oystein Ore in 1962, domination did not become an active area of research until 1977 with the appearance of the survey paper by Ernest Cockayne and Stephen Hedetniemi. Since then a large number of variations of domination have surfaced and provided numerous …

On Problems In Random Structures, Ryan Cushman

Dissertations

This work addresses two problems in optimizing substructures within larger random structures. In the first, we study the triangle-packing number v(G), which is the maximum size of a set of edge-disjoint triangles in a graph. In particular we study this parameter for the random graph G(n,m). We analyze a random process called the online triangle packing process in order to bound v(G). The lower bound on v(G(n,m)) that this produces allows for the verification of a conjecture of Tuza for G( …

From Multi-Prime To Subset Labelings Of Graphs, Bethel I. Mcgrew

Dissertations

A graph labeling is an assignment of labels (elements of some set) to the vertices or edges (or both) of a graph G. If only the vertices of G are labeled, then the resulting graph is a vertex-labeled graph. If only the edges are labeled, the resulting graph is an edge-labeled graph. The concept was first introduced in the 19th century when Arthur Cayley established Cayley’s Tree Formula, which proved that there are n^n-2 distinct labeled trees of order n. Since then, it has grown into a popular research area.

In this study, we first review several types …

Saudi Elementary Mathematics Teachers’ Knowledge For Teaching Fractions, Mona Khalifah A Aladil

Dissertations

Recent reform efforts in Saudi Arabia attend to mathematics instruction with a great deal of emphasis to improve Saudi mathematics education. Studies in different countries have confirmed that teachers’ mathematical knowledge for teaching plays an important role in mathematical quality of instruction and students’ achievement (e.g., Ball, 1990; Baumert et al., 2010; Hill, Rowan, & Ball, 2005). Yet few studies about mathematics teachers’ knowledge for teaching have been conducted in the Saudi context. This study investigates Saudi elementary mathematics teachers’ knowledge for teaching in the content strand of rational numbers with an emphasis on fractions, which is an important step …

On The Local Theory Of Profinite Groups, Mohammad Shatnawi

Dissertations

Let G be a finite group, and H be a subgroup of G. The transfer homomorphism emerges from the natural action of G on the cosets of H. The transfer was first introduced by Schur in 1902 [22] as a construction in group theory, which produce a homomorphism from a finite group G into H/H^' an abelian group where H is a subgroup of G and H' is the derived group of H. One important first application is Burnside’s normal p-complement theorem [5] in 1911, although he did not use the transfer homomorphism explicitly to prove it. …

On Codes Over Rings: The Macwilliams Extension Theorem And The Macwilliams Identities, Noha Abdelghany

Dissertations

The MacWilliams extension theorem for code equivalence and the MacWilliams identities for weight enumerators of a code and its dual code are two of the most important results in classical coding theory. In this thesis, we study how much these two results could be extended to codes over more general alphabets, beyond finite fields. In particular, we study the MacWilliams extension theorem and the MacWilliams identities for codes over rings and modules equipped with general weight functions.

Extremal Problems On Induced Graph Colorings, James Hallas

Dissertations

Graph coloring is one of the most popular areas of graph theory, no doubt due to its many fascinating problems and applications to modern society, as well as the sheer mathematical beauty of the subject. As far back as 1880, in an attempt to solve the famous Four Color Problem, there have been numerous examples of certain types of graph colorings that have generated other graph colorings of interest. These types of colorings only gained momentum a century later, however, when in the 1980s, edge colorings were studied that led to vertex colorings of various types, led by the introduction …

Alternating Connectivity In Random Graphs, Patrick Bennett, Ryan Cushman, Andrzej Dudek

Faculty Research and Creative Activities Award (FRACAA)

Many problems in graph theory are so hard in general that they seem hopeless. So sometimes mathematicians lower our expectations a bit, and try to prove that a statement is true for "almost all graphs" (for some reasonable interpretation of what that means) rather than insisting on proving it for all graphs. One way to address questions about about almost all graphs to use a random graph model, the first of which is due to Erdos, Rényi and Gilbert in the 1950's. Since then many more models have been introduced, but they all generate graphs according to the outcome of …

Uniformly Connected Graphs, Nasreen Almohanna

Dissertations

Perhaps the most fundamental property that a graph can possess is that of being connected. Two vertices u and v of a graph G are connected if G contains a u-v path. The graph G itself is connected if every two vertices of G are connected. The well-studied concept of connectivity provides a measure on how strongly connected a graph may be. There are many other degrees of connectedness for a graph. A Hamiltonian path in a graph G is a path containing every vertex of G. Among the best-known classes of highly connected graph are the Hamiltonian-connected graphs, …

The Role Of Sampling Variability In Developing K-8 Preservice Teachers’ Informal Inferential Reasoning, Omar Abu-Ghalyoun

Dissertations

Recent influential policy reports, such as the Common Core State Standards (CCSS-M, 2010) and Guidelines for Assessment and Instruction in Statistics Education Report, (GAISE, 2007), have called for dramatic changes in the statistics content included in the K-8 curriculum. In particular, students in these grades are now expected to develop Informal Inferential Reasoning (IIR) as a way of preparing them for formal concepts of inferential statistics such as confidence intervals and testing hypotheses. Ben-Zvi, Gil, & Apel, (2007) describe IIR as the cognitive activities involved in informally making statistical inferences. Over this path from informal to formal inference, many important …

Variations In Ramsey Theory, Drake Olejniczak

Dissertations

The Ramsey number R(F,H) of two graphs F and H is the smallest positive integer n for which every red-blue coloring of the (edges of a) complete graph of order n results in a graph isomorphic to F all of whose edges are colored red (a red F) or a blue H. Beineke and Schwenk extended this concept to a bipartite version of Ramsey numbers, namely the bipartite Ramsey number BR(F,H) of two bipartite graphs F and H is the smallest positive integer rsuch that every red-blue coloring of the r-regular complete bipartite graph results in either …

Generalized Line Graphs, Mohra Abdullah Z. Alqahtani

Dissertations

With every nonempty graph, there are associated many graphs. One of the best known and most studied of these is the line graph L (G) of a graph G, whose vertices are the edges of G and where two vertices of L (G) are adjacent if the corresponding edges of G are adjacent. This concept was implicitly introduced by Whitney in 1932. Over the years, characterizations of graphs that are line graphs have been given, as well as graphs whose line graphs have some specified property. For example, Beineke characterized graphs that are line graphs by forbidding certain graphs …

Probabilistic And Extremal Problems In Combinatorics, Sean English

Dissertations

Graph theory as a mathematical branch has been studied rigorously for almost three centuries. In the past century, many new branches of graph theory have been proposed. One important branch of graph theory involves the study of extremal graph theory. In 1941, Turán studied one of the first extremal problems, namely trying to maximize the number of edges over all graphs which avoid having certain structures. Since then, a large body of work has been created in the study of similar problems. In this dissertation, a few different extremal problems are studied, but for hypergraphs rather than graphs. In particular, …

The Bellringer Sequence: Investigating What And How Preservice Mathematics Teachers Learn Through Pedagogies Of Enactment, Mary A. Ochieng

Dissertations

This study examines preservice teacher learning through pedagogies of enactment—approaches to teacher education that allow preservice teachers to learn by doing what teachers do. Preservice teacher (PST) learning is examined through the implementation of the Bellringer Sequence (BRS), a pedagogy of enactment conceptualized in the study. The BRS is centered around bellringers—brief mathematical tasks implemented as students arrive for class. The BRS is a sequence of four activities centered on a bellringer: preparation (for teaching a bellringer) implementation (of the bellringer with peers), debriefing (discussing the implementation as colleagues), and written reflection (about the effectiveness of the bellringer).

Practice-based approaches …

Graceful Colorings And Connection In Graphs, Alexis D. Byers

Dissertations

For a graph G of size m, a graceful labeling of G is an injective function f : V (G) → {0, 1, . . . , m} that gives rise to a bijective function f ¹ : E(G) → {1, 2, . . . , m} defined by f ¹(uv) = |f (u) − f (v)|. A graph is graceful if it has a graceful labeling. Over the years, a number of variations of graceful …

Induced Graph Colorings, Ian Hart

Dissertations

An edge coloring of a nonempty graph G is an assignment of colors to the edges of G. In an unrestricted edge coloring, adjacent edges of G may be colored the same. If every two adjacent edges of G are colored differently, then this edge coloring is proper and the minimum number of colors in a proper edge coloring of G is the chromatic index χ^/(G) of G. A proper vertex coloring of a nontrivial graph G is an assignment of colors to the vertices of G such that every two adjacent vertices of …

Elementary/Middle School Pre-Service Teachers’ Understanding Of Variability And The Use Of Dynamical Statistical Software, Yaomingxin Lu

Research and Creative Activities Poster Day

A primary purpose of the study was to examine the effects of using dynamical statistical software (DSS) on prospective teachers’ (PSTs) understanding of statistical concepts, especially variability. Data were collected from PSTs enrolled in a probability and statistics course designed for prospective K-8 teachers. After initial analysis of the data using coding and classification schemes, we found the need to develop a more targeted framework to analyze students’ different levels of understanding. The variability framework (Garfield & Ben-Zvi, 2005) and the Structure of Observed Learning Outcomes (SOLO) taxonomy were then used in combination to develop a revised framework in order …

Edge Induced Weightings Of Uniform Hypergraphs And Related Problems, Laars C. Helenius

Dissertations

The starting point of the research is the so called 1-2-3 Conjecture formulated in 2004 by Karoński, Luczak, and Thomason. Roughly speaking it says that the edges of any graph can be weighted from {1, 2, 3} so that the induced vertex coloring (as the sum of weights adjacent to a given vertex) is proper. The conjecture has attracted a lot of interest from researchers over the last decade but is still unanswered. More recently, the conjecture has been studied for hypergraphs.

The main result of this dissertation shows in particular that an analogous conjecture holds for almost all uniform …

Highly Hamiltonian Graphs And Digraphs, Zhenming Bi

Dissertations

A cycle that contains every vertex of a graph or digraph is a Hamiltonian cycle. A graph or digraph containing such a cycle is itself called Hamiltonian. This concept is named for the famous Irish physicist and mathematician Sir William Rowan Hamilton. These graphs and digraphs have been the subject of study for over six decades. In this dissertation, we study graphs and digraphs with even stronger Hamiltonian properties, namely highly Hamiltonian graphs and digraphs.

The Regularity Lemma And Its Applications, Elizabeth Sprangel

Honors Theses

The regularity lemma (also known as Szemerédi's Regularity Lemma) is one of the most powerful tools used in extremal graph theory. In general, the lemma states that every graph has some structure. That is, every graph can be partitioned into a finite number of classes in a way such that the number of edges between any two parts is “regular." This thesis is an introduction to the regularity lemma through its proof and applications. We demonstrate its applications to extremal graph theory, Ramsey theory, and number theory.