Mathematics Commons^™

Foundation Of Appurtenance And Inclusion Equations For Constructing The Operations Of Neutrosophic Numbers Needed In Neutrosophic Statistics Foundation Of Appurtenance And Inclusion Equations For Constructing The Operations Of Neutrosophic Numbers Needed In Neutrosophic Statistics, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

We introduce for the first time the appurtenance equation and inclusion equation, which help in understanding the operations with neutrosophic numbers within the frame of neutrosophic statistics. The way of solving them resembles the equations whose coefficients are sets (not single numbers).

Numerical Solution Of Hybrid Nanofluid And Its Stability Over Permeable Wedge Sheet With Heat Transfer Analysis, Aisha M. Alqahtani, Zeeshan, Waris Khan, Florentin Smarandache, Nidhal Becheikh, Roobaea Alroobaea, Taseer Muhammad

Branch Mathematics and Statistics Faculty and Staff Publications

The inclusion of nanoparticles has the potential to improve the thermal efficiency of the base fluid. The field of nanofluid (NF) dynamics has attracted important attention due to its extensive range of practical uses like fuel cells, solar energy, medication administration, heat transfer, microfabrication, coolant applications, and other related domains. The aim of this study is to scrutinize the impact of Lorentz force, thermal energy, joule heating, heat source and injection parameters, and Brownian and thermoporetic diffusions on the hybrid nanofluid over the moving wedge. The stability inquiry is reported for the existing work in order to confirm the stable …

A Review Of The Hierarchy Of Plithogenic, Neutrosophic, And Fuzzy Graphs: Survey And Applications, Takaaki Fujita, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

As many readers may know, graph theory is a fundamental branch of mathematics that examines networks consisting of nodes and edges, with a focus on their paths, structures, and properties [157]. A Fuzzy Graph extends this concept by assigning a membership degree between 0 and 1 to each edge and vertex, capturing the level of uncertainty. Expanding on this idea, the Turiyam Neutrosophic Graph was introduced as an extension of both Neutrosophic and Fuzzy Graphs. Plithogenic graphs, in turn, offer a powerful approach for managing uncertainty. In this paper, we explore the relationships among various graph classes, including Plithogenic graphs, …

Note On The Spectra Of Steiner Distance Hypermatrices, Joshua Cooper, Zhibin Du

Faculty Publications

The Steiner distance of a set of vertices in a graph is the fewest number of edges in any connected subgraph containing those vertices. The order-k Steiner distance hypermatrix of a graph is the n-dimensional array indexed by vertices, whose entries are the Steiner distances of their corresponding indices. In the case of k = 2, this reduces to the classical distance matrix of a graph. Graham and Pollak showed in 1971 that the determinant of the distance matrix of a tree only depends on its number n of vertices. Here, we show that the hyperdeterminant of the Steiner distance …

Extremal Graphs For Widom–Rowlinson Colorings In K-Chromatic Graphs, John Engbers, Aysel Erey

Mathematical and Statistical Science Faculty Research and Publications

The Widom–Rowlinson graph, H_WR , is the fully looped path on three vertices. Let hom(G,H_WR) be the number of graph homomorphisms from G to H_WR or, equivalently, the number of H_WR-colorings of G. We investigate extremal graphs for hom(G,H_WR) for G in the family of k-chromatic graphs subject to various connectivity requirements. In particular, we determine the graphs G maximizing hom(G,H_WR) in the families of n-vertex k-chromatic graphs, n-vertex connected k-chromatic graphs, n-vertex k-chromatic graphs with c components, n …

Boundaries Of Overlapping Isosceles Triangles, Kirati Sriamorn

Chulalongkorn University Theses and Dissertations (Chula ETD)

No abstract provided.

The Direct And Inverse Scattering Problems For The Third-Order Operator, Ivan Toledo

Mathematics Dissertations - Archive

We consider the full-line direct and inverse scattering problems for the third-order ordinary differential equation containing two potentials decaying sufficiently fast at infinity. The direct scattering problem consists of the determination of the scattering data set when the two potentials are known. The scattering data set is made up of the corresponding scattering coefficients and the bound-state information. On the other hand, the inverse scattering problem involves the recovery of the two potentials when the scattering data set is available. We formulate the inverse scattering problem via a related Riemann--Hilbert problem on the complex plane. We describe the recovery of …

Bicategorical Character Theory, Travis Wheeler

Theses and Dissertations--Mathematics

In 2007, Nora Ganter and Mikhail Kapranov defined the categorical trace, which they used to define the categorical character of a 2-representation. In 2008, Kate Ponto defined a shadow functor for bicategories. With the shadow functor, Dr. Ponto defined the bicategorical trace, which is a generalization of the symmetric monoidal trace for bicategories. How are these two notions of trace related to one another? We’ve used bicategorical traces to define a character theory for 2-representations, and the categorical character is an example.

Properties Of Skew-Polynomial Rings And Skew-Cyclic Codes, Kathryn Hechtel

Theses and Dissertations--Mathematics

A skew-polynomial ring is a polynomial ring over a field, with one indeterminate x, where one must apply an automorphism to commute coefficients with x. It was first introduced by Ore in 1933 and since the 1980s has been used to study skew-cyclic codes. In this thesis, we present some properties of skew-polynomial rings and some new constructions of skew-cyclic codes. The dimension of a skew-cyclic code depends on the degree of its generating skew polynomial. However, due to the skew-multiplication rule, the degree of a skew polynomial can be smaller than its number of roots and hence tricky to …

Adams Operations On The Burnside Ring From Power Operations, Lewis Dominguez

Theses and Dissertations--Mathematics

Topology furnishes us with many commutative rings associated to finite groups. These include the complex representation ring, the Burnside ring, and the G-equivariant K-theory of a space. Often, these admit additional structure in the form of natural operations on the ring, such as power operations, symmetric powers, and Adams operations. We will discuss two ways of constructing Adams operations. The goal of this work is to understand these in the case of the Burnside ring.

Pairs Of Quadratic Forms Over P-Adic Fields, John Hall

Theses and Dissertations--Mathematics

Given two quadratic forms $Q_1, Q_2$ over a $p$-adic field $K$ in $n$ variables, we consider the pencil $\mathcal{P}_K(Q_1, Q_2)$, which contains all nontrivial $K$-linear combinations of $Q_1$ and $Q_2$. We define $D$ to be the maximal dimension of a subspace in $K^n$ on which $Q_1$ and $Q_2$ both vanish. We define $H$ to be the maximal number of hyperbolic planes that a form in $\mathcal{P}_K(Q_1, Q_2)$ splits off over $K$. We will determine which values for $(D, H)$ are possible for a nonsingular pair of quadratic forms over a $p$-adic field $K$.

Dirichlet Problems In Perforated Domains, Robert Righi

Theses and Dissertations--Mathematics

We establish W^1,p estimates for solutions u_ε to the Laplace equation with Dirichlet boundary conditions in a bounded C¹ domain Ω_{ε, η} perforated by small holes in ℝ^d. The bounding constants will depend explicitly on epsilon and eta, where epsilon is the order of the minimal distance between holes, and eta denotes the ratio between the size of the holes and epsilon. The proof relies on a large-scale L^p estimate for ∇u_ε, whose proof is divided into two main parts. First, we show that solutions of an intermediate problem for a …

Slₖ-Tilings And Paths In ℤᵏ, Zachery T. Peterson

Theses and Dissertations--Mathematics

An SLₖ-frieze is a bi-infinite array of integers where adjacent entries satisfy a certain diamond rule. SL₂-friezes were introduced and studied by Conway and Coxeter. Later, these were generalized to infinite matrix-like structures called tilings as well as higher values of k. A recent paper by Short showed a bijection between bi-infinite paths of reduced rationals in the Farey graph and SL₂-tilings. We extend this result to higher k by constructing a bijection between SLₖ-tilings and certain pairs of bi-infinite strips of vectors in ℤᵏ called paths. The key ingredient in the proof is the relation to Plucker friezes and …

A Multiple-Case Study On The Impact Of An Introductory Real Analysis Course On Undergraduate Students' Understanding Of Function Continuity, Ryan Joseph Rogers

Theses and Dissertations--Mathematics

Undergraduate students' understanding of function continuity has not been explored broadly in previous research. The relevant findings in the literature are predominantly concerned with calculus students' understanding and misconceptions of continuity. Many of these misunderstandings are tied to the relationships which continuity has with limits and differentiability. This multiple-case study explores how, if at all, an introductory real analysis course impacts undergraduate students' understanding of function continuity and its connections to the notions of limits and differentiability. We embed our findings within the theoretical framework of Tall's three worlds of mathematics, namely, the embodied, symbolic, and formal worlds.

The cases …

Advanced Mathematical Graph-Based Machine Learning And Deep Learning Models For Drug Design, Farjana Tasnim Mukta

Theses and Dissertations--Mathematics

Drug discovery is a highly complicated and time-consuming process. One of the main challenges in drug development is predicting whether a drug-like molecule will interact with a specific target protein. This prediction accelerates target validation and drug development. Recent research in biomolecular sciences has shown significant interest in algebraic graph-based models for representing molecular complexes and predicting drug-target binding affinity. In this thesis, we present algebraic graph-based molecular representations to create data-driven scoring functions (SF) using extended atom types to capture wide-range interactions between targets and drug candidates. Our model employs multiscale weighted colored subgraphs for the protein-ligand complex, colored …

Centers Of N-Degree Poncelet Circles, Georgia Corbett

Honors Theses

Given a circle inscribed in a polygon inscribed in the unit circle, if one connects all the vertices with line segments we get a family of circles called a package of Poncelet circles, due to its connection to a theorem of Poncelet. We are interested in where the centers of the Poncelet circles can be. Specifically, we have shown that if one of the circles in the Poncelet package is centered at 0, then all of the circles must be centered at 0 as well. This was proven by Spitkovsky and Wegert in 2021 using elliptic integrals but we …

Applications And Analysis Of Nlp Deep Learning Models For Antibiotic's Side Effects Classifications, An Ly

CGU Theses & Dissertations

I introduce a novel recursive modification to the classical Goemans-Williamson MaxCut algorithm, offering improved performance in vectorized data clustering tasks. Focusing on the clustering of medical publications, I suggest to employ recursive iterations in conjunction with a dimension relaxation method to enhance density of clustering results. Furthermore, I propose a new vectorization technique for articles, leveraging conditional probabilities for more effective clustering. I believe that these methods will provide advantages in both computational efficiency and clustering accuracy. I will analyze the effectiveness of recursive iterations and higher-dimensional generalizations of the GWA in the hopes of achieving more accurate dissimilarity-based clustering. …

Berglund–Hübsch Transpose Rule And Sasakian Geometry, Ralph R. Gomez

Mathematics & Statistics Faculty Works

We apply the Berglund–Hübsch transpose rule from BHK mirror symmetry to show that to an n−1-dimensional Calabi–Yau orbifold in weighted projective space defined by an invertible polynomial, we can associate four (possibly) distinct Sasaki manifolds of dimension 2n+1 which are n−1-connected and admit a metric of positive Ricci curvature. We apply this theorem to show that for a given K3 orbifold, there exist four seven-dimensional Sasakian manifolds of positive Ricci curvature, two of which are actually Sasaki–Einstein.

The Computational Search For Unidentified Central Configurations Of The Newtonian N-Body Problem, Hannah G. Havel

CURE Proceedings

The N-body problem is a field of study in mathematics and physics that involves predicting the motion of particles moving under their mutual gravitational attraction. It is vital in celestial mechanics, such as planning collision-free satellite orbit trajectories. When beginning to understand the N-body problem, we can start by looking at equal masses of these particles or celestial bodies. As particles move, their position and velocity change, both energy and angular momentum are conserved. Sets of constant energy and angular momentum, known as integral manifolds, are higher-dimensional figures that represent constraints of movement to a system. Integral manifolds are described …

Echolocation On Manifolds, Kerong Wang

Honors Theses

We consider the question asked by Wyman and Xi [WX23]: ``Can you hear your location on a manifold?” In other words, can you locate a unique point x on a manifold, up to symmetry, if you know the Laplacian eigenvalues and eigenfunctions of the manifold? In [WX23], Wyman and Xi showed that echolocation holds on one- and two-dimensional rectangles with Dirichlet boundary conditions using the pointwise Weyl counting function. They also showed echolocation holds on ellipsoids using Gaussian curvature.

In this thesis, we provide full details for Wyman and Xi's proof for one- and two-dimensional rectangles and we show that …