Subset Non Associative Semirings,
2013
University of New Mexico
Subset Non Associative Semirings, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book for the first time we introduce the notion of subset non associative semirings. It is pertinent to keep on record that study of non associative semirings is meager and books on this specific topic is still rare. Authors have recently introduced the notion of subset algebraic structures. The maximum algebraic structure enjoyed by subsets with two binary operations is just a semifield and semiring, even if a ring or a field is used. In case semigroups or groups are used still the algebraic structure of the subset is only a semigroup. To construct a subset non associative …
Subset Interval Groupoids,
2013
University of New Mexico
Subset Interval Groupoids, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
The study of groupoids is meager and we have recently introduced the new notion of subset groupoids and have studied them. It is interesting to keep on record that interval groupoids have been studied by us in 2010. Further when the subsets of a loop are taken they also form only a subset groupoid and not a subset loop. Thus we do not have the concept of subset interval loop they only form a subset interval groupoid. Special elements like subset interval zero divisors, subset interval idempotents and subset interval units are studied. Concept of subset interval groupoid homomorphism is …
Algebraic Structures Using Subsets,
2013
University of New Mexico
Algebraic Structures Using Subsets, Florentin Smarandache, W.B Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
The study of subsets and giving algebraic structure to these subsets of a set started in the mid 18th century by George Boole. The first systematic presentation of Boolean algebra emerged in 1860s in papers written by William Jevons and Charles Sanders Peirce. Thus we see if P(X) denotes the collection of all subsets of the set X, then P(X) under the op erations of union and intersection is a Boolean algebra. Next the subsets of a set was used in the construction of topological spaces. We in this book consider subsets of a semigroup or a group or a …
Fuzzy Analysis Of School Dropouts And Their Life After,
2013
University of New Mexico
Fuzzy Analysis Of School Dropouts And Their Life After, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Amal, K. Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors study and analyze the problem of school dropouts and their life after. The problems can by no means be analyzed by collecting the numerical data. For such data can only serve as information beyond that the data can be of no use, for the school dropouts suffer an environment change after becoming a school dropout. Thus the emotions of the school dropout; is technically involved. A school dropout can be a child labourer, a rag picker or a social miscreant or be in police custody or be in a rehabilitation home if he/she is a runaway. …
Algebraic Structures Using [0,N),
2013
University of New Mexico
Algebraic Structures Using [0,N), Florentin Smarandache, Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors for the first time introduce a new method of building algebraic structures on the interval [0, n). This study is interesting and innovative. However, [0, n) is a semigroup under product, × modulo n and a semigroup under min or max operation. Further [0, n) is a group under addition modulo n. We see [0, n) under both max and min operation is a semiring. [0, n) under + and × is not in general a ring. We define S = {[0, n), +, ×} to be a pseudo special ring as the distributive law is …
Set Theoretic Approach To Algebraic Structures In Mathematics - A Revelation,
2013
University of New Mexico
Set Theoretic Approach To Algebraic Structures In Mathematics - A Revelation, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors bring out how sets in algebraic structure can be used to construct most generalized algebraic structures, like set linear algebra/vector space, set ideals in rings and semigroups. This sort of study is not only innovative but infact very helpful in cases instead of working with a large data we can work with a considerably small data. Thus instead of working with a vector space or a linear algebra V over a field F we can work with a subset in V and a needed subset in F, this can save both time and economy. The concept …
Fuzzy Neutrosophic Models For Social Scientists,
2013
University of New Mexico
Fuzzy Neutrosophic Models For Social Scientists, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book, authors give the notion of different neutrosophic models like, neutrosophic cognitive maps (NCMs), neutrosophic relational maps (NEMs), neutrosophic relational equations (NREs), neutrosophic bidirectional associative memories (NBAMs) and neutrosophic associative memories (NAMs) for socio scientists. This book has six chapters. The first chapter introduces the basic concepts of neutrosophic numbers and notions about neutrosophic graphs which are essential to construct these neutrosophic models. In chapter two we describe the concept of neutrosophic matrices and the essential operations related with them which are used in the study and working of these neutrosophic models. However the reader must be familiar …
Variance On Topics Of Plane Geometry,
2013
University of New Mexico
Variance On Topics Of Plane Geometry, Florentin Smarandache, Ion Patrascu
Branch Mathematics and Statistics Faculty and Staff Publications
This book contains 21 papers of plane geometry. It deals with various topics, such as: quasi-isogonal cevians, nedians, polar of a point with respect to a circle, anti-bisector, aalsonti-symmedian, anti-height and their isogonal. A nedian is a line segment that has its origin in a triangle’s vertex and divides the opposite side in Q equal segments. The papers also study distances between remarkable points in the 2D-geometry, the circumscribed octagon and the inscribable octagon, the circles adjointly ex-inscribed associated to a triangle, and several classical results such as: Carnot circles, Euler’s line, Desargues theorem, Sondat’s theorem, Dergiades theorem, Stevanovic’s theorem, …
The Two-Phase Arterial Blood Flow With Or Without A Catheter And In The Presence Of A Single Or Multi Stenosis,
2013
The University of Texas Rio Grande Valley
The Two-Phase Arterial Blood Flow With Or Without A Catheter And In The Presence Of A Single Or Multi Stenosis, Ani E. Garcia, Daniel N. Riahi
School of Mathematical & Statistical Sciences Faculty Publications
We consider the problem of blood flow in an artery with or without a catheter and in the presence of single or multi stenosis whose shape is based on the available experimental data for the stenosis in a human’s artery. The presence of stenosis in the artery, which locally narrows portion of the artery, can be a result of fatty materials such as cholesterol in the blood. The use of catheter is important as a standard tool for diagnosis and treatment in patience whose blood flow passage in the artery is affected adversely by the presence of the stenosis within …
Investigating The Validity Of A Survey Intended To Gauge Mathematics Problem-Solving Disposition Along The Impulsive-Analytic Dimension,
2013
University of Texas at El Paso
Investigating The Validity Of A Survey Intended To Gauge Mathematics Problem-Solving Disposition Along The Impulsive-Analytic Dimension, Miguel Mendoza
Open Access Theses & Dissertations
This study investigates the validity of the Likelihood-to-Act (LtA) survey developed to assess respondents' problem-solving disposition along the impulsive-analytic dimension. Sixteen pre-service teachers were strategically selected from a pool of 495 LtA survey respondents to participate in a semi-structured task-based interview approximately one hour in length. The interview consisted of three main parts: a problem solving section, a consistency section, and a classification section.
* Part 1 of the interview was developed to get interviewees to solve five open-response problems meant to elicit an impulsive response. Interviewees were also asked to verbalize their thought process in order for the researchers …
The Weierstrass Approximation Theorem,
2013
University of South Carolina
The Weierstrass Approximation Theorem, Larita Barnwell Hipp
Theses and Dissertations
In this thesis we will consider the work began by Weierstrass in 1855 and several generalization of his approximation theorem since. Weierstrass began by proving the density of algebraic polynomials in the space of continuous real-valued functions on a finite interval in the uniform norm. His theorem has been generalized to an arbitrary compact Hausdorff space and the approximation with elements from more general algebras of continuous real-valued functions. We will consider proofs that use brute force and proofs based on convolutions and approximate identities, trudge through probability and the use of the Bernstein polynomials, and become intimately close to …
Deducing Vertex Weights From Empirical Occupation Times,
2013
University of South Carolina
Deducing Vertex Weights From Empirical Occupation Times, David Collins
Theses and Dissertations
We consider the following problem arising from the study of human problem solving: Let $G$ be a vertex-weighted digraph with marked "start" and "end" vertices. Suppose that a random walker begins at the start vertex, steps to neighbors of vertices with probability proportional to their weights, and stops upon reaching the end vertex. Could one deduce the weights from the paths that many such walkers take? We analyze an iterative numerical solution to this reconstruction problem, in particular, given the empirical mean occupation times of the walkers. We then consider the existence of a choice of weights for a given …
The Compact Implicit Integration Factor Scheme For The Solution Of Allen-Cahn Equations,
2013
University of South Carolina - Columbia
The Compact Implicit Integration Factor Scheme For The Solution Of Allen-Cahn Equations, Meshack K. Kiplagat
Theses and Dissertations
In this thesis we apply the compact implicit integration factor (cIIF) scheme towards solving the Allen-Cahn equations with zero-flux or periodic boundary conditions. The Allen-Cahn equation is a second-order nonlinear PDE which has been the focus of many applications spanning a wide range of fields, such as in material science where it was first introduced to model the phase separation of two metallic alloys, and in biology to study population dynamics, just to name a few. The compact implicit integration method works by first transforming the PDE into a system of ODEs by discretizing the spatial derivatives using the central …
Selected Research In Covering Systems Of The Integers And The Factorization Of Polynomials,
2013
University of South Carolina - Columbia
Selected Research In Covering Systems Of The Integers And The Factorization Of Polynomials, Joshua Harrington
Theses and Dissertations
In 1960, Sierpi\'{n}ski proved that there exist infinitely many odd positive integers $k$ such that $k\cdot 2^n+1$ is composite for all positive integers $n$. Such integers are known as Sierpi\'{n}ski numbers. Letting $f(x)=ax^r+bx+c\in\mathbb{Z}[x]$, Chapter 2 of this document explores the existence of integers $k$ such that $f(k)2^n+d$ is composite for all positive integers $n$. Chapter 3 then looks into a polynomial variation of a similar question. In particular, Chapter~\ref{CH:FH} addresses the question, for what integers $d$ does there exist a polynomial $f(x)\in\mathbb{Z}[x]$ with $f(1)\neq -d$ such that $f(x)x^n+d$ is reducible for all positive integers $n$. The last two chapters of …
Identifying Requirements For The Invasion Of A Tick Species And Tick-Borne Pathogen Through Ticksim,
2013
Old Dominion University
Identifying Requirements For The Invasion Of A Tick Species And Tick-Borne Pathogen Through Ticksim, Holly Gaff, Robyn Nadolny
Biological Sciences Faculty Publications
Ticks and tick-borne diseases have been on the move throughout the United State over the past twenty years. We use an agent-based model, TICKSIM, to identify the key parameters that determine the success of invasion of the tick and if that is successful, the success of the tick-borne pathogen. We find that if an area has competent hosts, an initial population of ten ticks is predicted to always establish a new population. The establishment of the tick-borne pathogen depends on three parameters: the initial prevalence in the ten founding ticks, the probability that a tick infects the longer-lived hosts and …
On Equivalent Characterizations Of Convexity Of Functions,
2013
The University of Texas Rio Grande Valley
On Equivalent Characterizations Of Convexity Of Functions, Eleftherios Gkioulekas
School of Mathematical & Statistical Sciences Faculty Publications
A detailed development of the theory of convex functions, not often found in complete form in most textbooks, is given. We adopt the strict secant line definition as the definitive definition of convexity. We then show that for differentiable functions, this definition becomes logically equivalent with the first derivative monotonicity definition and the tangent line definition. Consequently, for differentiable functions, all three characterizations are logically equivalent.
Nominal Computation Theory (Dagstuhl Seminar 13422),
2013
University of Warsaw
Nominal Computation Theory (Dagstuhl Seminar 13422), Mikołaj Bojanczyk, Bartek Klin, Alexander Kurz, Andrew M. Pitts
Engineering Faculty Articles and Research
This report documents the program and the outcomes of Dagstuhl Seminar 13422 “Nominal Computation Theory”. The underlying theme of the seminar was nominal sets (also known as sets with atoms or Fraenkel-Mostowski sets) and they role and applications in three distinct research areas: automata over infinite alphabets, program semantics using nominal sets and nominal calculi of concurrent processes.
Dynamic Sequent Calculus For The Logic Of Epistemic Actions And Knowledge,
2013
University of Amsterdam
Dynamic Sequent Calculus For The Logic Of Epistemic Actions And Knowledge, Giuseppe Greco, Alexander Kurz, Alessandra Palmigiano
Engineering Faculty Articles and Research
"Dynamic Logics (DLs) form a large family of nonclassical logics, and perhaps the one enjoying the widest range of applications. Indeed, they are designed to formalize change caused by actions of diverse nature: updates on the memory state of a computer, displacements of moving robots in an environment, measurements in models of quantum physics, belief revisions, knowledge updates, etc. In each of these areas, DL-formulas express properties of the model encoding the present state of affairs, as well as the pre- and post-conditions of a given action. Actions are semantically represented as transformations of one model into another, encoding the …
Epistemic Updates On Algebras,
2013
Chapman University
Epistemic Updates On Algebras, Alexander Kurz, Alessandra Palmigiano
Engineering Faculty Articles and Research
We develop the mathematical theory of epistemic updates with the tools of duality theory. We focus on the Logic of Epistemic Actions and Knowledge (EAK), introduced by Baltag-Moss-Solecki, without the common knowledge operator. We dually characterize the product update construction of EAK as a certain construction transforming the complex algebras associated with the given model into the complex algebra associated with the updated model. This dual characterization naturally generalizes to much wider classes of algebras, which include, but are not limited to, arbitrary BAOs and arbitrary modal expansions of Heyting algebras (HAOs). As an application of this dual characterization, we …
Nominal Coalgebraic Data Types With Applications To Lambda Calculus,
2013
Chapman University
Nominal Coalgebraic Data Types With Applications To Lambda Calculus, Alexander Kurz, Daniela Petrişan, Paula Severi, Fer-Jan De Vries
Engineering Faculty Articles and Research
We investigate final coalgebras in nominal sets. This allows us to define types of infinite data with binding for which all constructions automatically respect alpha equivalence. We give applications to the infinitary lambda calculus.
