Mathematics Commons^™

The Complete Classification Of Five-Dimensional Dirichlet–Voronoi Polyhedra Of Translational Lattices, Mathieu Dutour Sikiric, Alexey Garber, Achill Schürmann, Clara Waldmann

School of Mathematical & Statistical Sciences Faculty Publications

This paper reports on the full classification of Dirichlet–Voronoi polyhedra and Delaunay subdivisions of five-dimensional translational lattices. A complete list is obtained of 110 244 affine types (L-types) of Delaunay subdivisions and it turns out that they are all combinatorially inequivalent, giving the same number of combinatorial types of Dirichlet–Voronoi polyhedra. Using a refinement of corresponding secondary cones, 181 394 contraction types are obtained. The paper gives details of the computer-assisted enumeration, which was verified by three independent implementations and a topological mass formula check.

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.

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 …

To The Memory Of R. Freivalds, Efim Kinber

School of Computer Science & Engineering Faculty Publications

The paper contains author’s memories of his mentor and teacher R. M. Freivalds.

Automated Conjecturing Approach For Benzenoids, David Muncy

Theses and Dissertations

Benzenoids are graphs representing the carbon structure of molecules, defined by a closed path in the hexagonal lattice. These compounds are of interest to chemists studying existing and potential carbon structures. The goal of this study is to conjecture and prove relations between graph theoretic properties among benzenoids. First, we generate conjectures on upper bounds for the domination number in benzenoids using invariant-defined functions. This work is an extension of the ideas to be presented in a forthcoming paper. Next, we generate conjectures using property-defined functions. As the title indicates, the conjectures we prove are not thought of on our …

Automated Conjecturing Approach To The Discrete Riemann Hypothesis, Alexander Bradford

Theses and Dissertations

This paper is a study on some upper bounds of the Mertens function, which is often considered somewhat of a ``mysterious" function in mathematics and is closely related to the Riemann Hypothesis. We discuss some known bounds of the Mertens function, and also seek new bounds with the help of an automated conjecture-making program named CONJECTURING, which was created by C. Larson and N. Van Cleemput, and inspired by Fajtowicz's Dalmatian Heuristic. By utilizing this powerful program, we were able to form, validate, and disprove hypotheses regarding the Mertens function and how it is bounded.

On Crown-Free Set Families, Diffusion State Difference, And Non-Uniform Hypergraphs, Edward Lawrence Boehnlein

Theses and Dissertations

We present results in three different arenas of discrete mathematics. Let La(n, H) denote the cardinality of the largest family on the Boolean lattice that does not contain H as a subposet. Denote π(H) := limn→∞ La(n,H) (bn/ n2c) . A crown O2k for k ≥ 2 is a poset on 2 levels whose Hasse diagram is a cycle. Griggs and Lu (2009) showed π(O4k) = 1 for k ≥ 2. Lu (2014) proved π(O2k) = 1 for odd k ≥ 7. We prove that the maximum size of a O6 -free family, when restricted to the middle two levels …

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 …

Gorenstein Projective (Pre)Covers, Michael J. Fox

College of Graduate Studies: Theses & Dissertations

The existence of the Gorenstein projective precovers is one of the main open problems in Gorenstein Homological algebra. We give sufficient conditions in order for the class of Gorenstein projective complexes to be special precovering in the category of complexes of R-modules Ch(R). More precisely, we prove that if every complex in Ch(R) has a special Gorenstein flat cover, every Gorenstein projective complex is Gorenstein flat, and every Gorenstein flat complex has finite Goenstein projective dimension, then the class of Gorenstein projective complexes, GP(C), is special precovering in Ch(R).

Gallai-Ramsey Number Of An 8-Cycle, Jonathan Gregory

College of Graduate Studies: Theses & Dissertations

Given a graph G and a positive integer k, define the Gallai-Ramsey number to be the minimum number of vertices n such that any k-edge-coloring of Kn contains either a rainbow (all different colored) triangle or a monochromatic copy of G. In this work, we establish the Gallai-Ramsey number of an 8-cycle for all positive integers.

Gorenstein Projective Precovers In The Category Of Modules, Katelyn Coggins

College of Graduate Studies: Theses & Dissertations

It was recently proved that if R is a coherent ring such that R is also left n-perfect, then the class of Gorenstein projective modules, GP, is precovering. We will prove that the class of Gorenstein projective modules is special precovering over any left GF-closed ring R such that every Gorenstein projective module is Gorenstein flat and every Gorenstein flat module has finite Gorenstein projective dimension. This class of rings includes that of right coherent and left n-perfect rings.

A Partition Function Connected With The Göllnitz-Gordon Identities, Nicolas A. Smoot

College of Graduate Studies: Theses & Dissertations

Nearly a century ago, the mathematicians Hardy and Ramanujan established their celebrated circle method to give a remarkable asymptotic expression for the unrestricted partition function. Following later improvements by Rademacher, the method was utilized by Niven, Lehner, Iseki, and others to develop rapidly convergent series representations of various restricted partition functions. Following in this tradition, we use the circle method to develop formulas for counting the restricted classes of partitions that arise in the Gollnitz-Gordon identities. We then show that our results are strongly supported by numerical tests. As a side note, we also derive and compare the asymptotic behavior …

Some Extremal And Structural Problems In Graph Theory, Taylor Mitchell Short

Theses and Dissertations

This work considers three main topics. In Chapter 2, we deal with König-Egerváry graphs. We will give two new characterizations of König-Egerváry graphs as well as prove a related lower bound for the independence number of a graph. In Chapter 3, we study joint degree vectors (JDV). A problem arising from statistics is to determine the maximum number of non-zero elements of a JDV. We provide reasonable lower and upper bounds for this maximum number. Lastly, in Chapter 4 we study a problem in chemical graph theory. In particular, we characterize extremal cases for the number of maximal matchings in …

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 …

Modeling Of Structural Relaxation By A Variable-Order Fractional Differential Equation, Su Yang

Theses and Dissertations

In physical point of view, relaxation usually describes the return from a perturbed system into equilibrium and each process has its own characteristic relaxation time. In 1946, Tool first formulated the notion of fictive temperature to characterize the structure of a glass-forming melt. Since then, people used to simulate structural relaxation by first order model. Since fractional-based models have not widely applied in modeling the fictive temperature, I want to explore the the possibility of modeling structural relaxation by fractional differential equation.

In this thesis, I will first introduce the definitions of two different kinds of fractional derivatives: Riemann-Liouville fractional …

An Exposition Of The Eisenstein Integers, Sarada Bandara

Masters Theses

In this thesis, we will give a brief introduction to number theory and prime numbers. We also provide the necessary background to understand how the imaginary ring of quadratic integers behaves.

An example of said ring are complex numbers of the form ℤ[ω] = {a+bω ∣ a, b ∈ ℤ} where ω² + ω + 1 = 0. These are known as the Eisenstein integers, which form a triangular lattice in the complex plane, in contrast with the Gaussian integers, ℤ[i] = {a + bi ∣ a, b ∈ …

Interval Edge-Colorings Of Graphs, Austin Foster

Electronic Theses and Dissertations

A proper edge-coloring of a graph G by positive integers is called an interval edge-coloring if the colors assigned to the edges incident to any vertex in G are consecutive (i.e., those colors form an interval of integers). The notion of interval edge-colorings was first introduced by Asratian and Kamalian in 1987, motivated by the problem of finding compact school timetables. In 1992, Hansen described another scenario using interval edge-colorings to schedule parent-teacher conferences so that every person's conferences occur in consecutive slots. A solution exists if and only if the bipartite graph with vertices for parents and teachers, and …

Comparing The Variational Approximation And Exact Solutions Of The Straight Unstaggered And Twisted Staggered Discrete Solitons, Daniel Marulanda

Electronic Theses and Dissertations

Discrete nonlinear Schrödinger equations (DNSL) have been used to provide models of a variety of physical settings. An application of DNSL equations is provided by Bose-Einstein condensates which are trapped in deep optical-lattice potentials. These potentials effectively splits the condensate into a set of droplets held in local potential wells, which are linearly coupled across the potential barriers between them [3]. In previous works, DNLS systems have also been used for symmetric on-site-centered solitons [11]. A few works have constructed different discrete solitons via the variational approximation (VA) and have explored their regions for their solutions [11, 12]. Exact solutions …

Computational Study Of Traveling Wave Solutions And Global Stability Of Predator-Prey Models, Yi Zhu

Electronic Theses and Dissertations

In this thesis, we study two types of reaction-diffusion systems which have direct applications in understanding wide range of phenomena in chemical reaction, biological pattern formation and theoretical ecology. The first part of this thesis is on propagating traveling waves in a class of reaction-diffusion systems which model isothermal autocatalytic chemical reactions as well as microbial growth and competition in a flow reactor. In the context of isothermal autocatalytic systems, two different cases will be studied. The first is autocatalytic chemical reaction of order $m$ without decay. The second is chemical reaction of order $m$ with a decay of order …

Weighted Low-Rank Approximation Of Matrices:Some Analytical And Numerical Aspects, Aritra Dutta

Electronic Theses and Dissertations

This dissertation addresses some analytical and numerical aspects of a problem of weighted low-rank approximation of matrices. We propose and solve two different versions of weighted low-rank approximation problems. We demonstrate, in addition, how these formulations can be efficiently used to solve some classic problems in computer vision. We also present the superior performance of our algorithms over the existing state-of-the-art unweighted and weighted low-rank approximation algorithms. Classical principal component analysis (PCA) is constrained to have equal weighting on the elements of the matrix, which might lead to a degraded design in some problems. To address this fundamental flaw in …

On The Double Chain Ladder For Reserve Estimation With Bootstrap Applications, Larissa Schoepf

Masters Theses

"To avoid insolvency, insurance companies must have enough reserves to fulfill their present and future commitment-refer to in this thesis as outstanding claims towards policyholders. This entails having an accurate and reliable estimate of funds necessary to cover those claims as they are presented. One of the major techniques used by practitioners and researchers is the single chain ladder method. However, though most popular and widely used, the method does not offer a good understanding of the distributional properties of the way claims evolve. In a series of recent papers, researchers have focused on two potential components of outstanding claims, …

A Linear Matrix Inequality-Based Approach For The Computation Of Actuator Bandwidth Limits In Adaptive Control, Daniel Robert Wagner

Masters Theses

"Linear matrix inequalities and convex optimization techniques have become popular tools to solve nontrivial problems in the field of adaptive control. Specifically, the stability of adaptive control laws in the presence of actuator dynamics remains as an important open control problem. In this thesis, we present a linear matrix inequalities-based hedging approach and evaluate it for model reference adaptive control of an uncertain dynamical system in the presence of actuator dynamics. The ideal reference dynamics are modified such that the hedging approach allows the correct adaptation without being hindered by the presence of actuator dynamics. The hedging approach is first …

Math 433: Nonlinear Optimization—A Peer Review Of Teaching Project Benchmark Portfolio, Adam Larios

UNL Faculty Course Portfolios

My intention in this portfolio is to highlight various approaches to teaching higher-level mathematics with a programming component that I tried in a course on nonlinear optimization. There is a particular focus on students with little or no previous programming experience. Several case studies are done using "pre- and post-course" surveys which examined items such as student confidence in programming, and particular programming skills. Sample examples and sample homeworks are presented and discussed. Also presented are several materials I designed to lead students into programming and shed light on certain problems. These Materials assume some basic mathematical reasoning and knowledge, …

New Inequalities For Fractional Integrals And Their Applications, Hsiow Ru Hwang, Kuei Lin Tseng, Kai Chen Hsu

Turkish Journal of Mathematics

In this paper, we establish some Hermite--Hadamard-type, Bullen-type, and Simpson-type inequalities for fractional integrals. Some applications for the beta function are also given.

The Inclusion Theorems For Variable Exponent Lorentz Spaces, Öznur Kulak

Turkish Journal of Mathematics

Let $\left( \text{X,}\Sigma ,\mu \right) $ and $\left( \text{X,}\Sigma ,\nu \right) $ be measure spaces. Assume that $L^{p_{1}\left( .\right) ,q_{1}\left( .\right) }\left( X,\mu \right) $ and $L^{p_{2}\left( .\right) ,q_{2}\left( .\right) }\left( X,\nu \right) $ are two variable exponent Lorentz spaces where $p,q\in P_{0}\left( \left[ 0,l\right] \right) $. In this paper we investigated the existence of the inclusion $L^{p_{1}\left( .\right) ,q_{1}\left( .\right) }\left( X,\mu \right) $ $\subset L^{p_{2}\left( .\right) ,q_{2}\left( .\right) }\left( X,\nu \right) $ under what conditions for two measures $\mu $ and $\nu $ on $\left( X,\Sigma \right) .$

Point-Wise Slant Submanifolds In Almost Contact Geometry, Mohammad Bagher Kazemi Balgeshir

Turkish Journal of Mathematics

In this paper, we introduce point-wise slant submanifolds of almost contact and almost contact 3-structure manifolds. We characterize them, give some examples, and obtain necessary and sufficient conditions for a point-wise slant submanifold of a 3-Sasakian manifold to be a slant submanifold. Moreover, we show that there exist no proper Sasakian point-wise 3-slant submanifolds.

Projective Crossed Modules Of Algebras And Cyclic Homology, Eli̇f Ilgaz

Turkish Journal of Mathematics

In this work, we give a characterization of free crossed modules and also get a relation between projective crossed modules and the cyclic homology of associative algebras by using Hopf-type formulas.

Harmonic Functions And Quadratic Harmonic Morphisms On Walker Spaces, Cornelia-Livia Bejan, Simona-Luiza Druta-Romaniuc

Turkish Journal of Mathematics

Let $(W,q, \mathcal{D})$ be a 4-dimensional Walker manifold. After providing a characterization and some examples for several special $(1,1)$-tensor fields on $(W,q, \mathcal{D})$, we prove that the proper almost complex structure $J$, introduced by Matsushita, is harmonic in the sense of Garcia-Rio et al. if and only if the almost Hermitian structure $(J,q)$ is almost Kahler. We classify all harmonic functions locally defined on $(W,q, \mathcal{D})$. We deal with the harmonicity of quadratic maps defined on $\mathbb{R}^4$ (endowed with a Walker metric $q$) to the $n$-dimensional semi-Euclidean space of index $r$, and then between local charts of two 4-dimensional Walker …

A Characterization Of Derivations On Uniformly Mean Value Banach Algebras, Amin Hosseini

Turkish Journal of Mathematics

In this paper, a uniformly mean value Banach algebra (briefly UMV-Banach algebra) is defined as a new class of Banach algebras, and we characterize derivations on this class of Banach algebras. Indeed, it is proved that if $\mathcal{A}$ is a unital UMV-Banach algebra such that either $a = 0$ or $b = 0$ whenever $ab = 0$ in $\mathcal{A}$, and if $\delta:\mathcal{A} \rightarrow \mathcal{A}$ is a derivation such that $a \delta(a) = \delta(a)a$ for all $a \in \mathcal{A}$, then the following assertions are equivalent:\\ (i) $\delta$ is continuous; \\(ii) $\delta(e^a) = e^a\delta(a)$ for all $a \in \mathcal{A}$; \\(iii) $\delta$ is …

A New Approach To Soft Uniform Spaces, Taha Yasi̇n Öztürk

Turkish Journal of Mathematics

The purpose of this paper is to introduce the concept of soft uniform spaces and the relationships between soft uniform spaces and uniform spaces. The notions of soft uniform structure, soft uniform continious function, and operations on soft uniform space are introduced and their basic properties are investigated.