Mathematics Commons^™

Mathematical Modeling Of The Candida Albicans Yeast To Hyphal Transition Reveals Novel Control Strategies, David J. Wooten, Jorge Gómez Tejeda Zañudo, David Murrugarra, Austin M. Perry, Anna Dongari-Bagtzoglou, Reinhard Laubenbacher, Clarissa J. Nobile, Réka Albert

Mathematics Faculty Publications

Candida albicans, an opportunistic fungal pathogen, is a significant cause of human infections, particularly in immunocompromised individuals. Phenotypic plasticity between two morphological phenotypes, yeast and hyphae, is a key mechanism by which C. albicans can thrive in many microenvironments and cause disease in the host. Understanding the decision points and key driver genes controlling this important transition and how these genes respond to different environmental signals is critical to understanding how C. albicans causes infections in the host. Here we build and analyze a Boolean dynamical model of the C. albicans yeast to hyphal transition, integrating …

Entropic Dynamics Of Networks, Felipe Xavier Costa, Pedro Pessoa

Northeast Journal of Complex Systems (NEJCS)

Here we present the entropic dynamics formalism for networks. That is, a framework for the dynamics of graphs meant to represent a network derived from the principle of maximum entropy and the rate of transition is obtained taking into account the natural information geometry of probability distributions. We apply this framework to the Gibbs distribution of random graphs obtained with constraints on the node connectivity. The information geometry for this graph ensemble is calculated and the dynamical process is obtained as a diffusion equation. We compare the steady state of this dynamics to degree distributions found on real-world networks.

Emergent Hierarchy Through Conductance-Based Degree Constraints, Christopher Tyler Diggans, Jeremie Fish, Erik M. Bollt

Northeast Journal of Complex Systems (NEJCS)

The presence of hierarchy in many real-world networks is not yet fully understood. We observe that complex interaction networks are often coarse-grain models of vast modular networks, where tightly connected subgraphs are agglomerated into nodes for simplicity of representation and computational feasibility. The emergence of hierarchy in such growing complex networks may stem from one particular property of these ignored subgraphs: their graph conductance. Being a quantification of the main bottleneck of flow through the coarse-grain node, this scalar quantity implies a structural limitation and supports the consideration of heterogeneous degree constraints. The internal conductance values of the subgraphs are …

Optimizing Networking Topologies With Shortest Path Algorithms, Jordan Sahs

UNO Student Research and Creative Activity Fair

Communication networks tend to contain redundant devices and mediums of transmission, thus the need to locate, document, and optimize networks is increasingly becoming necessary. However, many people do not know where to start the optimization progress. What is network topology? What is this “Shortest Path Problem”, and how can it be used to better my network? These questions are presented, taught, and answered within this paper. To supplement the reader’s understanding there are thirty-eight figures in the paper that are used to help convey and compartmentalize the learning process needed to grasp the materials presented in the ending sections.

In …

Embedding Factorizations, Anna Johnsen

Theses and Dissertations

Let $V$ be a set of $n$ vertices for some $n\in\mathbb{N}$ and let $E$ be a collection of $h$-subsets of $V$. Then $\mathscr G = (V,E)$ is an $h$-unifrom hypergraph and we refer to $V$ as its vertex set and to $E$ as its edge set. We say that $\mathscr G$ is complete and denote it by $K_n^h$ if every $h$-subset of $V$ is contained in $E$. If every edge in $E$ is repeated $\lambda$ times, we say $G$ is $\lambda$-fold. Specifically, $\lambda K_n^h$ is the complete $\lambda$-fold $n$-vertex $h$-uniform hypergraph with an edge set containing $\lambda$ copies of every …

The Conditional Strong Matching Preclusion Of Augmented Cubes, Mohamad Abdallah, Eddie Cheng

Theory & Applications of Graphs

The strong matching preclusion is a measure for the robustness of interconnection networks in the presence of node and/or link failures. However, in the case of random link and/or node failures, it is unlikely to find all the faults incident and/or adjacent to the same vertex. This motivates Park et al. to introduce the conditional strong matching preclusion of a graph. In this paper we consider the conditional strong matching preclusion problem of the augmented cube AQ_n, which is a variation of the hypercube Q_n that possesses favorable properties.

Characterizing 2-Trees Relative To Chordal And Series-Parallel Graphs, Terry A. Mckee

Theory & Applications of Graphs

The 2-connected 2-tree graphs are defined as being constructible from a single 3-cycle by recursively appending new degree-2 vertices so as to form 3-cycles that have unique edges in common with the existing graph. Such 2-trees can be characterized both as the edge-minimal chordal graphs and also as the edge-maximal series-parallel graphs. These are also precisely the 2-connected graphs that are simultaneously chordal and series-parallel, where these latter two better-known types of graphs have themselves been both characterized and applied in numerous ways that are unmotivated by their interaction with 2-trees and with each other.

Toward providing such motivation, the …

Innovative Approach To Solving Combinatic Elements And Some Problems Of Newton Binomy In School Mathematics Course, Nilufar Okbayeva

Central Asian Problems of Modern Science and Education

This article provides information on the elements of combinatorics in the school mathematics course and solutions to some problems related to the Newtonian binomial. This article is also aimed at solving problems related to the indepth study of the elements of combinatorics in the school course, the creation of a sufficient basis for the study of probability theory and mathematical statistics in the future.

On The Sigma Chromatic Number Of The Zero-Divisor Graphs Of The Ring Of Integers Modulo N, Agnes Garciano, Reginaldo M. Marcelo, Mari-Jo P. Ruiz, Mark Anthony C. Tolentino

Mathematics Faculty Publications

The zero-divisor graph of a commutative ring R with unity is the graph Γ(R) whose vertex set is the set of nonzero zero divisors of R; where two vertices are adjacent if and only if their product in R is zero. A vertex coloring c : V (G) → Bbb N of a non-trivial connected graph G is called a sigma coloring if σ(u) = σ(ν) for any pair of adjacent vertices u and v. Here; σ(χ) denotes the sum of the colors assigned to vertices adjacent to x. The sigma chromatic number of G; denoted by σ(G); is defined …

On The Sigma Value And Sigma Range Of The Join Of A Finite Number Of Even Cycles Of The Same Order, Marie Cris A. Bulay-Og, Agnes Garciano, Reginaldo M. Marcelo

Mathematics Faculty Publications

Let c be a vertex coloring of a simple; connected graph G that uses positive integers for colors. For a vertex v of G; the color sum of v is the sum of the colors of the neighbors of v. If no two adjacent vertices of G have the same color sum; then c is called a sigma coloring of G. The sigma chromatic number of G is the minimum number of colors required in a sigma coloring of G. Let max(c) be the largest color assigned to a vertex of G by a coloring c. The sigma value of …

The Set Chromatic Numbers Of The Middle Graph Of Graphs, Gerone Russel J. Eugenio, Mari-Jo P. Ruiz, Mark Anthony C. Tolentino

Mathematics Faculty Publications

For a simple connected graph G; let c : V (G) → N be a vertex coloring of G; where adjacent vertices may be colored the same. The neighborhood color set of a vertex v; denoted by NC(v); is the set of colors of the neighbors of v. The coloring c is called a set coloring provided that NC(u) neq NC(v) for every pair of adjacent vertices u and v of G. The minimum number of colors needed for a set coloring of G is referred to as the set chromatic number of G and is denoted by χ_s(G). In …

Quantum Symmetries In Noncommutative Geometry., Suvrajit Bhattacharjee Dr.

Doctoral Theses

No abstract provided.

On The Bounded Negativity Conjecture And Singular Plane Curves, Alexandru Dimca, Brian Harbourne, Gabriel Sticlaru

Department of Mathematics: Faculty Publications

There are no known failures of Bounded Negativity in characteristic 0. In the light of recent work showing the Bounded Negativity Conjecture fails in positive characteristics for rational surfaces, we propose new characteristic free conjectures as a replacement. We also develop bounds on numerical characteristics of curves constraining their negativity. For example, we show that the H-constant of a rational curve C with at most 9 singular points satisfies H(C) > -2 regardless of the characteristic.

Lions-Type Theorem Of The P-Laplacian And Applications, Yu Su, Zhaosheng Feng

School of Mathematical & Statistical Sciences Faculty Publications

In this article, our aim is to establish a generalized version of Lions-type theorem for the p-Laplacian. As an application of this theorem, we consider the existence of ground state solution for the quasilinear elliptic equation with the critical growth.

Skolem Number Of Subgraphs On The Triangular Lattice, Braxton Carrigan, Garrett Green

Communications on Number Theory and Combinatorial Theory

A Skolem sequence can be thought of as a labelled path where any two vertices with the same label are that distance apart. This concept has naturally been generalized to graph labelling. This brings rise to the question; “what is the smallest set of consecutive positive integers we can use to properly Skolem label a graph?” This is known as the Skolem number of the graph. In this paper we give the Skolem number for three natural vertex induced subgraphs of the triangular lattice graph.

Subsystems Of Transitive Subshifts With Linear Complexity, Andrew Dykstra, Nicholas Ormes, Ronnie Pavlov

Mathematics: Faculty Scholarship

We bound the number of distinct minimal subsystems of a given transitive subshift of linear complexity, continuing work of Ormes and Pavlov [On the complexity function for sequences which are not uniformly recurrent. Dynamical Systems and Random Processes (Contemporary Mathematics, 736). American Mathematical Society, Providence, RI, 2019, pp. 125--137]. We also bound the number of generic measures such a subshift can support based on its complexity function. Our measure-theoretic bounds generalize those of Boshernitzan [A unique ergodicity of minimal symbolic flows with linear block growth. J. Anal. Math.44(1) (1984), 77–96] and are closely related to those of Cyr and Kra …

Superoscillations And Analytic Extension In Schur Analysis, Daniel Alpay, Fabrizio Colombo, Irene Sabadini

Mathematics, Physics, and Computer Science Faculty Articles and Research

We give applications of the theory of superoscillations to various questions, namely extension of positive definite functions, interpolation of polynomials and also of Rfunctions; we also discuss possible applications to signal theory and prediction theory of stationary stochastic processes. In all cases, we give a constructive procedure, by way of a limiting process, to get the required results.

Connectivity Of Matroids And Polymatroids, Zachary R. Gershkoff

LSU Doctoral Dissertations

This dissertation is a collection of work on matroid and polymatroid connectivity. Connectivity is a useful property of matroids that allows a matroid to be decomposed naturally into its connected components, which are like blocks in a graph. The Cunningham-Edmonds tree decomposition further gives a way to decompose matroids into 3-connected minors. Much of the research below concerns alternate senses in which matroids and polymatroids can be connected. After a brief introduction to matroid theory in Chapter 1, the main results of this dissertation are given in Chapters 2 and 3. Tutte proved that, for an element e of a …

An Image Segmentation Technique With Statistical Strategies For Pesticide Efficacy Assessment, Steven B. Kim, Dong Sub Kim, Xiaoming Mo

Mathematics and Statistics Faculty Publications and Presentations

Image analysis is a useful technique to evaluate the efficacy of a treatment for weed control. In this study, we address two practical challenges in the image analysis. First, it is challenging to accurately quantify the efficacy of a treatment when an entire experimental unit is not affected by the treatment. Second, RGB codes, which can be used to identify weed growth in the image analysis, may not be stable due to various surrounding factors, human errors, and unknown reasons. To address the former challenge, the technique of image segmentation is considered. To address the latter challenge, the proportion of …

Modeling The Ecological Dynamics Of A Three-Species Fish Population In The Chesapeake Bay, Iordanka N. Panayotova, Maila B. Hallare

CODEE Journal

We present an inquiry-based project that is designed for a mathematical modeling class of undergraduate junior or senior students. It discusses a three-species mathematical model that simulates the biological interactions among three important fish species in the Chesapeake Bay: the prey Atlantic menhaden and its two competing predators, the striped bass and the non-native blue catfish. The model also considers the following ecological issues related to these three species: the overfishing of menhaden, the invasiveness of the blue catfish, and the harvesting of blue catfish as a method to control the population. A series of modeling scenarios are considered based …

Engaging Students Early By Internationalizing The Undergraduate Calculus Course, Chinenye Ofodile

CODEE Journal

Today's world is global. However, despite increasing numbers and diversity of participants in Study Abroad programs, only 10% of U. S. college students get that experience. There is an ever-growing need for students to become aware of and experience other cultures, to understand why others think and act differently. Internationalization is the conscious effort, begun nearly 40 years ago, to integrate an international, intercultural, and global dimension into the purpose, functions, and delivery of post-secondary education.

Albany State University began a Global Program Initiative in the 1990s. In 2016, we extended into mathematics the curriculum innovations of this program. The …

Qualitative Analysis Of A Resource Management Model And Its Application To The Past And Future Of Endangered Whale Populations, Glenn Ledder

CODEE Journal

Observed whale dynamics show drastic historical population declines, some of which have not been reversed in spite of restrictions on harvesting. This phenomenon is not explained by traditional predator prey models, but we can do better by using models that incorporate more sophisticated assumptions about consumer-resource interaction. To that end, we derive the Holling type 3 consumption rate model and use it in a one-variable differential equation obtained by treating the predator population in a predator-prey model as a parameter rather than a dynamic variable. The resulting model produces dynamics in which low and high consumption levels lead to single …

Epidemiology And The Sir Model: Historical Context To Modern Applications, Francesca Bernardi, Manuchehr Aminian

CODEE Journal

We suggest the use of historical documents and primary sources, as well as data and articles from recent events, to teach students about mathematical epidemiology. We propose a project suitable -- in different versions -- as part of a class syllabus, as an undergraduate research project, and as an extra credit assignment. Throughout this project, students explore mathematical, historical, and sociological aspects of the SIR model and approach data analysis and interpretation. Based on their work, students form opinions on public health decisions and related consequences. Feedback from students has been encouraging.

We begin our project by having students read …

Facing The Pandemic Together: Forming A Collaborative Research Group, Michael C. Barg

CODEE Journal

This is an account of how a reading and writing project in an introductory differential equations course was transitioned to a professor-student research group collaborative project, in response to the global COVID-19 pandemic. Adapting on the fly to the ever-evolving pandemic, we collected data, estimated parameters in our models, and computed numerical solutions to SIR-based systems of differential equations. This is a description of what we did and how we found comfort in the project in this time of great uncertainty. The collaboration yielded successes and more questions than we had answers for, but the situation provided an opportunity of …

Engaging Learners: Differential Equations In Today's World

CODEE Journal

Engaging Learners: Differential Equations in Today's World

CODEE Journal, Volume 14, Issue 1

Metrics For Performance Quantification Of Adaptive Mesh Refinement, Nicole Beisiegel, Cristóbal E. Castro, Jörn Behrens

Articles

Non-uniform, dynamically adaptive meshes are a useful tool for reducing computational complexities for geophysical simulations that exhibit strongly localised features such as is the case for tsunami, hurricane or typhoon prediction. Using the example of a shallow water solver, this study explores a set of metrics as a tool to distinguish the performance of numerical methods using adaptively refined versus uniform meshes independent of computational architecture or implementation. These metrics allow us to quantify how a numerical simulation benefits from the use of adaptive mesh refinement. The type of meshes we are focusing on are adaptive triangular meshes that are …

Representations Of Principal W-Algebra For The Superalgebra Q(N) And The Super Yangian Yq(1), Elena Poletaeva, Vera Serganova

School of Mathematical & Statistical Sciences Faculty Publications

We classify irreducible representations of finite W-algebra for the queer Lie superalgebra Q(n) associated with the principal nilpotent coadjoint orbits. We use this classification and our previous results to obtain a classification of irreducible finite-dimensional representations of the super Yangian YQ(1).

Using A Hybrid Agent-Based And Equation Based Model To Test School Closure Policies During A Measles Outbreak, Elizabeth Hunter, John D. Kelleher

Articles

Background

In order to be prepared for an infectious disease outbreak it is important to know what interventions will or will not have an impact on reducing the outbreak. While some interventions might have a greater effect in mitigating an outbreak, others might only have a minor effect but all interventions will have a cost in implementation. Estimating the effectiveness of an intervention can be done using computational modelling. In particular, comparing the results of model runs with an intervention in place to control runs where no interventions were used can help to determine what interventions will have the greatest …

Infinite-Order Differential Operators Acting On Entire Hyperholomorphic Functions, Daniel Alpay, Fabrizio Colombo, Stefano Pinton, Irene Sabadini, Daniele C. Struppa

Mathematics, Physics, and Computer Science Faculty Articles and Research

Infinite-order differential operators appear in different fields of mathematics and physics and in the past decade they turned out to be of fundamental importance in the study of the evolution of superoscillations as initial datum for Schrödinger equation. Inspired by the operators arising in quantum mechanics, in this paper, we investigate the continuity of a class of infinite-order differential operators acting on spaces of entire hyperholomorphic functions. We will consider two classes of hyperholomorphic functions, both being natural extensions of holomorphic functions of one complex variable. We show that, even though these two notions of hyperholomorphic functions are quite different …

Analytical And Numerical Convexity Results For Discrete Fractional Sequential Differences With Negative Lower Bound, Christopher S. Goodrich, Benjamin Lyons, Andrea Scapellato, Mihaela T. Velcsov

Mathematics Faculty Publications

We investigate relationships between the sign of the discrete fractional sequential difference (Δ^v _1+a-μ Δ^μ_af)(t) and the convexity of the function t→f(t). In particular, we consider the case in which the bound (Δ^v _1+a-μ Δ^μ_af)(t) ≥εf(a), for some ε > 0 and where f(a) < 0 is satisfied. Thus, we allow for the case in which the sequential difference may be negative, and we show that even though the fractional difference can be negative, the convexity of the function f can be implied by the above inequality nonetheless. This demonstrates a significant dissimilarity between the fractional and non-fractional cases. We use a combination of both hard analysis and numerical simulation.