Discrete Mathematics and Combinatorics Commons^™

Semigroups On Mod Natural Neutrosophic Elements, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

In this book the notion of semigroups under + is constructed using the Mod natural neutrosophic integers or MOD natural neutrosophic-neutrosophic numbers or mod natural neutrosophic finite complex modulo integer or MOD natural neutrosophic dual number integers or MOD natural neutrosophic special dual like number or MOD natural neutrosophic special quasi dual numbers are analysed in a systematic way. All these semigroups under + have an idempotent subsemigroup under +. This is the first time we are able to give a class of idempotent subsemigroups under + by taking only those MOD natural neutrosophic elements

Mod Relational Maps Models And Mod Natural Neutrosophic Relational Maps Models, Florentin Smarandache, K. Ilanthenral, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

Zadeh introduced the degree of membership/truth (t) in 1965 and defined the fuzzy set. Atanassov introduced the degree of non membership/falsehood (f) in 1986 and defined the intuitionistic fuzzy set. Smarandache introduced the degree of indeterminacy/neutrality (i) as independent component in 1995 (published in 1998) and defined the neutrosophic set on three components (t,i,f) = (truth, indeterminacy, falsehood). The words “neutrosophy” and “neutrosophic” were coined/invented by F. Smarandache in his 1998 book. Etymologically, “neutro-sophy” (noun) [French neutre 1), or complete information (sum of components = 1).

Mod Natural Neutrosophic Subset Semigroups, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors for the first time introduce the notion of MOD subsets using Zn ... On these MOD subsets the operation ‘+’ is defined, S(Zn) denotes the MOD subset and {S(Zn), +} happens to be only a Smarandache semigroup.

These S-semigroups enjoy several interesting properties. The notion of MOD universal subset and MOD absorbing subsets are defined and developed. {S(Zn), x } is also a semigroup and several properties associated with them are derived. MOD natural neutrosophic subsets forms only a semigroup under ‘+’. In fact the main feature enjoyed by this structure is they have subset idempotents …

Mod Cognitive Maps Models And Mod Natural Neutrosophic Cognitive Maps Models, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

Zadeh introduced the degree of membership/truth (t) in 1965 and defined the fuzzy set. Atanassov introduced the degree of non membership/falsehood (f) in 1986 and defined the intuitionistic fuzzy set. Smarandache introduced the degree of indeterminacy/neutrality (i) as independent component in 1995 (published in 1998) and defined the neutrosophic set on three components (t,i,f) = (truth, indeterminacy, falsehood). The words “neutrosophy” and “neutrosophic” were coined/invented by F. Smarandache in his 1998 book. Etymologically, “neutro-sophy” (noun) [French neutre 1), or complete information (sum of components = 1).

Special Type Of Fixed Point Pairs Using Mod Rectangular Matrix Operators, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors for the first time define a special type of fixed points using MOD rectangular matrices as operators. In this case the special fixed points or limit cycles are pairs which is arrived after a finite number of iterations. Such study is both new and innovative for it can find lots of applications in mathematical modeling. Since all these Zn or I nZ or 〈Zn ∪ g〉 or 〈Zn ∪ g〉I or C(Zn) or CI(Zn) are all of finite order we are sure to arrive at a MOD fixed point pair or a MOD limit cycle pair …

Neutrosophic Set Approach To Algebraic Structures, Florentin Smarandache, Madad Khan, Fazal Tahir

Branch Mathematics and Statistics Faculty and Staff Publications

Real world is featured with complex phenomenons. As uncertainty is inevitably involved in problems arise in various elds of life and classical methods failed to handle these type of problems. Dealing with imprecise, uncertain or imperfect information was a big task for many years. Many modelswerepresentedinordertoproperlyincorporateuncertaintyintosystem description, LotA.Zadeh in 1965 introduced the idea of a fuzzy set. Zadeh replaced conventional characteristic function of classical crisp sets which takes on its values in f0;1g by membership function which takes on its values in closed interval [0;1]. Fuzzy set theory is conceptually a very powerful technique to deal with another aspect or …

Single Valued Neutrosophic Graphs: Degree, Order And Size, Florentin Smarandache, Said Broumi, Mohamed Talea, Assia Bakali

Branch Mathematics and Statistics Faculty and Staff Publications

The single valued neutrosophic graph is a new version of graph theory presented recently as a generalization of fuzzy graph and intuitionistic fuzzy graph. The single valued neutrosophic graph (SVN-graph) is used when the relation between nodes (or vertices) in problems are indeterminate. In this paper, we examine the properties of various types of degrees, order and size of single valued neutrosophic graphs and a new definition for regular single valued neutrosophic graph is given.

The Spectral Theorem For Quaternionic Unbounded Normal Operators Based On The S-Spectrum, Daniel Alpay, Fabrizio Colombo, David P. Kimsey

Mathematics, Physics, and Computer Science Faculty Articles and Research

In this paper we prove the spectral theorem for quaternionic unbounded normal operators using the notion of S-spectrum. The proof technique consists of first establishing a spectral theorem for quaternionic bounded normal operators and then using a transformation which maps a quaternionic unbounded normal operator to a quaternionic bounded normal operator. With this paper we complete the foundation of spectral analysis of quaternionic operators. The S-spectrum has been introduced to define the quaternionic functional calculus but it turns out to be the correct object also for the spectral theorem for quaternionic normal operators. The fact that the correct notion of …

New Perspectives Of Quantum Analogues, Yue Cai

Theses and Dissertations--Mathematics

In this dissertation we discuss three problems. We first show the classical q-Stirling numbers of the second kind can be expressed more compactly as a pair of statistics on a subset of restricted growth words. We extend this enumerative result via a decomposition of a new poset which we call the Stirling poset of the second kind. The Stirling poset of the second kind supports an algebraic complex and a basis for integer homology is determined. A parallel enumerative, poset theoretic and homological study for the q-Stirling numbers of the first kind is done. We also give a bijective …

Flag F-Vectors Of Polytopes With Few Vertices, Sarah A. Nelson

Theses and Dissertations--Mathematics

We may describe a polytope P as the convex hull of n points in space. Here we consider the numbers of chains of faces of P. The toric g-vector and CD-index of P are useful invariants for encoding this information. For a simplicial polytope P, Lee defined the winding number w_k in a Gale diagram corresponding to P. He showed that w_k in the Gale diagram equals g_k of the corresponding polytope. In this dissertation, we fully establish how to compute the g-vector for any polytope with few vertices from its …

Path-Factors Involving Paths Of Order Seven And Nine, Yoshimi Egawa, Michitaka Furuya

Theory & Applications of Graphs

In this paper, we show the following two theorems (here c_i(G-Χ) is the number of components C of G-Χ with |V(C)|=i): (i) If a graph G satisfies c₁(G-Χ)+⅓c₃(G-Χ)+⅓c₅(G-Χ) ≤ ⅔ |Χ| for all Χ ≤ V(G), then G has a {Ρ₂},Ρ₇}-factor. (ii)If a graph G satisfies c₁}(G-Χ)+c₃}(G-Χ)+⅔ c₅}(G-Χ)+⅓c₇}(G-Χ) ≤ ⅔|Χ| for all Χ⊆ V(G), then G has a {P₂,P₉}-factor.

Classifying Resolving Lists By Distances Between Members, Paul Feit

Theory & Applications of Graphs

Let G be a connected graph and let w₁,…w_r be a list of vertices. We refer the choice of a triple (r;G;w₁,…w_r), as a metric selection. Let ρ be the shortest path metric of G. We say that w₁,…w_r resolves G (metricly) if the function c:V(G) → ℤ^r given by

x → (ρ (w1,x),…,ρ(wr,x))

is injective. We refer to c as the code map and to its image as the codes of the triple (r;G;w₁,…,w_r).

This paper proves basic results …

Characterizations Of Rectangular (Para)-Unitary Rational Functions, Daniel Alpay, Palle Jorgensen, Izchak Lewkowicz

Mathematics, Physics, and Computer Science Faculty Articles and Research

We here present three characterizations of not necessarily causal, rational functions which are (co)-isometric on the unit circle:
(i) through the realization matrix of Schur stable systems,
(ii) the Blaschke-Potapov product, which is then employed to introduce an easy-to-use description of all these functions with dimensions and McMillan degree as parameters,
(iii) through the (not necessarily reducible) Matrix Fraction Description (MFD).
In cases (ii) and (iii) the poles of the rational functions involved may be anywhere in the complex plane, but the unit circle (including both zero and infinity). A special attention is devoted to exploring the gap between the …

Nidus Idearum. Scilogs, Ii: De Rerum Consectatione, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

Welcome into my scientific lab! My lab[oratory] is a virtual facility with noncontrolled conditions in which I mostly perform scientific meditation and chats: a nest of ideas (nidus idearum, in Latin). I called the jottings herein scilogs (truncations of the words scientific, and gr. Λόγος – appealing rather to its original meanings "ground", "opinion", "expectation"), combining the welly of both science and informal (via internet) talks (in English, French, and Romanian). In this second book of scilogs collected from my nest of ideas, one may find new and old questions and solutions, some of them already put at work, others …

Tridiagonal Matrices And Boundary Conditions, J. J. P. Veerman, David K. Hammond

Mathematics and Statistics Faculty Publications and Presentations

We describe the spectra of certain tridiagonal matrices arising from differential equations commonly used for modeling flocking behavior. In particular we consider systems resulting from allowing an arbitrary boundary condition for the end of a one-dimensional flock. We apply our results to demonstrate how asymptotic stability for consensus and flocking systems depends on the imposed boundary condition.

Two Problems Of Gerhard Ringel, Adrian Pastine

Dissertations, Master's Theses and Master's Reports

Gerhard Ringel was an Austrian Mathematician, and is regarded as one of the most influential graph theorists of the twentieth century. This work deals with two problems that arose from Ringel's research: the Hamilton-Waterloo Problem, and the problem of R-Sequences.

The Hamilton-Waterloo Problem (HWP) in the case of C_m-factors and C_n-factors asks whether K_v, where v is odd (or K_v-F, where F is a 1-factor and v is even), can be decomposed into r copies of a 2-factor made entirely of m-cycles and s copies of a 2-factor made entirely of …

The Diameter Of A Rouquier Block, Andrew Mayer

Williams Honors College, Honors Research Projects

For my Honors Research Project, I will be researching special properties of Rouquier blocks that represent the partitions of integers. This problem is motivated by ongoing work in representation theory of the symmetric group. For each integer n and each prime p, there is an object called a Rouquier block; this block can be visualized as a collection of points in a plane, each corresponding to a partition. In this group of points, we say a pair of points is “connected” if certain conditions on the partitions are met. We compare each partition with each other partition, add edges when …

Realizing The 2-Associahedron, Patrick N. Tierney

HMC Senior Theses

The associahedron has appeared in numerous contexts throughout the field of mathematics. By representing the associahedron as a poset of tubings, Michael Carr and Satyan L. Devadoss were able to create a gener- alized version of the associahedron in the graph-associahedron. We seek to create an alternative generalization of the associahedron by considering a particle-collision model. By extending this model to what we dub the 2- associahedron, we seek to further understand the space of generalizations of the associahedron.

Interval Graphs, Joyce C. Yang

HMC Senior Theses

We examine the problem of counting interval graphs. We answer the question posed by Hanlon, of whether the formal power series generating function of the number of interval graphs on n vertices has a positive radius of convergence. We have found that it is zero. We have obtained a lower bound and an upper bound on the number of interval graphs on n vertices. We also study the application of interval graphs to the dynamic storage allocation problem. Dynamic storage allocation has been shown to be NP-complete by Stockmeyer. Coloring interval graphs on-line has applications to dynamic storage allocation. The …

Classifying Coloring Graphs, Julie Beier, Janet Fierson, Ruth Haas, Heather M. Russell, Kara Shavo

Department of Math & Statistics Faculty Publications

Given a graph G, its k-coloring graph is the graph whose vertex set is the proper k-colorings of the vertices of G with two k-colorings adjacent if they differ at exactly one vertex. In this paper, we consider the question: Which graphs can be coloring graphs? In other words, given a graph H, do there exist G and k such that H is the k-coloring graph of G? We will answer this question for several classes of graphs and discuss important obstructions to being a coloring graph involving order, girth, and induced subgraphs.