Filters Via Neutrosophic Crisp Sets,
2013
University of New Mexico
Filters Via Neutrosophic Crisp Sets, A. A. Salama, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
In this paper we introduce the notion of filter on the neutrosophic crisp set, then we consider a generalization of the filter’s studies. Afterwards, we present the important neutrosophic crisp filters. We also study several relations between different neutrosophic crisp filters and neutrosophic topologies. Possible applications to database systems are touched upon.
More On Intuitionistic Neutrosophic Soft Sets,
2013
University of New Mexico
More On Intuitionistic Neutrosophic Soft Sets, Said Broumi, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
Intuitionistic Neutrosophic Soft Set theory proposed by S. Broumi and F. Samarandache [28], has been regarded as an effective mathematical tool to deal with uncertainties. In this paper new operations on intuitionistic neutrosophic soft sets have been introduced . Some results relating to the properties of these operations have been established. Moreover ,we illustrate their interconnections between each other.
Quasi Set Topological Vector Subspaces,
2012
University of New Mexico
Quasi Set Topological Vector Subspaces, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book the authors introduce four types of topological vector subspaces. All topological vector subspaces are defined depending on a set. We define a quasi set topological vector subspace of a vector space depending on the subset S contained in the field F over which the vector space V is defined. These quasi set topological vector subspaces defined over a subset can be of finite or infinite dimension. An interesting feature about these spaces is that there can be several quasi set topological vector subspaces of a given vector space. This property helps one to construct several spaces with …
Non Associative Linear Algebras,
2012
University of New Mexico
Non Associative Linear Algebras, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors for the first time introduce the notion of non associative vector spaces and non associative linear algebras over a field. We construct non associative space using loops and groupoids over fields. In general in all situations, which we come across to find solutions may not be associative; in such cases we can without any difficulty adopt these non associative vector spaces/linear algebras. Thus this research is a significant one.
This book has six chapters. First chapter is introductory in nature. The new concept of non associative semilinear algebras is introduced in chapter two. This structure is …
Neutrosophic Masses & Indeterminate Models Applications To Information Fusion,
2012
University of New Mexico
Neutrosophic Masses & Indeterminate Models Applications To Information Fusion, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
In this paper we introduce the indeterminate models in information fusion, which are due either to the existence of some indeterminate elements in the fusion space or to some indeterminate masses. The best approach for dealing with such models is the neutrosophic logic.
Abelian Groups With Partial Decomposition Bases In LΔ∞Ω, Part Ii,
2012
Jacoby Consulting
Abelian Groups With Partial Decomposition Bases In LΔ∞Ω, Part Ii, Carol Jacoby, Peter Loth
Mathematics Faculty Publications
We consider abelian groups with partial decomposition bases in Lδ∞ω for ordinals δ. Jacoby, Leistner, Loth and Str¨ungmann developed a numerical invariant deduced from the classical global Warfield invariant and proved that if two groups have identical modified Warfield invariants and Ulm-Kaplansky invariants up to ωδ for some ordinal δ, then they are equivalent in Lδ∞ω. Here we prove that the modified Warfield invariant is expressible in Lδ∞ω and hence the converse is true for appropriate δ.
Set Ideal Topological Spaces,
2012
University of New Mexico
Set Ideal Topological Spaces, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book the authors for the first time introduce a new type of topological spaces called the set ideal topological spaces using rings or semigroups, or used in the mutually exclusive sense. This type of topological spaces use the class of set ideals of a ring (semigroups). The rings or semigroups can be finite or infinite order. By this method we get complex modulo finite integer set ideal topological spaces using finite complex modulo integer rings or finite complex modulo integer semigroups. Also authors construct neutrosophic set ideal toplogical spaces of both finite and infinite order as well as …
Abelian Groups With Partial Decomposition Bases In LΔ∞Ω, Part I,
2012
Jacoby Consulting
Abelian Groups With Partial Decomposition Bases In LΔ∞Ω, Part I, Carol Jacoby, Katrin Leistner, Peter Loth, Lutz Strungmann
Mathematics Faculty Publications
We consider the class of abelian groups possessing partial decomposition bases in Lδ∞ω for δ an ordinal. This class contains the class of Warfield groups which are direct summands of simply presented groups or, alternatively, are abelian groups possessing a nice decomposition basis with simply presented cokernel. We prove a classification theorem using numerical invariants that are deduced from the classical Ulm-Kaplansky and Warfield invariants. This extends earlier work by Barwise-Eklof, Göbel and the authors.
A Comparison Of Category And Lebesgue Measure,
2011
California State University, San Bernardino
A Comparison Of Category And Lebesgue Measure, Adam Matthew Moore
Theses Digitization Project
This study, Lebesgue measure and category have proved to be useful tools in describing the size of sets. The notions of category and Lebesgue measure are commonly used to describe the size of a set of real numbers (or of a subset of Rn). Although cardinality is also a measure of the size of a set, category and measure are often the more important gauges of size when studying properties of classes of real functions, such as the space of continuous functions or the space of derivatives.
Algebraic Structures Using Super Interval Matrices,
2011
University of New Mexico
Algebraic Structures Using Super Interval Matrices, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
The advantage of using super interval matrices is that one can build only one vector space using m × n interval matrices, but in case of super interval matrices we can have several such spaces depending on the partition on the interval matrix.
This book has seven chapters. Chapter one is introductory in nature, just introducing the super interval matrices or interval super matrices. In chapter two essential operations on super interval matrices are defined. Further in this chapter algebraic structures are defined on these super interval matrices using these operation. Using these super interval matrices semirings and semivector spaces …
Interval Algebraic Bistructures,
2011
University of New Mexico
Interval Algebraic Bistructures, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
Authors in this book construct interval bistructures using only interval groups, interval loops, interval semigroups and interval groupoids. Several results enjoyed by these interval bistructures are described. By this method, we obtain interval bistructures which are associative or non associative or quasi associative. The term quasi is used mainly in the interval bistructure B = B1 ∪ B2 (or in n-interval structure) if one of B1 (or B2) enjoys an algebraic property and the other does not enjoy that property (one section of interval structure satisfies an algebraic property and the remaining section does not satisfy that particular property). The …
Neutrosophic Code,
2011
University of New Mexico
Neutrosophic Code, Mumtaz Ali, Florentin Smarandache, Munazza Naz, Muhammad Shabir
Branch Mathematics and Statistics Faculty and Staff Publications
The idea of neutrosophic code came into my mind at that time when i was reading the literature about linear codes and i saw that, if there is data transformation between a sender and a receiver. They want to send 11and 00 as codewords. They suppose 11 for true and 00 for false. When the sender sends the these two codewords and the error occurs. As a result the receiver received 01 or 10 instead of 11 and 00. This story give a way to the neutrosophic codes and thus we introduced neutrosophic codes over finite field in this paper.
Generalized Interval Neutrosophic Soft Set And Its Decision Making Problem,
2011
University of New Mexico
Generalized Interval Neutrosophic Soft Set And Its Decision Making Problem, Said Broumi
Branch Mathematics and Statistics Faculty and Staff Publications
In this work, we introduce the concept of generalized interval neutrosophic soft set and study their operations. Finally, we present an application of generalized interval neutrosophic soft set in decision making problem.
G-Neutrosophic Space,
2011
University of New Mexico
G-Neutrosophic Space, Mumtaz Ali, Florentin Smarandache, Munazza Naz, Muhammad Shabir
Branch Mathematics and Statistics Faculty and Staff Publications
The Concept of a G-space came into being as a consequence of Group action on an ordinary set. Over the history of Mathematics and Algebra, theory of group action has emerged and proven to be an applicable and effective framework for the study of different kinds of structures to make connection among them.
A New Approach To Algebraic Coding Theory Through The Applications Of Soft Sets,
2011
University of New Mexico
A New Approach To Algebraic Coding Theory Through The Applications Of Soft Sets, Florentin Smarandache, Mumtaz Ali
Branch Mathematics and Statistics Faculty and Staff Publications
Algebraic codes play a signifcant role in the minimisation of data corruption which caused by defects such as inference, noise channel, crosstalk, and packet loss. In this paper, we introduce soft codes (soft linear codes) through the application of soft sets which is an approximated collection of codes. We also discuss several types of soft codes such as type-1 soft codes, complete soft codes etc. Further, we construct the soft generator matrix and soft parity check matrix for the soft linear codes. Moreover, we develop two techniques for the decoding of soft codes.
Contradiction Measures And Specificity Degrees Of Basic Belief Assignments,
2011
University of New Mexico
Contradiction Measures And Specificity Degrees Of Basic Belief Assignments, Florentin Smarandache, Arnaud Martin, Christophe Osswald
Branch Mathematics and Statistics Faculty and Staff Publications
In the theory of belief functions, many measures of uncertainty have been introduced. However, it is not always easy to understand what these measures really try to represent. In this paper, we re-interpret some measures of uncertainty in the theory of belief functions. We present some interests and drawbacks of the existing measures. On these observations, we introduce a measure of contradiction. Therefore, we present some degrees of non-specificity and Bayesianity of a mass. We propose a degree of specificity based on the distance between a mass and its most specific associated mass. We also show how to use the …
The Mathematical Landscape,
2011
Claremont McKenna College
The Mathematical Landscape, Antonio Collazo
CMC Senior Theses
The intent of this paper is to present the reader will enough information to spark a curiosity in to the subject. By no means is the following a complete formulation of any of the topics covered. I want to give the reader a tour of the mathematical landscape. There are plenty of further details to explore in each section, I have just touched the tip the iceberg. The work is basically in four sections: Numbers, Geometry, Functions, Sets and Logic, which are the basic building blocks of Math. The first sections are a exposition into the mathematical objects and their …
The Four-Color Theorem And Chromatic Numbers Of Graphs,
2010
Lynchburg College
The Four-Color Theorem And Chromatic Numbers Of Graphs, Sarah E. Cates
Undergraduate Theses and Capstone Projects
We study graph colorings of the form made popular by the four-color theorem. Proved by Appel and Haken in 1976, the Four-Color Theorem states that all planar graphs can be vertex-colored with at most four colors. We consider an alternate way to prove the Four-Color Theorem, introduced by Hadwiger in 1943 and commonly know as Hadwiger’s Conjecture. In addition, we examine the chromatic number of graphs which are not planar. More specifically, we explore adding edges to a planar graph to create a non-planar graph which has the same chromatic number as the planar graph which we started from.
Non Bayesian Conditioning And Deconditioning,
2010
University of New Mexico
Non Bayesian Conditioning And Deconditioning, Jean Dezert, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
In this paper, we present a Non-Bayesian conditioning rule for belief revision. This rule is truly Non-Bayesian in the sense that it doesn’t satisfy the common adopted principle that when a prior belief is Bayesian, after conditioning by X, Bel(X|X) must be equal to one. Our new conditioning rule for belief revision is based on the proportional conflict redistribution rule of combination developed in DSmT (Dezert-Smarandache Theory) which abandons Bayes’ conditioning principle. Such Non-Bayesian conditioning allows to take into account judiciously the level of conflict between the prior belief available and the conditional evidence. We also introduce the deconditioning problem …
Towards A Formal Theory Of Interoperability,
2010
Old Dominion University
Towards A Formal Theory Of Interoperability, Saikou Y. Diallo
Computational Modeling & Simulation Engineering Theses & Dissertations
This dissertation proposes a formal theory of interoperability that explains 1) what interoperability is as opposed to how it works, 2) how to tell whether two or more systems can interoperate and 3) how to identify whether systems are interoperating or merely exchanging bits and bytes. The research provides a formal model of data in M&S that captures all possible representations of a real or imagined thing and distinguishes between existential dependencies and transformational dependencies. Existential dependencies capture the relationships within a model while transformational dependencies capture the relationships between interactions with a model. These definitions are used to formally …
