Other Mathematics Commons^™

Uncertain Labeling Graphs And Uncertain Graph Classes (With Survey For Various Uncertain Sets), Takaaki Fujita, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

Graph theory, a branch of mathematics, studies the relationships between entities using vertices and edges. Uncertain Graph Theory has emerged within this field to model the uncertainties present in real-world networks. Graph labeling involves assigning labels, typically integers, to the vertices or edges of a graph according to specific rules or constraints. This paper introduces the concept of the Turiyam Neutrosophic Labeling Graph, which extends the traditional graph framework by incorporating four membership values—truth, indeterminacy, falsity, and a liberal state—at each vertex and edge. This approach enables a more nuanced representation of complex relationships. Additionally, we discuss the Single-Valued Pentapartitioned …

Significado Neutrosófico: Partes Comunes De Cosas Poco Comunes Y Partes Poco Comunes De Cosas Comunes, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

Esta investigación explora la Neutrosofía, un enfoque filosófico que se centra en la identificación de elementos comunes entre conceptos opuestos y en el análisis de las diferencias entre conceptos semejantes. En este contexto, se estudian las Partes Comunes a Cosas No Comunes, que se manifiestan cuando elementos como y < antiA > comparten aspectos en su intersección, y las Partes No Comunes a Cosas Comunes, donde conceptos iguales como y difieren al exhibir elementos únicos. Este análisis permite comprender mejor la neutralidad e indeterminación representada por < neutA > y < neutB >, situados entre sus respectivos opuestos. La investigación abarca diversas áreas como la Dialéctica, el Yin …

Some Graph Parameters For Superhypertree-Width And Neutrosophictree-Width, Takaaki Fujita, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

Graph characteristics are often studied through various parameters, with ongoing research dedicated to exploring these aspects. Among these, graph width parameters—such as treewidth—are particularly important due to their practical applications in algorithms and real-world problems. A hypergraph generalizes traditional graph theory by abstracting and extending its concepts [77]. More recently, the concept of a SuperHyperGraph has been introduced as a further generalization of the hypergraph. Neutrosophic logic [133], a mathematical framework, extends classical and fuzzy logic by allowing the simultaneous consideration of truth, indeterminacy, and falsity within an interval. In this paper, we explore Superhypertree-width, Neutrosophic treewidth, and t-Neutrosophic tree-width.

A Bridge Too Low: Solutions For Fermi Questions, May 2025, John Adam

Mathematics & Statistics Faculty Publications

The article discusses a low bridge in Keswick, England, near the River Greta, with an arch shaped like a semiellipse. It presents Fermi questions related to the bridge's dimensions, such as the maximum distance a person of a certain height can walk under it without hitting their head. The solutions involve mathematical calculations and approximations, including the use of formulas provided by the Indian mathematician Srinivasa Ramanujan.

A Question Of Transparency: Solutions For Fermi Questions, March 2025, John Adam

Mathematics & Statistics Faculty Publications

Question 1: Why is it easier to see through rain than fog?

Start thinking about this by imagining a fixed volume (V) of water being dispersed into, say, N identical droplets of diameter d. Surface area and volume considerations should lead to the answer in terms of V and d.

Solution to Question 1: N = VI(πd³/6) = 6V/πd³ ≈ 2V/d³.

The cross-sectional area A of each drop is πd²/4 ≈ 3d²/4, so the total area blocked off (assuming no overlapping drops—so this is an upper bound) is NA ≈ 1.5V/d, so the area blocked off is inversely proportional to …

Solvability Of Stochastic Linear-Quadratic Optimal Control Problems Under Partial Stabilizability Conditions, Al-Sadh Rahman Imadh

Honors Undergraduate Theses

Optimal Control Theory, a branch of Control Theory, is applicable in fields such as engineering, operations research, and economics. Stochastic Optimal Control deals with noisy systems and data using Ito’s formulation. Given a noisy system and a cost functional, the goal is to find a control that will minimize the cost. This thesis focuses on linear quadratic stochastic optimal control, and we explore state equations that are not stabilizable. We first address measurability concerns arising from the semigroup property of the state trajectory. The notions of partial stability and partial stabilizability are introduced, and we formulate their corresponding Lyapunov and …

Integrating Sentiment Analysis In Predictive Models: A Comparative Study On Game Popularity On Steam, Khaleefa Alhemeiri

CMC Senior Theses

Over the past decades, the gaming industry has managed to evolve into a multi-billion-dollar enterprise. Gaming platforms such as Steam foster unprecedented amounts of engagement among players worldwide daily. In this thesis, we investigate the effect of incorporating sentiment-driven metrics, specifically YouTube view counts and positive reviews, into predictive models for game popularity. In addition, by comparing our linear regression sentiment-based approach to the Bayesian hierarchical folded normal model used by De Luisa et al. (2021), we can understand the many differences, strengths, and limitations of each methodology. In our thesis, we focus on three games. Each is of varying …

Bytes, Banter, And The Bible: An Interdisciplinary Account Of Objective Meaning, Cameron Bonin

Senior Honors Theses

The claim that the Bible has objective meaning is contested in a postmodern world. This claim can be more persuasively defended when it is addressed by insights from multiple disciplines. In particular, the field of computer science is apt to illuminate the concept of meaning through its reflection on the nature of languages and its concern with the accurate transmission of information. By synthesizing insights from the field of computer science, such as that of Claude Shannon, with Nicholas Wolterstorff’s use of speech-act theory, the concept of meaning can be understood more clearly. Consequently, this synthesis assists in answering questions …

Fourier Transformation Of Non-Periodic Functions And Its Application In Computed Tomography, Sabrina Hossain

UNF Graduate Theses and Dissertations

Fourier analysis plays an important role in signal processing and imaging applications,

with computed tomography (CT) being a prominent example. CT imaging relies on recon-

structing cross-sectional images of objects from multiple projections, a process deeply rooted

in the mathematical framework of the Fourier series and its extensions. This thesis explores

the mathematical principle behind CT, demonstrating how periodic and non-periodic func-

tions can be decomposed into sinusoidal components to facilitate image reconstruction. We

begin by reviewing the Fourier series and its ability to represent periodic signals, and then

extend this concept to non-periodic functions through Fourier transforms. The connection …

Geometric Properties Of Positive Definite Matrices: Means, Order, And Metrics, Blaine Dubois

UNF Graduate Theses and Dissertations

In this thesis, we study matrix means from a geometric point of view. In particular, we consider divergences of the form Tr[A + B − 2G(A, B)] for certain Geometric-Type matrix means G(A, B). We derive alternative formulations of this distance function through the application of one-sided inverses of G(A, B). When G(A, B) = A#B, we give a curve parametrization of the straight-line path between two points with respect to this semi-metric and present conditions under which this holds for other Geometric-Type means. For read- ability and self-containment, we introduce most of the preliminary concepts to build up to …

Lipschitz Conditions On Operators And Matrices, Ryan Farrell

UNF Graduate Theses and Dissertations

Lipschitz functions on the real line find various applications across mathematics, including in differential equations, optimization, and machine learning. The goal of this thesis is to investigate functions which satisfy certain Lipschitz conditions when ap- plied to operators and matrices. Our study will review two classes of such functions, the class of Operator Lipschitz functions with respect to a given matrix norm, and the class consisting of functions which do not meet Lipschitz conditions in the traditional sense but satisfy inequalities which are Lipschitz in nature – we call such conditions ”Lipschitz-like”. The thesis concludes with a survey of these …

Calculation And Statistical Analysis Of Wins Above Replacement, Joshua Taylor

Departmental Honors & Graduate Capstone Projects

The Wins Above Replacement (WAR) statistic in Major League Baseball is a prominent metric used to estimate player value by quantifying all aspects of play in terms of wins added to a baseball team. We will use R to calculate WAR for all players from 1871 to 2012 and use data from those years to construct multivariate predictive models to attempt to estimate WAR for players from 2013 to 2024. We find strong correlations between predicted and actual WAR values for most models, with the exception of the polynomial predictive model for non-qualified pitchers.

Vieta’S Formula, The Fabius Function And The Partition Function, Ahmed Sebbar

Mathematics, Physics, and Computer Science Faculty Articles and Research

We use an idea of Pólya and Szegö to give a common basis to Vieta’s formula, Fabius function and the partition function. Moreover our construction leads also to a function considered by Hallström, Bowen and Macintyre, which has, as a particular value, the Kepler-Bouwkamp constant, and to a function considered by Zondadari, that vanishes only at prime numbers.

Mathematics In Amusement Parks, Kacey Laumann

Honors Projects

This project focuses specifically on the Walt Disney World Park, Magic Kingdom. I started by collecting data through the MyDisneyExperience app. By recording the data, I was then able to create polynomial functions to the fifth the degree. Each attraction received a function which allowed me to predict the wait times for that attraction. Then, by graphing the functions and analyzing the graph using calculus the “best time” and “worst time” to go to the attraction were found. After the analysis the information is used to build a unique schedule for a guest. Then the guest receives this schedule after …

Applications Of Neural Networks In Parkinson’S Disease Diagnosis, Saladin Minhaaj

Theses

Parkinson's disease (PD) is a complex and debilitating neurodegenerative disorder that affects millions of people worldwide. Early and accurate diagnosis is crucial for effective treatment and management of PD. This thesis explores the application of neural networks in PD diagnosis, leveraging their ability to learn patterns from large datasets and make accurate predictions.

Thesis provides an overview of PD, including its symptoms, diagnosis, and current challenges in diagnosis. We then delve into the fundamentals of neural networks, including supervised learning, mathematical interpretations, and parametric models. This research focuses on the development of neural network models that can accurately diagnose PD …

Bounding The Convex Hull Relaxation Of The Unit Commitment Problem With The Shapley-Folkman Theorem, Lauren Henderson

All Theses

The Unit Commitment (UC) problem finds an optimal schedule for a set of generators by minimizing the total operation cost subject to demand and operational constraints. The UC problem is often modeled with a mixed-integer linear program (MILP). We employ the Shapley-Folkman Theorem to provide a bound on the size of fractional solutions of its convex hull relaxation. This result is used to obtain a bound on the optimality gap between the MILP and the convex hull relaxation, which is further tightened using several problem-specific properties of UC. We conduct extensive numerical experiments to study the tightness of this threshold, …

Pricing Variance Swaps For The Discrete Bn-S Model, Semere Gebresilasie

Journal of Stochastic Analysis

No abstract provided.

Uniqueness Of Maximum Points Of A Sequence Of Functions Arising From An Adapted Algorithm For ‘The Secretary Problem’, Boning Wang, Giang Vu Thanh Nguyen

OUR Journal: ODU Undergraduate Research Journal

This paper is aimed at a sequence of functions that is extended from an adaptive algorithm of the classical ‘secretary problem’. It was proved in Nguyen et al. (2024) the uniqueness of maximizers of a function sequence that represents the expected score of an element in a ‘candidate’ sequence. This function sequence is indeed considered as a special case of an extended function sequence that corresponds to the case α = 0. More specifically, we are motivated to prove the uniqueness of maximizers for this extended function sequence in the case α = 1. Nevertheless, the corresponding proof is rather …

Decision-Making In Diagnosing Heart Failure Problems Using Dual Hesitant Fuzzy Sets, Manar Mohamed Omran, Reham Abdel-Aziz Abo-Khadra

Journal of Engineering Research

In recent decades, several types of sets, such as fuzzy sets, interval-valued fuzzy sets, intuitionistic fuzzy sets, interval-valued intuitionistic fuzzy sets, type 2 fuzzy sets, type n fuzzy sets, and hesitant fuzzy sets, have been introduced and investigated widely. In this paper, we propose dual hesitant fuzzy sets (DHFSs), which encompass fuzzy sets, intuitionistic fuzzy sets, hesitant fuzzy sets, and fuzzy multi-sets as special cases. Then we investigate the basic operations and properties of DHFSs. We also discuss the relationships among the sets mentioned above, and then propose an extension principle of DHFSs. Additionally, we give an example to illustrate …

(Si13-07) Optimal Range For Value Of Two-Person Zero-Sum Game Models With Uncertain Payoffs, Sana Afreen, Ajay Kumar Bhurjee

Applications and Applied Mathematics: An International Journal (AAM)

Game theory deals with the decision-making of individuals in conflicting situations with known payoffs. However, these payoffs are imprecisely known, which means they have uncertainty due to vagueness in the data set of most real-world problems. Therefore, we consider a two-person zero-sum game model on a larger scale where the payoffs are imprecise and lie within a closed interval. We define the pure and mixed strategy as well as value for the game models. The proposed method computes the optimal range for the value of the game model using interval analysis. To derive some important results, we establish some lemmas …