Mathematics Commons^™

Independent Domination Of Subcubic Graphs, Bruce Allan Priddy

Electronic Theses and Dissertations

Let G be a simple graph. The independent domination number i(G) is the minimum cardinality among all maximal independent sets of G. A graph is subcubic whenever the maximum degree is at most three. In this paper, we will show that the independent domination number of a connected subcubic graph of order n having minimum degree at least two is at most 3(n+1)/7, providing a sharp upper bound for subcubic connected graphs with minimum degree at least two.

A Topological Study Of Stochastic Dynamics On Cw Complexes, Michael Joseph Catanzaro

Wayne State University Dissertations

In this dissertation, we consider stochastic motion of subcomplexes of a CW complex, and explore the implications on the underlying space. The random process on the complex is motivated from Ito diffusions on smooth manifolds and Langevin processes in physics. We associate a Kolmogorov equation to this process, whose solutions can be interpretted in terms of generalizations of electrical, as well as stochastic, current to higher dimensions. These currents also serve a key function in relating the random process to the topology of the complex. We show the average current generated by such a process can be written in a …

On Topological Indices And Domination Numbers Of Graphs, Shaohui Wang

Electronic Theses and Dissertations

Topological indices and dominating problems are popular topics in Graph Theory. There are various topological indices such as degree-based topological indices, distance-based topological indices and counting related topological indices et al. These topological indices correlate certain physicochemical properties such as boiling point, stability of chemical compounds. The concepts of domination number and independent domination number, introduced from the mid-1860s, are very fundamental in Graph Theory. In this dissertation, we provide new theoretical results on these two topics. We study k-trees and cactus graphs with the sharp upper and lower bounds of the degree-based topological indices(Multiplicative Zagreb indices). The extremal cacti …

Mathematical And Anthropological Analysis Of Northern Luzon Funeral Textile, Ma. Louise Antonette N. De Las Peñas, Analyn V. Salvador-Amores

Mathematics Faculty Publications

The study presents a mathematical analysis and provides an anthropological perspective of the funeral textile of the indigenous communities in northern Luzon, Philippines. In particular, a symmetry analysis is performed, based on principles of group theory and transformation geometry, on the various repeating patterns found in funeral garments and blankets. Results show that particular frieze groups and plane crystallographic groups are favored due to choice of motifs which are reflective of cultural beliefs and funeral traditions, as well as weaving style and methodology. The results of the analysis point to the depth of mathematics present in the work of the …

Mathematical Frameworks For Consciousness, Menas C. Kafatos, Ashok Narasimhan

Mathematics, Physics, and Computer Science Faculty Articles and Research

If Awareness is fundamental in the universe, mathematical frameworks are better suited to reveal its fundamental aspects than physical models. Awareness operates through three fundamental laws which apply at all levels of reality and is characterized by three universal powers. We explore and summarize in general terms mathematical formalisms that may take us as close as possible to conscious awareness, beginning with the primary relationships between the observer with the observed, using a Hilbert space approach. We also examine insights from category theory, and the calculus of indications or laws of forms. Mathematical frameworks as fundamental languages of our interaction …

Higher Order Z-Ideals In Commutative Rings, Themba Dube, Oghenetega Ighedo

Mathematics, Physics, and Computer Science Faculty Articles and Research

We study ideals that resemble z-ideals in commutative rings with identity. For each positive integer n, we say an ideal of a commutative ring A is a zⁿ-ideal in case it has the property that if a and b belong to the same maximal ideals of A, and aⁿ ϵ I , then bⁿ is also in I. The set of all zⁿ-ideals of A is denoted by A --> ʒⁿ (A). This gives an ascending chain ʒ(A) < ʒ²(A) < ʒ³(A) <… of collections of ideals, starting with the collection of z-ideals. …

Links With Finite N-Quandles, Jim Hoste, Patrick D. Shanahan

Mathematics, Statistics and Data Science Faculty Works

We prove a conjecture of Przytycki which asserts that the n-quandle of a link L in the 3-sphere is finite if and only if the fundamental group of the n-fold cyclic branched cover of the 3-sphere, branched over L, is finite.

The Segal–Shale–Weil Representation, The Indices Of Kashiwara And Maslov, And Quantum Mechanics, Michael C. Berg

Mathematics, Statistics and Data Science Faculty Works

We produce a connection between the Weil 2-cocycles defining the local and adèlic metaplectic groups defined over a global field, i.e. the double covers of the attendant local and adèlic symplectic groups, and local and adèlic Maslov indices of the type considered by Souriau and Leray. With the latter tied to phase integrals occurring in quantum mechanics, we provide a formulation of quadratic reciprocity for the underlying field, first in terms of an adèlic phase integral, and then in terms of generalized time evolution unitary operators.

Colorings, Determinants And Alexander Polynomials For Spatial Graphs, Terry Kong, Alec Lewald, Blake Mellor, Vadim Pigrish

Mathematics, Statistics and Data Science Faculty Works

A {\em balanced} spatial graph has an integer weight on each edge, so that the directed sum of the weights at each vertex is zero. We describe the Alexander module and polynomial for balanced spatial graphs (originally due to Kinoshita \cite{ki}), and examine their behavior under some common operations on the graph. We use the Alexander module to define the determinant and p-colorings of a balanced spatial graph, and provide examples. We show that the determinant of a spatial graph determines for which p the graph is p-colorable, and that a p-coloring of a graph corresponds to a representation of …

Involutory Quandles Of (2,2,R)-Montesinos Links, Jim Hoste, Patrick D. Shanahan

Mathematics, Statistics and Data Science Faculty Works

In this paper we show that Montesinos links of the form L(1/2, 1/2, p/q;e), which we call (2,2,r)-Montesinos links, have finite involutory quandles. This generalizes an observation of Winker regarding the (2, 2, q)-pretzel links. We also describe some properties of these quandles.

The Regularity Of The Boundary Of A Multidimensional Aggregation Patch, Andrea L. Bertozzi, John B. Garnett, Thomas Laurent, Joan Verdera

Mathematics, Statistics and Data Science Faculty Works

We consider solutions to the aggregation equation with Newtonian potential where the initial data are the characteristic function of a domain with boundary of class $C^{1+\gamma}$ ,$0<\gamma<1$. Such initial data are known to yield a solution that, going forward in time, retains a patch-like structure with a constant time-dependent density inside an evolving region, which collapses on itself in a finite time, and which, going backward in time, converges in an $L^1$ sense to a self-similar expanding ball solution. In this work, we prove $C^{1+\gamma}$ regularity of the domain's boundary on the time interval on which the solution exists as an $L^\infty$ patch, up to the collapse time going forward in time and for all finite times going backward in time.

Structure Of The Stable Marriage And Stable Roommate Problems And Applications, Joe Hidakatsu

Theses and Dissertations

The well-known Gale-Shapley algorithm is a solution to the stable marriage problem, but always results in the same stable marriage, regardless of how the algorithm is executed. Robert Irving and Paul Leather constructed the rotation poset, whose downward closed sets are in one-to-one correspondence with the set of stable marriage assignments. We discuss how to use the rotation poset to find the k-optimal matching, and prove that a k-optimal matching is the same as a minimum regret matching for high enough k. Finally, Dan Gusfield defines the rotation poset for the stable roommate problem, and uses it to efficiently enumerate …

Binary Quartic Forms Over Fp, Daniel Thomas Kamenetsky

Theses and Dissertations

Let Vp denote the five dimensional vector space of binary quartic forms over the finite field Fp, with p a prime greater than 3. There is a natural action of the group GL1(Fp)×GL2(Fp) on Vp. This action partitions Vp into orbits, the number of which increases with p. In this thesis, we determine explicitly, for a given p, the number of orbits under the action of GL1(Fp) × GL2(Fp) on Vp. Moreover, we determine the size of each orbit and the general structure of the forms each orbit contains. We also introduce an application of understanding these orbits to the …

Mathematical Writing Assignment For Deeper Understanding And Process Writing, Colton Magnant, Saeed Nasseh, Teresa Flateby

Mathematical Sciences: Faculty Publications

Brief Description: The broad goals of this writing assignment are two-fold: 1) To delve deeper into the inner workings of a chosen proof and explore fundamental motivation of the chosen result. 2) To enhance student learning in the area of academic writing in the discipline of mathematics.

By walking the students through a process of academic writing, we address the following DQP proficiencies: Specialized Knowledge, Applied and Collaborative Learning and Intellectual Skills - Use of Information Resources, Mathematics-Specific Intellectual and Practical Skills and Communicative Fluency.

Background and context: This assignment has been used in a Mathematical Structures (introduction-to-proofs) course and …

Comparing The Growth Of The Prime Numbers To The Natural Numbers, Michael A. Brilleslyper, Nathan Wakefield, A. J. Wallerstein, Bradley Warner

Department of Mathematics: Faculty Publications

We define a new method of measuring the rate of divergence for an increasing positive sequence of integers. We introduce the growth function for such a sequence and its associated growth limit. We use these tools to study the divergence rate for the natural numbers, polynomial and exponential-type sequences, and the prime numbers. We conclude with a number of open questions concerning general properties and characterizations of growth functions and the set of possible growth limits.

Characterizing Mathematics Graduate Student Teaching Assistants’ Opportunities To Learn From Teaching, Yvonne Lai, Wendy Smith, Nathan Wakefield, Erica R. Miller, Julia St. Goar, Corbin M. Groothuis, Kelsey M. Wells

Department of Mathematics: Faculty Publications

Exemplary models to inform novice instruction and the development of graduate teaching assistants (TAs) exist. What is missing from the literature is the process of how graduate students in model professional development programs make sense of and enact the experiences offered. A first step to understanding TAs’ learning to teach is to characterize how and whether they link observations of student work to hypotheses about student thinking and then connect those hypotheses to future teaching actions. A reason to be interested in these connections is that their strength and coherence determine how well TAs can learn from experiences. We found …

R0 Analysis Of A Benthic-Drift Model For A Stream Population, Qihua Huang, Yu Jin, Mark A. Lewis

Department of Mathematics: Faculty Publications

One key issue for theory in stream ecology is how much stream flow can be changed while still maintaining an intact stream ecology, instream flow needs (IFNs); the study of determining IFNs is challenging due to the complex and dynamic nature of the interaction between the stream environ- ment and the biological community. We develop a process-oriented benthic-drift model that links changes in the flow regime and habitat availability with population dynamics. In the model, the stream is divided into two zones, drift zone and benthic zone, and the population is divided into two interacting compartments, individuals residing in the …

Simple Adaptive Control For Positive Linear Systems With Applications To Pest Management, Chris Guiver, Christina Edholm, Yu Jin, Markus Mueller, Jim Powell, Richard Rebarber, Brigitte Tenhumberg, Stuart Townley

Department of Mathematics: Faculty Publications

Pest management is vitally important for modern arable farming, but models for pest species are often highly uncertain. In the context of pest management, control actions are naturally described by a nonlinear feedback that is generally unknown, which thus motivates a robust control approach. We argue that adaptive approaches are well suited for the management of pests and propose a simple high-gain adaptive tuning mechanism so that the nonlinear feedback achieves exponential stabilization. Furthermore, a switched adaptive controller is proposed, cycling through a set of given control actions, that also achieves global asymptotic stability. Such a model in practice allows …

Best Approximations, Lethargy Theorems And Smoothness, Caleb Case

CMC Senior Theses

In this paper we consider sequences of best approximation. We first examine the rho best approximation function and its applications, through an example in approximation theory and two new examples in calculating n-widths. We then further discuss approximation theory by examining a modern proof of Weierstrass's Theorem using Dirac sequences, and providing a new proof of Chebyshev's Equioscillation Theorem, inspired by the de La Vallee Poussin Theorem. Finally, we examine the limits of approximation theorem by looking at Bernstein Lethargy theorem, and a modern generalization to infinite-dimensional subspaces. We all note that smooth functions are bounded by Jackson's Inequalities, but …

A Polyhedral Model Of Partitions With Bounded Differences And A Bijective Proof Of A Theorem Of Andrews, Beck, And Robbins, Felix Breuer, Brandt Kronholm

School of Mathematical & Statistical Sciences Faculty Publications

The smallest part is a rational function. This result is similar to the closely related case of partitions with fixed differences between largest and smallest parts which has recently been studied through analytic methods by Andrews, Beck, and Robbins. Our approach is geometric: We model partitions with bounded differences as lattice points in an infinite union of polyhedral cones. Surprisingly, this infinite union tiles a single simplicial cone. This construction then leads to a bijection that can be interpreted on a purely combinatorial level.