EXTENSION OF BM-ALGEBRA INTO AN ALGEBRAIC STRUCTURE WITH TWO BINARY OPERATIONS

2020 ◽  
Vol 9 (12) ◽  
pp. 10699-10706
Author(s):  
J. Thomas ◽  
K. Indhira
Keyword(s):  
Algebraic Structure ◽  
Binary Operations

scholarly journals On the generalization of Conway algebra

2018 ◽  
Vol 27 (02) ◽  
pp. 1850014 ◽  
Author(s):  
Seongjeong Kim
Keyword(s):  
Algebraic Structure ◽  
The Other ◽  
Second Step ◽  
Polynomial Invariant ◽  
Binary Operations ◽  
Other Hand ◽  
Skein Relation

In [Przytyski and Traczyk, Invariants of links of Conway type, Kobe J. Math. 4 (1989) 115–139], Przytyski and Traczyk introduced an algebraic structure, called a Conway algebra, and constructed an invariant of oriented links, which is a generalization of the Homflypt polynomial invariant. On the other hand, in [Kauffman and Lambropoulou, New invariants of links and their state sum models, arXiv:1703.03655v2 [math.GT] 15 Mar 2017], Kauffman and Lambropoulou introduced new 4-variable invariants of oriented links, which are obtained by two computational steps: in the first step, we apply a skein relation on every mixed crossing to produce unions of unlinked knots. In the second step, we apply another skein relation on crossings of the unions of unlinked knots, which introduces a new variable. In this paper, we will introduce a generalization of the Conway algebra [Formula: see text] with two binary operations and we construct an invariant valued in [Formula: see text] by applying those two binary operations to mixed crossings and pure crossing, respectively. The 4-variable invariant of Kauffman and Lambropoulou with a specific condition is derived from the invariant valued in [Formula: see text]. Moreover, the generalized Conway algebra gives us an invariant of oriented links, which satisfies nonlinear skein relations.

Generalizations of a Conway algebra for oriented surface-links via marked graph diagrams

2018 ◽  
Vol 27 (13) ◽  
pp. 1842014
Author(s):  
Yongju Bae ◽  
Seonmi Choi ◽  
Seongjeong Kim
Keyword(s):  
Algebraic Structure ◽  
Polynomial Invariant ◽  
Oriented Surface ◽  
Binary Operations ◽  
Marked Graphs ◽  
Marked Graph

In 1987, Przytyski and Traczyk introduced an algebraic structure, called a Conway algebra, and constructed an invariant of oriented links, which is a generalization of the HOMFLY-PT polynomial invariant. In 2018, Kim generalized a Conway algebra, which is an algebraic structure with two skein relations, which is called a generalized Conway algebra. In 2017, Joung, Kamada, Kawauchi and Lee constructed a polynomial invariant of oriented surface-links by using marked graph diagrams. In this paper, we will introduce generalizations [Formula: see text] and [Formula: see text] of a Conway algebra and a generalized Conway algebra, which are called a marked Conway algebra and a generalized marked Conway algebra, respectively. We will construct invariants valued in [Formula: see text] and [Formula: see text] for oriented marked graphs and oriented surface-links by applying binary operations to classical crossings and marked vertices via marked graph diagrams. The polynomial invariant of oriented surface-links is obtained from the invariant valued in the marked Conway algebra with additional conditions.

scholarly journals On Refined Neutrosophic R-module

2020 ◽  
pp. 87-96
Author(s):  
Necati Olgun ◽  
◽  
◽  
Ahmed Hatip
Keyword(s):  
Structural Properties ◽  
Algebraic Structure ◽  
Binary Operations ◽  
Module Homomorphism

Modules are one of the fundamental and rich algebraic structure concerning some binary operations in the study of algebra. In this paper, some basic structures of refined neutrosophic R-modules and refined neutrosophic submodules in algebra are generalized. Some properties of refined neutrosophic R-modules and refined neutrosophic submodules are presented. More precisely, classical modules and refined neutrosophic rings are utilized. Consequently, refinedneutrosophic R- modules that are completely different from the classical modular in the structural properties are introduced. Also, neutrosophic R-module homomorphism is explained and some definitions and theorems are presented.

scholarly journals MENGKONSTRUKSI DIRECT PRODUCT NEAR RING DAN SMARANDACHE NEAR RING

2019 ◽  
Vol 2 (2) ◽  
pp. 70
Author(s):  
Rizky Muhammad Bagas ◽  
Titi Udjiani SRRM ◽  
Harjito Harjito
Keyword(s):  
Direct Product ◽  
Algebraic Structure ◽  
Cartesian Product ◽  
Direct Products ◽  
Cartesian Products ◽  
Binary Operations ◽  
Products Of Groups

If we have two arbitrary non empty sets  ,then their cartesian product can be constructed. Cartesian products of two sets can be generalized into  number of  sets. It has been found that if the algebraic structure of groups and rings are seen as any set, then the phenomenon of cartesian products of  sets  can be extended to groups and rings. Direct products of groups and rings can be obtained by adding binary operations to the cartesian product. This paper answers the question of whether the direct product phenomenon of groups and rings can also be extended at the  near ring and Smarandache near ring ?. The method in this paper is  by following the method in groups and rings, namely by seen that  near ring and Smarandache near ring  as a set and then build their cartesian products. Next,  the binary operations is adding to the cartesian  products that have been obtained to build the direct product definitions of near ring and near ring Smarandache.

Pembentukan Lapangan Faktor dari Suatu Daerah Integral

2012 ◽  
Vol 8 (2) ◽  
Author(s):  
Tri Widjajanti ◽  
Dahlia Ramlan ◽  
Rium Hilum
Keyword(s):  
Polynomial Ring ◽  
Integral Domain ◽  
Rational Numbers ◽  
Ring Of Integers ◽  
Binary Operations

<em>Ring of integers under the addition and multiplication as integral domain can be imbedded to the field of rational numbers. In this paper we make&nbsp; a construction such that any integral domain can be&nbsp; a field of quotient. The construction contains three steps. First, we define element of field F from elements of integral domain D. Secondly, we show that the binary operations in fare well-defined. Finally, we prove that </em><em>&nbsp;</em><em>f</em><em> </em><em>:</em><em> </em><em>D </em><em>&reg;</em><em> </em><em>F is an isomorphisma. In this case, the polynomial ring F[x] as the integral domain can be imbedded to the field of quotient.</em>

scholarly journals Gauged double field theory as an L∞ algebra

2021 ◽  
Vol 2021 (6) ◽  
Author(s):  
Eric Lescano ◽  
Martín Mayo
Keyword(s):  
Field Theory ◽  
Algebraic Structure ◽  
Classical Field ◽  
Field Theories ◽  
Lie Derivative ◽  
Linear Perturbation ◽  
Double Field Theory ◽  
Generalized Frame ◽  
Symmetry Transformations ◽  
Classical Field Theories

Abstract L∞ algebras describe the underlying algebraic structure of many consistent classical field theories. In this work we analyze the algebraic structure of Gauged Double Field Theory in the generalized flux formalism. The symmetry transformations consist of a generalized deformed Lie derivative and double Lorentz transformations. We obtain all the non-trivial products in a closed form considering a generalized Kerr-Schild ansatz for the generalized frame and we include a linear perturbation for the generalized dilaton. The off-shell structure can be cast in an L3 algebra and when one considers dynamics the former is exactly promoted to an L4 algebra. The present computations show the fully algebraic structure of the fundamental charged heterotic string and the $$ {L}_3^{\mathrm{gauge}} $$ L 3 gauge structure of (Bosonic) Enhanced Double Field Theory.

Generalized interval-valued hesitant intuitionistic fuzzy soft sets

2021 ◽  
pp. 1-12
Author(s):  
Admi Nazra ◽  
Yudiantri Asdi ◽  
Sisri Wahyuni ◽  
Hafizah Ramadhani ◽  
Zulvera
Keyword(s):  
Hesitant Fuzzy Set ◽  
Fuzzy Soft Set ◽  
Soft Sets ◽  
Binary Operations ◽  
Intuitionistic Fuzzy ◽  
Fuzzy Soft Sets ◽  
Comparison Table ◽  
Definition Of ◽  
Interval Valued ◽  
Intuitionistic Fuzzy Soft Sets

This paper aims to extend the Interval-valued Intuitionistic Hesitant Fuzzy Set to a Generalized Interval-valued Hesitant Intuitionistic Fuzzy Soft Set (GIVHIFSS). Definition of a GIVHIFSS and some of their operations are defined, and some of their properties are studied. In these GIVHIFSSs, the authors have defined complement, null, and absolute. Soft binary operations like operations union, intersection, a subset are also defined. Here is also verified De Morgan’s laws and the algebraic structure of GIVHIFSSs. Finally, by using the comparison table, a different approach to GIVHIFSS based decision-making is presented.

scholarly journals Priestley duality for MV-algebras and beyond

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Wesley Fussner ◽  
Mai Gehrke ◽  
Samuel J. van Gool ◽  
Vincenzo Marra
Keyword(s):  
Large Class ◽  
Order Conditions ◽  
Enriched Environment ◽  
Priestley Duality ◽  
Distributive Lattices ◽  
First Order ◽  
Dual Spaces ◽  
Binary Operations ◽  
New Perspective ◽  
Mv Algebras

Abstract We provide a new perspective on extended Priestley duality for a large class of distributive lattices equipped with binary double quasioperators. Under this approach, non-lattice binary operations are each presented as a pair of partial binary operations on dual spaces. In this enriched environment, equational conditions on the algebraic side of the duality may more often be rendered as first-order conditions on dual spaces. In particular, we specialize our general results to the variety of MV-algebras, obtaining a duality for these in which the equations axiomatizing MV-algebras are dualized as first-order conditions.

scholarly journals Polymorphic Iterable Sequential Effect Systems

2021 ◽  
Vol 43 (1) ◽  
pp. 1-79
Author(s):  
Colin S. Gordon
Keyword(s):  
Algebraic Structure ◽  
Position Effect ◽  
Type Systems ◽  
Sequential Effect ◽  
Prior Work ◽  
Sequential Effects ◽  
Wide Range ◽  
The Relationship ◽  
Categorical Semantics

Effect systems are lightweight extensions to type systems that can verify a wide range of important properties with modest developer burden. But our general understanding of effect systems is limited primarily to systems where the order of effects is irrelevant. Understanding such systems in terms of a semilattice of effects grounds understanding of the essential issues and provides guidance when designing new effect systems. By contrast, sequential effect systems—where the order of effects is important—lack an established algebraic structure on effects. We present an abstract polymorphic effect system parameterized by an effect quantale—an algebraic structure with well-defined properties that can model the effects of a range of existing sequential effect systems. We define effect quantales, derive useful properties, and show how they cleanly model a variety of known sequential effect systems. We show that for most effect quantales, there is an induced notion of iterating a sequential effect; that for systems we consider the derived iteration agrees with the manually designed iteration operators in prior work; and that this induced notion of iteration is as precise as possible when defined. We also position effect quantales with respect to work on categorical semantics for sequential effect systems, clarifying the distinctions between these systems and our own in the course of giving a thorough survey of these frameworks. Our derived iteration construct should generalize to these semantic structures, addressing limitations of that work. Finally, we consider the relationship between sequential effects and Kleene Algebras, where the latter may be used as instances of the former.

Using binary operations to construct a transitive set of block transformations

2020 ◽  
Vol 30 (6) ◽  
pp. 375-389
Author(s):  
Igor V. Cherednik
Keyword(s):  
Binary Operation ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Binary Operations ◽  
The Family ◽  
Transitive Set ◽  
Necessary And Sufficient

AbstractWe study the set of transformations {ΣF : F∈ 𝓑∗(Ω)} implemented by a network Σ with a single binary operation F, where 𝓑∗(Ω) is the set of all binary operations on Ω that are invertible as function of the second variable. We state a criterion of bijectivity of all transformations from the family {ΣF : F∈ 𝓑∗(Ω)} in terms of the structure of the network Σ, identify necessary and sufficient conditions of transitivity of the set of transformations {ΣF : F∈ 𝓑∗(Ω)}, and propose an efficient way of verifying these conditions. We also describe an algorithm for construction of networks Σ with transitive sets of transformations {ΣF : F∈ 𝓑∗(Ω)}.

Sign in / Sign up

Export Citation Format

Share Document