Mathematics Commons^™

One Dimensional Complex Ornstein-Uhlenbeck Operator, Yong Chen

Communications on Stochastic Analysis

No abstract provided.

Gaussian Guesswork: Infinite Sequences And The Arithmetic-Geometric Mean, Janet Heine Barnett

Calculus

No abstract provided.

Neutrosophic N -Structures And Their Applications In Semigroups, Florentin Smarandache, Madad Khan, Saima Anis, Young Bae Jun

Branch Mathematics and Statistics Faculty and Staff Publications

The notion of neutrosophic N -structure is introduced, and applied it to semigroup. The notions of neutrosophic N -subsemigroup, neutrosophic N -product and ε-neutrosophic N -subsemigroup are introduced, and several properties are investigated. Conditions for neutrosophic N -structure to be neutrosophic N -subsemigroup are provided. Using neutrosophic N -product, characterization of neutrosophic N -subsemigroup is discussed. Relations between neutrosophic N -subsemigroup and εneutrosophic N -subsemigroup are discussed. We show that the homomorphic preimage of neutrosophic N -subsemigroup is a neutrosophic N - subsemigroup, and the onto homomorphic image of neutrosophic N - subsemigroup is a neutrosophic N -subsemigroup.

Neutrosophic Commutative N-Ideals In Bck-Algebras, Florentin Smarandache, Seok-Zun Song, Young Bae Jun

Branch Mathematics and Statistics Faculty and Staff Publications

The notion of a neutrosophic commutative N -ideal in BCK-algebras is introduced, and several properties are investigated. Relations between a neutrosophic N -ideal and a neutrosophic commutative N -ideal are discussed. Characterizations of a neutrosophic commutative N -ideal are considered.

Neutrosophic N -Structures Applied To Bck/Bci-Algebras, Florentin Smarandache, Young Bae Jun, Hashem Bordbar

Branch Mathematics and Statistics Faculty and Staff Publications

Neutrosophic N -structures with applications in BCK/BC I-algebras is discussed. The notions of a neutrosophic N -subalgebra and a (closed) neutrosophic N -ideal in a BCK/BC I-algebra are introduced, and several related properties are investigated. Characterizations of a neutrosophic N -subalgebra and a neutrosophic N -ideal are considered, and relations between a neutrosophic N -subalgebra and a neutrosophic N -ideal are stated. Conditions for a neutrosophic N -ideal to be a closed neutrosophic N -ideal are provided.

Evolution Of Superoscillations For Schrödinger Equation In A Uniform Magnetic Field, Fabrizio Colombo, Jonathan Gantner, Daniele C. Struppa

Mathematics, Physics, and Computer Science Faculty Articles and Research

Aharonov-Berry superoscillations are band-limited functions that oscillate faster than their fastest Fourier component. Superoscillations appear in several fields of science and technology, such as Aharonov’s weak measurement in quantum mechanics, in optics, and in signal processing. An important issue is the study of the evolution of superoscillations using the Schrödinger equation when the initial datum is a weak value. Some superoscillatory functions are not square integrable, but they are real analytic functions that can be extended to entire holomorphic functions. This fact leads to the study of the continuity of a class of convolution operators acting on suitable spaces of …

Ar(1) Sequence With Random Coefficients:Regenerative Properties And Its Application, Krishna B. Athreya, Koushik Saha, Radhendushka Srivastava

Communications on Stochastic Analysis

No abstract provided.

An Efficient Image Segmentation Algorithm Using Neutrosophic Graph Cut, Florentin Smarandache, Yanhui Guo, Yaman Akbulut, Abdulkadir Sengur, Rong Xia

Branch Mathematics and Statistics Faculty and Staff Publications

Segmentation is considered as an important step in image processing and computer vision applications, which divides an input image into various non-overlapping homogenous regions and helps to interpret the image more conveniently. This paper presents an efficient image segmentation algorithm using neutrosophic graph cut (NGC). An image is presented in neutrosophic set, and an indeterminacy filter is constructed using the indeterminacy value of the input image, which is defined by combining the spatial information and intensity information. The indeterminacy filter reduces the indeterminacy of the spatial and intensity information. A graph is defined on the image and the weight for …

Ns-K-Nn: Neutrosophic Set-Based K-Nearest Neighbors Classifier, Florentin Smarandache, Yaman Akbulut, Abdulkadir Sengur, Yanhui Guo

Branch Mathematics and Statistics Faculty and Staff Publications

k-nearest neighbors (k-NN), which is known to be a simple and efficient approach, is a non-parametric supervised classifier. It aims to determine the class label of an unknown sample by its k-nearest neighbors that are stored in a training set. The k-nearest neighbors are determined based on some distance functions. Although k-NN produces successful results, there have been some extensions for improving its precision. The neutrosophic set (NS) defines three memberships namely T, I and F. T, I, and F shows the truth membership degree, the false membership degree, and the indeterminacy membership degree, respectively. In this paper, the NS …

Efficiently Representing The Integer Factorization Problem Using Binary Decision Diagrams, David Skidmore

All Graduate Plan B and other Reports, Spring 1920 to Spring 2023

Let p be a prime positive integer and let α be a positive integer greater than 1. A method is given to reduce the problem of finding a nontrivial factorization of α to the problem of finding a solution to a system of modulo p polynomial congruences where each variable in the system is constrained to the set {0,...,p − 1}. In the case that p = 2 it is shown that each polynomial in the system can be represented by an ordered binary decision diagram with size less than 20.25log₂(α)³ + 16.5log₂(α)² + …

Vertex Weighted Spectral Clustering, Mohammad Masum

Electronic Theses and Dissertations

Spectral clustering is often used to partition a data set into a specified number of clusters. Both the unweighted and the vertex-weighted approaches use eigenvectors of the Laplacian matrix of a graph. Our focus is on using vertex-weighted methods to refine clustering of observations. An eigenvector corresponding with the second smallest eigenvalue of the Laplacian matrix of a graph is called a Fiedler vector. Coefficients of a Fiedler vector are used to partition vertices of a given graph into two clusters. A vertex of a graph is classified as unassociated if the Fiedler coefficient of the vertex is close to …

Cayley Graphs Of Groups And Their Applications, Anna Tripi

Graduate Theses/Dissertations

Cayley graphs are graphs associated to a group and a set of generators for that group (there is also an associated directed graph). The purpose of this study was to examine multiple examples of Cayley graphs through group theory, graph theory, and applications. We gave background material on groups and graphs and gave numerous examples of Cayley graphs and digraphs. This helped investigate the conjecture that the Cayley graph of any group (except Z_2) is hamiltonian. We found the conjecture to still be open. We found Cayley graphs and hamiltonian cycles could be applied to campanology (in particular, to the …

Constructing A Square An Ancient Indian Way Activity, Cynthia J. Huffman Ph.D.

Open Educational Resources - Math

In this activity students use string to model one of the ways that was used in ancient India for constructing a square. The construction was used in building a temporary fire altar. The activity is based on a translation by Sen and Bag of the Baudhāyana-śulba-sūtra.

Constructing A Square Indian Fire Altar Activity, Cynthia J. Huffman Ph.D.

Open Educational Resources - Math

In this activity, we will model constructing a square fire altar with a method similar to one used by people in ancient India. The fire altars, which were made of bricks, had various shapes. Instructions for building the altars were in Vedic texts called Śulba-sūtras. We will follow instructions for constructing a square gārhapatya fire altar from the Baudhāyana-śulba-sūtra, which was written during the Middle Vedic period, about 800-500 BC.

Extending Difference Of Votes Rules On Three Voting Models., Sarah Schulz King

Electronic Theses and Dissertations

In a voting situation where there are only two competing alternatives, simple majority rule outputs the alternatives with the most votes or declares a tie if both alternatives receive the same number of votes. For any non-negative integer k, the difference of votes rule M_k outputs the alternative that beats the competing alternative by more than k votes. Llamazares (2006) gives a characterization of the difference of votes rules in terms of five axioms. In this thesis, we extend Llamazares' result by completely describing the class of voting rules that satisfy only two out of his five axioms. …

Residuated Maps, The Way-Below Relation, And Contractions On Probabilistic Metric Spaces., M. Ryan Luke

Electronic Theses and Dissertations

In this dissertation, we will examine residuated mappings on a function lattice and how they behave with respect to the way-below relation. In particular, which residuated $\phi$ has the property that $F$ is way-below $\phi(F)$ for $F$ in appropriate sets. We show the way-below relation describes the separation of two functions and how this corresponds to contraction mappings on probabilistic metric spaces. A new definition for contractions is considered using the way-below relation.

Π-Operators In Clifford Analysis And Its Applications, Wanqing Cheng

Graduate Theses and Dissertations

In this dissertation, we studies Π-operators in different spaces using Clifford algebras. This approach generalizes the Π-operator theory on the complex plane to higher dimensional spaces. It also allows us to investigate the existence of the solutions to Beltrami equations in different spaces.

Motivated by the form of the Π-operator on the complex plane, we first construct a Π-operator on a general Clifford-Hilbert module. It is shown that this operator is an L^2 isometry. Further, this can also be used for solving certain Beltrami equations when the Hilbert space is the L^2 space of a measure space. This idea is …

Disciple, Jessica K. Sklar

Journal of Humanistic Mathematics

This is a love poem for mathematics.

Discrete And Continuous: A Fundamental Dichotomy In Mathematics, James Franklin

Journal of Humanistic Mathematics

The distinction between the discrete and the continuous lies at the heart of mathematics. Discrete mathematics (arithmetic, algebra, combinatorics, graph theory, cryptography, logic) has a set of concepts, techniques, and application areas largely distinct from continuous mathematics (traditional geometry, calculus, most of functional analysis, differential equations, topology). The interaction between the two – for example in computer models of continuous systems such as fluid flow – is a central issue in the applicable mathematics of the last hundred years. This article explains the distinction and why it has proved to be one of the great organizing themes of mathematics.

Some Thoughts On The Epicurean Critique Of Mathematics, Michael Aristidou

Journal of Humanistic Mathematics

In this paper, we give a comprehensive summary of the discussion on the Epicurean critique of mathematics and in particular of Euclid's geometry. We examine the methodological critique of the Epicureans on mathematics and we assess whether a 'mathematical atomism' was proposed, and its implications. Finally, we examine the Epicurean philosophical stance on mathematics and evaluate whether it was on target or not.

Quantitative Literacy In The Affective Domain: Computational Geology Students’ Reactions To Devlin’S The Math Instinct, Victor J. Ricchezza, H. L. Vacher

Numeracy

Building on suggestions from alumni from a recent interview project, students in Computational Geology at the University of South Florida were tasked with reading a popular non-fiction book on mathematics and writing about the book and their feelings about math. The book, The Math Instinct by Keith Devlin, was chosen because we believed it would give the students something interesting to write about and not because we had any expectations in particular about what it might reveal about or do for their math anxiety. The nature of the responses received from the students led to the performance of a post-hoc …

Figures And First Years: An Analysis Of Calculus Students' Use Of Figures In Technical Reports, Nathan J. Antonacci, Michael Rogers, Thomas J. Pfaff, Jason G. Hamilton

Numeracy

This three-year study focused on first-year Calculus I students and their abilities to incorporate figures in technical reports. In each year, these calculus students wrote a technical report as part of the Polar Bear Module, an educational unit developed for use in partner courses in biology, computer science, mathematics, and physics as part of the Multidisciplinary Sustainability Education (MSE) project at Ithaca College. In the first year of the project, students received basic technical report guidelines. In year two, the report guidelines changed to include explicit language on how to incorporate figures. In year three, a grading rubric was added …

Shortest Path Problem Under Triangular Fuzzy Neutrosophic Information, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea, Luige Vladareanu

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, we develop a new approach to deal with neutrosphic shortest path problem in a network in which each edge weight (or length) is represented as triangular fuzzy neutrosophic number. The proposed algorithm also gives the shortest path length from source node to destination node using ranking function. Finally, an illustrative example is also included to demonstrate our proposed approach.

Complex Neutrosophic Soft Set, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea, Mumtaz Ali, Ganeshsree Selvachandran

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, we propose the complex neutrosophic soft set model, which is a hybrid of complex fuzzy sets, neutrosophic sets and soft sets. The basic set theoretic operations and some concepts related to the structure of this model are introduced, and illustrated. An example related to a decision making problem involving uncertain and subjective information is presented, to demonstrate the utility of this model.

Complex Neutrosophic Graphs Of Type 1, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, we introduced a new neutrosophic graphs called complex neutrosophic graphs of type1 (CNG1) and presented a matrix representation for it and studied some properties of this new concept. The concept of CNG1 is an extension of generalized fuzzy graphs of type 1 (GFG1) and generalized single valued neutrosophic graphs of type 1 (GSVNG1).

An Optimal Execution Problem With S-Shaped Market Impact Functions, Takashi Kato

Communications on Stochastic Analysis

No abstract provided.

Mixed Strategies For Deterministic Differential Games, Wendell H. Fleming, Daniel Hernandez-Hernandez

Communications on Stochastic Analysis

No abstract provided.

Spatial Ergodicity Of The Harris Flows, E.V. Glinyanaya

Communications on Stochastic Analysis

No abstract provided.

A Note On Evolution Systems Of Measures Of Stochastic Differential Equations In Infinite Dimensional Hilbert Spaces, Thanh Tan Mai

Communications on Stochastic Analysis

No abstract provided.

Stationary Solutions Of Stochastic Partial Differential Equations In The Space Of Tempered Distributions, Suprio Bhar

Communications on Stochastic Analysis

No abstract provided.