Mathematics Commons^™

Optimal Control Applied To Cancer Vaccine Protocols, Brady Fritz

Student Scholars Day Posters

This research focused on a mathematical model for the administration of a cancer vaccine. This model involves time delays, making it a more difficult optimal control problem to solve. The mathematical model describes the administration of the vaccine along with certain groups of cells affected over time. The model was programmed into a specialized software called the Sparse Optimization Suite which could output a solution. This solution was then analyzed in order to properly describe it.

Non-Attacking Queen And Rook Placements, Nicholas Layman

Student Scholars Day Posters

In 1848, Max Bezel introduced the problem of placing 8 queens on an 8 × 8 chess board so that none of the queens could attack each other. One generalization of this — the placement of n non-attacking queens on an n × n chess board — is the famous n-queens problem. A different but similar problem is that of placing non-attacking rooks on a generalized chess board which has connections to restricted permutations and has more general solutions known as compared to its queen counterpart. In this presentation, we investigate the intersection of these two problems — placing n …

Class Of Integrals Involving Generalized Hypergeometric Function, D. L. Suthar, Teklay Hailay, Hafte Amsalu, Jagdev Singh

Applications and Applied Mathematics: An International Journal (AAM)

In this paper, we establish some definite integrals involving generalized hypergeometric function, product of algebraic functions, Jacobi function, Legendre function and general class of polynomials. Certain special cases of the main results are also pointed out.

Math 120bc – Precalculus, Virginia Thompson

Open Educational Resources

Students will explore advanced topics in algebra, functions and graphs, inverse functions, composite functions, polynomial and rational functions, trigonometry, exponential and logarithmic functions.

Local-Global Principles For Diophantine Equations, Benjamin Barham

Senior Honors Theses

The real number field, denoted ℝ, is the most well-known extension field of ℚ, the field of rational numbers, but it is not the only one. For each prime p, there exists an extension field ℚ_p of ℚ, and these fields, known as the p-adic fields, have some properties substantially different from ℝ. In this paper, we construct the p-adic numbers from the ground up and discuss the local-global principle, which concerns connections between solutions of equations found in ℚ and in ℚ_p. We state the Hasse-Minkowski theorem, which addresses a type …

Diameter Of 3-Colorable Graphs And Some Remarks On The Midrange Crossing Constant, Inne Singgih

Theses and Dissertations

The first part of this dissertation discussing the problem of bounding the diameter of a graph in terms of its order and minimum degree. The initial problem was solved independently by several authors between 1965 − 1989. They proved that for fixed δ ≥ 2 and large n, diam(G) ≤ 3n+ O(1). In 1989, Erdős, Pach, Pollack, and Tuza conjectured that the upper bound on the diameter can be improved if G does not contain a large complete subgraph K_k.

Let r, δ ≥ 2 be fixed integers and let G be a connected graph with n vertices …

Counting Number Fields By Discriminant, Harsh Mehta

Theses and Dissertations

The central topic of this dissertation is counting number fields ordered by discriminant. We fix a base field k and let Nd(k,G;X) be the number of extensions N/k up to isomorphism with Nk/Q(dN/k) ≤ X, [N : k] = d and the Galois closure of N/k is equal to G.

We establish two main results in this work. In the first result we establish upper bounds for N_|G| (k,G;X) in the case that G is a finite group with an abelian normal subgroup. Further, we establish upper bounds for the case N _|F| (k,G;X) where G is a Frobenius …

Rationality Questions And The Derived Category, Alicia Lamarche

Theses and Dissertations

This document is roughly divided into four chapters. The first outlines basic preliminary material, definitions, and foundational theorems required throughout the text. The second chapter, which is joint work with Dr. Matthew Ballard, gives an example of a family of Fano arithmetic toric varieties in which the derived category is able to detect the existence of k-rational points. More succinctly, we show that if X is a generalized del Pezzo variety defined over a field k, then X contains a k-rational point (and is in fact k-rational, that is, birational to Pnk ) if and only if Db(X) admits a …

Connections Between Extremal Combinatorics, Probabilistic Methods, Ricci Curvature Of Graphs, And Linear Algebra, Zhiyu Wang

Theses and Dissertations

This thesis studies some problems in extremal and probabilistic combinatorics, Ricci curvature of graphs, spectral hypergraph theory and the interplay between these areas. The first main focus of this thesis is to investigate several Ramsey-type problems on graphs, hypergraphs and sequences using probabilistic, combinatorial, algorithmic and spectral techniques:

• The size-Ramsey number Rˆ(G, r) is defined as the minimum number of edges in a hypergraph H such that every r-edge-coloring of H contains a monochromatic copy of G in H. We improved a result of Dudek, La Fleur, Mubayi and Rödl [ J. Graph Theory 2017 ] on the size-Ramsey number …

An Ensemble-Based Projection Method And Its Numerical Investigation, Shuai Yuan

Theses and Dissertations

In many cases, partial differential equation (PDE) models involve a set of parameters whose values may vary over a wide range in application problems, such as optimization, control and uncertainty quantification. Performing multiple numerical simulations in large-scale settings often leads to tremendous demands on computational resources. Thus, the ensemble method has been developed for accelerating a sequence of numerical simulations. In this work we first consider numerical solutions of Navier-Stokes equations under different conditions and introduce the ensemblebased projection method to reduce the computational cost. In particular, we incorporate a sparse grad-div stabilization into the method as a nonzero penalty …

Finite Axiomatisability In Nilpotent Varieties, Joshua Thomas Grice

Theses and Dissertations

Study of general algebraic systems has long been concerned with finite basis results that prove finite axiomatisability of certain classes of general algebras. In the 1970’s, Bjarni Jónsson speculated that a variety generated by a finite algebra might be finitely based provided the variety has a finite residual bound (that is, a finite bound on the cardinality of subdirectly irreducible algebras in the variety). As such, most finite basis results since then have had the hypothesis of a finite residual bound. However, Jónsson also speculated that it might be sufficient to replace the finite residual bound with the weaker hypothesis …

Distance Related Graph Invariants In Triangulations And Quadrangulations Of The Sphere, Trevor Vincent Olsen

Theses and Dissertations

The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. I provide asymptotic upper bounds and sharp lower bounds for the Wiener index of simple triangulations and quadrangulations with given connectivity. Additionally, I make conjectures for the extremal triangulations and quadrangulations which maximize the Wiener index based on computational evidence. If σ(v) denotes the arithmetic mean of the distances from v to all other vertices of G, then the remoteness and proximity of G are defined as the largest and smallest value of σ(v) over all vertices v of G, respectively. …

Windows And Generalized Drinfeld Kernels, Robert R. Vandermolen

Theses and Dissertations

We develop a generalization of a construction of Drinfeld, first inspired by the Qconstruction of Ballard, Diemer, and Favero. We use this construction to provide kernels for Grassmann flops over an arbitrary field of characteristic zero. In the case of Grassmann flops this generalization recovers the kernel for a Fourier-Mukai functor on the derived category of the associated global quotient stack studied by Buchweitz, Leuschke, and Van den Bergh. We show an idempotent property for this kernel, which after restriction, induces a derived equivalence over any twisted form of a Grassmann flop.

Two Inquiries Related To The Digits Of Prime Numbers, Jeremiah T. Southwick

Theses and Dissertations

This dissertation considers two different topics. In the first part of the dissertation, we show that a positive proportion of the primes have the property that if any one of their digits in base 10, including their infinitely many leading 0 digits, is replaced by a different digit, then the resulting number is composite. We show that the same result holds for bases b 2 {2, 3, · · · , 8, 9, 11, 31}.

In the second part of the dissertation, we show for an integer b ≥ 5 that if a polynomial ƒ( x) with non-negative coefficients …

Space-Efficient Prime Knot 7-Mosaics, Aaron Heap, Natalie Lacourt

Mathematics

The concepts of tile number and space-efficiency for knot mosaics were first explored by Heap and Knowles in 2018, where they determined the possible tile numbers and space-efficient layouts for every prime knot with mosaic number 6 or less. In this paper, we extend those results to prime knots with mosaic number 7. Specifically, we find the possible values for the number of non-blank tiles used in a space-efficient 7   7 mosaic of a prime knot are 27, 29, 31, 32, 34, 36, 37, 39, and 41. We also provide the possible layouts for the mosaics that lead to these …

Analysis Of An Ode Model For Sea Turtle Populations With Temperature-Dependent Sex Determination, Lindsey A. Ukishima

Student Publications

The sex of green sea turtles is determined by the temperature at which the eggs are incubated. Recent studies have shown that the sex ratios of sea turtle populations have changed over recent years, likely due to climate change, which has produced a more female-biased population. This paper finds the nonzero equilibrium point of the novel system developed by Herrera et a. (2019) and attempts to determine the stability of the population at that point.

Randomized Algorithms And How Society Uses Them Everyday, Rosaley Milano

Undergraduate Honors Thesis Projects

Randomness is an interesting and very beneficial phenomenon. In computer science randomness facilitates great advances in efficiency but topics like randomized algorithms aren’t taught until someone enters graduate school. This paper provides undergraduates as well as people unacquainted with computer science an opportunity to explore the topic of randomness by guiding them from essential topics all the way through the graduate level topic of randomized algorithms. Topics like what an algorithm is, how they are represented and the history that brought them into existence bring the reader up to speed before diving deeper into randomized algorithms. A discussion of complexity …

Guided Notes For College Algebra (Ggc), Rabia Shahbaz, Janice Alves

Mathematics Ancillary Materials

This collection of guided notes was created through a Round Fifteen Mini-Grant for Ancillary Materials Creation and Revision. Major topics include:

• Review Topics
• Equations and Inequalities
• Functions and Graphs
• Other Functions and Inequalities
• Exponentials and Logarithms

Infectious Disease Mortality Prediction, Kazi Tanvir Hasan

Mathematics

When mortality statistics are reported for infectious diseases, they commonly reflect the ratio for the entire population impacted from it. This causes an underestimation since the frail members of the population are impacted at a higher rate. With the remaining healthy members, the mortality rate becomes skewed. With this project, we study predicting mortality under varying frailty conditions to account for the hidden heterogeneity's impact on the parameter estimates.

Ramanujan’S Theorem And Highest Abundant Numbers, Oleg R. Musin

School of Mathematical & Statistical Sciences Faculty Publications

In 1915, Ramanujan proved asymptotic inequalities for the sum of divisors function, assuming the Riemann hypothesis (RH). We consider a strong version of Ramanujan’s theorem and define highest abundant numbers that are extreme with respect to the Ramanujan and Robin inequalities. Properties of these numbers are very different depending on whether the RH is true or false.